DSA · Theory

Prim's Algorithm

Theory

41/810

Prim's Algorithm

Prim's Algorithm is a DSA topic. In plain words you use it for a short Prim's Algorithm example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Prim's Algorithm example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Prim's Algorithm.

From the example next to this theory: Prim's Algorithm — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Trap — only saying “Prim's Algorithm” with no example. Fix that before you talk about advanced DSA.

Viva — what is Prim's Algorithm? Then show the smallest Prim's Algorithm example you can type. Then name the trap.

Exam tip

What is Prim's Algorithm? Show this: the smallest Prim's Algorithm example you can type. Trap: only saying “Prim's Algorithm” with no example.

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 — a short Prim's Algorithm example in a short dry-run on paper.
Rulethe smallest Prim's Algorithm example you can type
Traponly saying “Prim's Algorithm” with no example
Usea short dry-run on paper

DSA · Theory

Prim's Algorithm

← All stacks

Theory

41/810

Prim's Algorithm

Prim's Algorithm is a DSA topic. In plain words you use it for a short Prim's Algorithm example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Prim's Algorithm example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Prim's Algorithm.

From the example next to this theory: Prim's Algorithm — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Trap — only saying “Prim's Algorithm” with no example. Fix that before you talk about advanced DSA.

Viva — what is Prim's Algorithm? Then show the smallest Prim's Algorithm example you can type. Then name the trap.

Exam tip

What is Prim's Algorithm? Show this: the smallest Prim's Algorithm example you can type. Trap: only saying “Prim's Algorithm” with no example.

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 — a short Prim's Algorithm example in a short dry-run on paper.
Rulethe smallest Prim's Algorithm example you can type
Traponly saying “Prim's Algorithm” with no example
Usea short dry-run on paper

Prim's Algorithm

Example

Short notes

Questions

Prim's Algorithm

Example

Short notes

Questions