Dijkstra's algorithm is a graph algorithm for finding the shortest paths from a starting node to other nodes in a weighted graph with nonnegative edge weights. It is used in routing, network analysis, path planning, and other optimization problems.
An algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks.