Dijkstra's algorithm finds the shortest path from a source node to all other nodes in a graph with non-negative edge weights.