Shortest path in a weighted graph(if many then lexicographically smallest)

Revision en1, by fluffy_x, 2018-08-03 09:37:31

How to find the shortest path in a weighted graph(**if many then lexicographically smallest**) using Dijkstra? — I am getting WA on 2 test cases - Problem link :Your text to link here... - Although this can be solved using BFS, but I want to know do when the graph is weighted?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English fluffy_x 2018-08-03 09:37:31 412 Initial revision (published)