Skip to content

CSCI2100 · Theorem · Chapter 14 · Graph algorithms

Kruskal's forest has minimum cost

4 steps of prerequisites below it

For every finite weighted multigraph, including negative weights, parallel edges, loops and several components, Kruskal’s algorithm returns a minimum spanning forest.

Taught in

Uses

The same idea in other courses

Used by

No later knowledge point in these notes uses it.

Counterexamples

Everything this builds on, earliest first · 6 steps

Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.

  1. Spanning forest · 14.1
  2. Minimum spanning forest · 14.1
  3. Partition · 1.1
  4. Disjoint-set operations · 1.1
  5. Kruskal's algorithm · 14.1
  6. Kruskal selects a spanning forest · 14.1

Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.

Longest chain down to a starting point

Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.

  1. Kruskal selects a spanning forest
  2. Kruskal's algorithm
  3. Disjoint-set operations
  4. Partition

Back to the graph →Read the note 14.1 →

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details