Dijkstra's Algorithm Learning Tool


Dijkstra's algorithm is one of the most significant algorithms in graph theory and this learning tool aims to help you gain an understading of it's progression as well as test your knowledge.

The purpose of Dijkstra's algorithm is to determine the shortest paths between a given node and all the remaining nodes in a weighted undirected graph.

While the pseudo-code describing the algorithm is fairly simple, understanding the progression of the algorithm and the inner working of the associated data structure is not straightforward.

There are two parts to this learning tool

They can be accessed by clicking the links on the title bar. If you're unsure on what to do, press the HELP button that is available on the top-right corner on some of the pages.

Please be advised that this site is not fully supported by web browser versions earlier than Firefox 40.0.3, Chrome 45.0 and Safari 9.1.
For best results, please use the aforementioned browsers and ensure that the monitor is at least 15”.

4 8 3 12 7 5 9 A 0 B C D E F Sorry, your browser does not support inline SVG.
A key: 0 B key: ∞ C key: ∞ D key: ∞ E key: ∞ F key: ∞ Sorry, your browser does not support inline SVG.