GraphDistanceMatrix

GraphDistanceMatrix[g]
gives the matrix of distances between vertices for the graph g.

GraphDistanceMatrix[g, d]
gives the matrix of distances between vertices of maximal distance d in the graph g.

Details and OptionsDetails and Options

  • GraphDistanceMatrix returns a SparseArray object or an ordinary matrix.
  • The entries of the distance matrix give the shortest distance from vertex to vertex .
  • The diagonal entries of the distance matrix are always zero.
  • The entry is Infinity () if there is no path from vertex to vertex .
  • In GraphDistanceMatrix[g, d], an entry will be Infinity if there is no path from vertex to vertex in d steps or less.
  • The vertices are assumed to be in the order given by VertexList[g].
New in 8
New to Mathematica? Find your learning path »
Have a question? Ask support »