Dijkstra's Shortest Path Algorithm

Java tool to find the shortest path between two vertices
Download

Dijkstra's Shortest Path Algorithm Ranking & Summary

Advertisement

  • Rating:
  • License:
  • Freeware
  • Publisher Name:
  • Petersen Consultants
  • Publisher web site:
  • http://www.mathcove.net/
  • Operating Systems:
  • Mac OS X
  • File Size:
  • 1 KB

Dijkstra's Shortest Path Algorithm Tags


Dijkstra's Shortest Path Algorithm Description

Dijkstra's Shortest Path Algorithm is an application that can be used to find the shortest path between two vertices.The user has to draw a graph in the left pane and use the "weight +" and "weight -" to increase or decrease the weight of an edge.When the "Start/End" button is clicked the next two vertices you click on will be the start and end of the path you want to find.


Dijkstra's Shortest Path Algorithm Related Software

About SoftwareSea