DSA · Theory

Kruskal's Algorithm

Theory

42/810

Kruskal's Algorithm

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

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

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

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

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

Exam tip

What is Kruskal's Algorithm? Show this: the smallest Kruskal's Algorithm example you can type. Trap: only saying “Kruskal'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)

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

Short notes

DefKruskal's Algorithm — a short Kruskal's Algorithm example in a short dry-run on paper.
Rulethe smallest Kruskal's Algorithm example you can type
Traponly saying “Kruskal's Algorithm” with no example
Usea short dry-run on paper

DSA · Theory

Kruskal's Algorithm

← All stacks

Theory

42/810

Kruskal's Algorithm

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

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

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

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

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

Exam tip

What is Kruskal's Algorithm? Show this: the smallest Kruskal's Algorithm example you can type. Trap: only saying “Kruskal'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)

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

Short notes

DefKruskal's Algorithm — a short Kruskal's Algorithm example in a short dry-run on paper.
Rulethe smallest Kruskal's Algorithm example you can type
Traponly saying “Kruskal's Algorithm” with no example
Usea short dry-run on paper

Kruskal's Algorithm

Example

Short notes

Questions

Kruskal's Algorithm

Example

Short notes

Questions