Home / cs-notes / Algorithm / Problems / Shortest Path / Dijkstra / Thought

• Find the cloest reachable point
  • update the distances of its reachable points

---

• if edge weights are all 1
  • Dijkstra is equivalent to BFS
• else
  • BFS does not work

---