Computer scienceAlgorithms and data structuresAlgorithmsGraph algorithmsShortest path algorithms

Dijkstra's algorithm

Statements

Report a typo

Which statements below about Dijkstra's algorithm are correct?

Select one or more options from the list

The algorithm finds the shortest paths between all pairs of nodes in a graph

The algorithm finds the shortest paths from a given node to all other nodes of a graph

The algorithm does not work for unweighted graphs

The algorithm works only for directed graphs

The algorithm works only for undirected graphs

The algorithm does not work if there are edges with a negative weight in a graph

Create a free account to access the full topic