Dijkstra's Algorithm Example

Dijkstra's Algorithm finds the shortest path to all nodes from a given start node, producing a tree.