dijkstra
Compute shortest-path distances from a single source node in a graph. tldr-pages
On several platforms
Several platforms
Compute distances from a given source node in a graph file
dijkstra source_node_fileIdentifyTreat the graph as directed when computing distances
dijkstra -d source_node_fileIdentifyRecord the previous closest node for each node on the shortest path
dijkstra -p source_node_fileIdentifyassign large distance values to unreachable nodes
dijkstra -a source_node_fileIdentify