This lab will allow you to test your knowledge of what you saw earlier in Dijkstra's Shortest Path Algorithm with practical examples. The default graph asks you to find the cheapest path from node A to node F. Generate weighted node networks, create your own nodes and edges, and then step through Dijkstra's algorithm as it gradually discovers the cheapest path.
https://www.kirupa.com/data_structures_algorithms/dijkstra_lab.htm