algo

Question

if all edge in the graph have distinct weight the the sortest path between two vertex is unique?/

Answer 1

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.