This tool is to help you improve your understanding of the shortest path problems. This site will introduce you to 3 algorithms that are commonly used to solve the shortest path problem: Dijkstra, Bellman-Ford & Floyd-Warshall. You will be able to step through pseudo code for each algorithm and watch how the algorithms interacts with the graph and data.

After you have grasped the basic understanding of an algorithm you can test you knowledge by using the tutorials page. Currently, there is only support to test your knowledge for Dijkstra's algorithm, however, some more may be added in the future.