Wolfram Demonstrations Project

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

Automatic Animation

Graph (Wolfram MathWorld)

Minimum Spanning Tree (Wolfram MathWorld)

Dijkstra's Algorithm (Wolfram MathWorld)

"Shortest Paths and the Minimum Spanning Tree on a Graph with Cartesian Edge Weights" from the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/ShortestPathsAndTheMinimumSpanningTreeOnAGraphWithCartesianE/

Contributed by: Stephen Eltinge

- Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Download Demonstration as CDF »

Download Author Code »(preview »)

Files require Wolfram CDF Player or Mathematica.

Related Topics

Graph Theory

Browse all topics

RELATED RESOURCES

Mathematica » The #1 tool for creating Demonstrations and anything technical.	Wolfram\|Alpha » Explore anything with the first computational knowledge engine.	MathWorld » The web's most extensive mathematics resource.	Course Assistant Apps » An app for every course— right in the palm of your hand.
Wolfram Blog » Read our views on math, science, and technology.	Computable Document Format » The format that makes Demonstrations (and any information) easy to share and interact with.	STEM Initiative » Programs & resources for educators, schools & students.	Computerbasedmath.org » Join the initiative for modernizing math education.

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

THINGS TO TRY

SNAPSHOTS

RELATED LINKS

PERMANENT CITATION

Related Topics