|
|
||
|
|
| Graph Utilities Package Symbol | Tutorials »|See Also »|More About » |
Needs["GraphUtilities`"] This defines a simple directed graph:
This calculates the distance from vertex 1 to vertex 5:
There is no path from vertex 4 to vertex 1:
This defines a simple directed graph with edge weights:
This shows that the distance from vertex 1 to 3 is 2 if unit edge weights are assumed:
But the distance becomes 0 if edge weights are taken into account:
|
| © 2008 Wolfram Research, Inc. |