DSA · Theory

Prim's Algorithm

Theory

41/810

Prim's Algorithm

Asha only reaches for Prim's Algorithm when Prim's Algorithm on Asha's board has to stay correct in a small live site.

Do Prim's Algorithm once by hand. one Prim's Algorithm step Asha can write from memory. Change one input. Say the new result out loud.

Skip Prim's Algorithm and skipping the failure case for Prim's Algorithm shows up in a small live site.

Asha ships Prim's Algorithm in a small live site. That is the use case worth saying.

Prim's Algorithm trap — skipping the failure case for Prim's Algorithm. Asha loses marks for that every viva.

After Prim's Algorithm, Asha should still remember skipping the failure case for Prim's Algorithm.

One breath for Prim's Algorithm, then Prim's Algorithm on Asha's board, then skipping the failure case for Prim's Algorithm. Sit down.

Exam tip

For Prim's Algorithm: definition + a small live site + one failure.

Example

# adjacency list
graph = {
    "A": [("B", 2), ("C", 5)],
    "B": [("A", 2), ("C", 1)],
    "C": [("A", 5), ("B", 1)],
}
for u, edges in graph.items():
    print(u, "->", edges)

Prim's Algorithm — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Short notes

DefPrim's Algorithm — Asha uses it for Prim's Algorithm on Asha's board in a small live site.
RulePrim's Algorithm → one Prim's Algorithm step Asha can write from memory.
RememberPrim's Algorithm + time vs memory (a small live site).
UsePrim's Algorithm in a small live site (Prim's Algorithm on Asha's board).
TrapPrim's Algorithm — skipping the failure case for Prim's Algorithm.
ExPrim's Algorithm → Prim's Algorithm on Asha's board.

DSA · Theory

Prim's Algorithm

← All stacks

Theory

41/810

Prim's Algorithm

Asha only reaches for Prim's Algorithm when Prim's Algorithm on Asha's board has to stay correct in a small live site.

Do Prim's Algorithm once by hand. one Prim's Algorithm step Asha can write from memory. Change one input. Say the new result out loud.

Skip Prim's Algorithm and skipping the failure case for Prim's Algorithm shows up in a small live site.

Asha ships Prim's Algorithm in a small live site. That is the use case worth saying.

Prim's Algorithm trap — skipping the failure case for Prim's Algorithm. Asha loses marks for that every viva.

After Prim's Algorithm, Asha should still remember skipping the failure case for Prim's Algorithm.

One breath for Prim's Algorithm, then Prim's Algorithm on Asha's board, then skipping the failure case for Prim's Algorithm. Sit down.

Exam tip

For Prim's Algorithm: definition + a small live site + one failure.

Example

# adjacency list
graph = {
    "A": [("B", 2), ("C", 5)],
    "B": [("A", 2), ("C", 1)],
    "C": [("A", 5), ("B", 1)],
}
for u, edges in graph.items():
    print(u, "->", edges)

Prim's Algorithm — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Short notes

DefPrim's Algorithm — Asha uses it for Prim's Algorithm on Asha's board in a small live site.
RulePrim's Algorithm → one Prim's Algorithm step Asha can write from memory.
RememberPrim's Algorithm + time vs memory (a small live site).
UsePrim's Algorithm in a small live site (Prim's Algorithm on Asha's board).
TrapPrim's Algorithm — skipping the failure case for Prim's Algorithm.
ExPrim's Algorithm → Prim's Algorithm on Asha's board.

Prim's Algorithm

Example

Short notes

Questions

Prim's Algorithm

Example

Short notes

Questions