0 votes 0 votes if all edge in the graph have distinct weight the the sortest path between two vertex is unique?/ Algorithms graph-algorithms shortest-path + – Chandra Bhushan Kuma asked Dec 19, 2015 • retagged Jun 23, 2022 by makhdoom ghaya Chandra Bhushan Kuma 285 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Maybe not possible if total weight from source to destination vertex is equal for two different routes. But if you use min priority queue then may be possible that it will give same shortest path always. ASHUTOSH KAKADIYA answered Dec 21, 2015 ASHUTOSH KAKADIYA comment Share Follow See all 0 reply Please log in or register to add a comment.