dijkstra
Compute shortest-path distances from a single source node in a graph. More information: https://graphviz.org/pdf/dijkstra.1.pdf.
- Compute distances from a given source node in a graph file:
dijkstra
- Treat the graph as [d]irected when computing distances:
dijkstra -d
- Record the [p]revious closest node for each node on the shortest path:
dijkstra -p
- [a]ssign large distance values to unreachable nodes:
dijkstra -a
来源:tldr-pages contributors · 作者与贡献记录 · CC BY 4.0。离线整理了版式、链接和媒体显示。
