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.
User Reviews for Dijkstra's Shortest Path Algorithm FOR MAC 1
-
for Dijkstra's Shortest Path Algorithm FOR MAC
Dijkstra's Shortest Path Algorithm FOR MAC is user-friendly and efficient in finding shortest paths. Great for visualizing graph algorithms.