Dijkstra's algorithm is used to find the _______ path between two nodes in a _______ graph.

  • Fastest, Unweighted
  • Longest, Weighted
  • Optimal, Bipartite
  • Shortest, Directed
Dijkstra's algorithm is used to find the shortest path between two nodes in a weighted graph. The term "shortest" refers to the minimum sum of weights along the path, and "weighted" implies that each edge has an associated numerical value.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *