Skip to content

CSCI2100 · Method · Chapter 14 · Graph algorithms

Prim's algorithm

3 steps of prerequisites below it

Prim’s algorithm grows a connected vertex set S by repeatedly accepting a minimum-weight frontier edge with exactly one endpoint in S, discarding stale edges whose endpoints are both inside.

Taught in

Builds on

Used by

No later knowledge point in these notes uses it.

Everything this builds on, earliest first · 5 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. Min-priority queue · 3.1
  2. Binary min-heap · 3.1
  3. Spanning forest · 14.1
  4. Minimum spanning forest · 14.1
  5. Safe-edge lemma · 14.2

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. Safe-edge lemma
  2. Minimum spanning forest
  3. Spanning forest

Back to the graph →Read the note 14.2 →

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