Matrix of shortest-path distances between all pairs of graph vertices
GraphDistanceMatrix[g]
GraphDistanceMatrix[g, d]
GraphDistanceMatrix[{v -> w, …}, …]
Table[Max[GraphDistanceMatrix[g][[1]]], {g, {a, b, c}}]
→ {a, b, c}MatrixPlot[GraphDistanceMatrix[GridGraph[{20, 20}]]]
→ -Graphics-MatrixPlot[GraphDistanceMatrix[KnightTourGraph[20, 20]]]
→ -Graphics-- EdgeWeight — default Automatic
- Method — default Automatic