GraphDistance


gives the distance from vertex i to vertex j in the graph g.

Details and OptionsDetails and Options

  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • returns the graph distance from one vertex to another. Infinity is returned if no path exists from i to j. By default every edge is assumed to have an edge weight of 1.
  • The following option can be used:
  • WeightedFalsespecifies whether edge weight is to be used in calculating distance

ExamplesExamplesopen allclose all

Basic Examples (1)Basic Examples (1)

In[1]:=
Click for copyable input

This defines a simple directed graph:

In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=

This calculates the distance from vertex 1 to vertex 5:

In[4]:=
Click for copyable input
Out[4]=

There is no path from vertex 4 to vertex 1:

In[5]:=
Click for copyable input
Out[5]=

This defines a simple directed graph with edge weights:

In[6]:=
Click for copyable input
In[7]:=
Click for copyable input
Out[7]=

This shows that the distance from vertex 1 to 3 is 2 if unit edge weights are assumed:

In[8]:=
Click for copyable input
Out[8]=

But the distance becomes 0 if edge weights are taken into account:

In[9]:=
Click for copyable input
Out[9]=
New to Mathematica? Find your learning path »
Have a question? Ask support »