Graphs: when anything can connect to anythingLesson 5 of 11

When roads cost minutes: Dijkstra's algorithm

BFS's 2-hop route takes 55 minutes; Dijkstra's 4-hop route takes 46. Why settled means final, and the heap cost.

Locked

Unlock the rest of Algorithms and Data Structures: what everything costs.

  • Every lesson, every resource, unlocked instantly.
  • Track progress and pick up where you left off.
  • Free preview lessons stay readable from the outline.

From

BDT 0

Enrol now