Graphs: when anything can connect to anythingLesson 7 of 11

Minimum spanning tree: fibre for every hub

Join seven hubs with the cheapest cable. Kruskal skips the link that makes a loop, Prim grows one tree, both total 30.

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