Combinatorica`

Combinatorica`

AllPairsShortestPath

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

AllPairsShortestPath[g]

gives a matrix, where the entry is the length of a shortest path in g between vertices and .

AllPairsShortestPath[g,Parent]

returns a three-dimensional matrix with dimensions 2*V[g]*V[g], in which the entry is the length of a shortest path from to and the entry is the predecessor of in a shortest path from to .

Details and Options

AllPairsShortestPath functionality is now available in the built-in Wolfram Language function GraphDistanceMatrix.
To use AllPairsShortestPath, you first need to load the Combinatorica Package using Needs["Combinatorica`"].

Examples

Basic Examples (2)Summary of the most common use cases

In[1]:=1

✖

https://wolfram.com/xid/0di8w95y9cfo9b9ickm-rmcvi

In[2]:=2

✖

https://wolfram.com/xid/0di8w95y9cfo9b9ickm-euxtzb

In[3]:=3

✖

https://wolfram.com/xid/0di8w95y9cfo9b9ickm-jomgqx

Out[3]=3

In[4]:=4

✖

https://wolfram.com/xid/0di8w95y9cfo9b9ickm-c7xwog

Out[4]=4

AllPairsShortestPath has been superseded by GraphDistanceMatrix:

In[1]:=1

✖

https://wolfram.com/xid/0di8w95y9cfo9b9ickm-ec1xd2

Out[1]=1

In[2]:=2

✖

https://wolfram.com/xid/0di8w95y9cfo9b9ickm-q4ahb

Out[2]=2

Top