Dijkstra's algorithm

Find the shortest path on a graph with Dijkstra's algorithm. You can add nodes as you want and connect with their cost. You can create your graph as you want. After you create your graph with theirs cost to find shortest path you just need to choose start node and end node. After that you will see shortest path and cost with animation. With this application you can learn how Dijkstra's algorithm is working.