gives a matrix in which the (i,j) entry is the length of a shortest path in g between vertices i and j.
returns a three-dimensional matrix in which the (1,i,j) entry is the length of a shortest path from i to j and the (2,i,j) entry is the predecessor of j in a shortest path from i to j.
Details and Options
- GraphDistanceMatrix functionality is now available in the built-in Wolfram Language function GraphDistanceMatrix.
- To use GraphDistanceMatrix, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- The following options can be given:
Method Automatic the method used to compute the shortest path Weighted True whether edge weights are to be taken into account
Examplesopen allclose all
Basic Examples (2)
This function has been superseded by GraphDistanceMatrix in the Wolfram System:
Wolfram Research (2007), GraphDistanceMatrix, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/GraphDistanceMatrix.html.
Wolfram Language. 2007. "GraphDistanceMatrix." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/GraphDistanceMatrix.html.
Wolfram Language. (2007). GraphDistanceMatrix. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/GraphUtilities/ref/GraphDistanceMatrix.html