A Pathfinding algorithm for Weighted Directed Graph
Procedure
Intuition
- We have a starting node at
- We set a table of distances for all nodes, and initialize to distance for each
- For times, we run iterate through all nodes in the list
- If the current node has a distance of skip it
- If current node is , or distance is not infinity, update distances of all outgoing edges