Dijkstra’s algorithm

Identify the differences between a graph and a tree.
Explain how the graph is an abstraction of the problem.
Identify the advantages of using a visualisation
Demonstrate how Dijkstra’s algorithm would find the shortest path to the solution
Jupyter notebook