An algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.

"Dijkstra's algorithm can be used in mapping services to find the shortest driving route between two locations."