GRAPH UTILITIES PACKAGE SYMBOL

# 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:
•  Weighted False specifies whether edge weight is to be used in calculating distance

## ExamplesExamplesopen allclose all

### Basic Examples (1)Basic Examples (1)

This defines a simple directed graph:

 Out[3]=

This calculates the distance from vertex 1 to vertex 5:

 Out[4]=

There is no path from vertex 4 to vertex 1:

 Out[5]=

This defines a simple directed graph with edge weights:

 Out[7]=

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

 Out[8]=

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

 Out[9]=