GraphUtilities`
GraphUtilities`

# GraphDistanceMatrix

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>

GraphDistanceMatrix[g]

gives a matrix in which the (i,j) entry is the length of a shortest path in g between vertices i and j.

GraphDistanceMatrix[g,Parent]

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

# Examples

open allclose all

## Basic Examples(2)

 In[1]:=

This defines a simple directed graph:

 In[2]:=
 In[3]:=
 Out[3]=

This calculates the distance between the vertices:

 In[4]:=
 Out[4]//MatrixForm=

This function has been superseded by GraphDistanceMatrix in the Wolfram System:

 In[1]:=
 Out[1]=
 In[2]:=
 Out[2]//MatrixForm=