Dijkstra's algorithm finds the shortest path from one source to every other vertex in a graph with non-negative edge weights.