Path Finding Algorithm BFS Dijkstra

1
Path Finding Algorithm (BFS / Dijkstra)

• create a q priority queue
• enq the origin with cost of 0
• while (q is not empty)
• deq a path and cost (if takes to the dest,
  quit)
• for each edge
• Find node at end
• if node is not on current path
• enq a path including the node and
  total cost
• if node is dest, quit not for
  Dijkstra
• end
• end
• end