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

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.