Shortest Paths and the Minimum Spanning Tree on a Graph with Cartesian Edge Weights

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

This Demonstration provides a visualization of the shortest path between two vertices on a graph and the minimum spanning tree of the graph. The edge weights are set to be the Cartesian distances between vertices. The shortest paths are calculated by Dijkstra's algorithm, while the minimum spanning tree is found using Prim's algorithm.

Contributed by: Stephen Eltinge (March 2011)
Open content licensed under CC BY-NC-SA



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.