Type:

Other

Description:

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.

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:262692,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/ShortestPathsAndTheMinimumSpanningTreeOnAGraphWithCartesianE/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467