Question 26
Which algorithm is used to find the Single Source Shortest Path in a weighted graph with non-negative edge weights?
Dijkstra's algorithm greedily finds single-source shortest paths in graphs with non-negative edge weights in O((V + E) log V) time using a min-priority queue.