DSA · Theory

What is a K-connected Graph

← All stacks

Theory

642/810

What is a K-connected Graph

a K-connected Graph (what is) is simple if you keep it on paper. Priya uses it for bus routes in a city map.

a K-connected Graph (what is) on the board: BFS queue / DFS stack. Then say what bus routes looks like after.

a K-connected Graph (what is) exists so Priya can keep bus routes correct in a city map.

a K-connected Graph (what is) shows up in a city map. Name bus routes, not “a real-world scenario”.

a K-connected Graph (what is) trap — no visited set → infinite loop. Priya loses marks for that every viva.

After a K-connected Graph (what is), Priya should still remember no visited set → infinite loop.

Viva for a K-connected Graph (what is): what it is → BFS queue / DFS stack → the mistake (no visited set → infinite loop).

Exam tip

For a K-connected Graph (what is): definition + a city map + 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)

What is a K-connected Graph — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Short notes

Defa K-connected Graph (what is) — Priya uses it for bus routes in a city map.
Rulea K-connected Graph (what is) → BFS queue / DFS stack.
Remembera K-connected Graph (what is) + time vs memory (a city map).
Usea K-connected Graph (what is) in a city map (bus routes).
Trapa K-connected Graph (what is) — no visited set → infinite loop.
Exa K-connected Graph (what is) → bus routes.

DSA · Theory

What is a K-connected Graph

← All stacks

Theory

642/810

What is a K-connected Graph

a K-connected Graph (what is) is simple if you keep it on paper. Priya uses it for bus routes in a city map.

a K-connected Graph (what is) on the board: BFS queue / DFS stack. Then say what bus routes looks like after.

a K-connected Graph (what is) exists so Priya can keep bus routes correct in a city map.

a K-connected Graph (what is) shows up in a city map. Name bus routes, not “a real-world scenario”.

a K-connected Graph (what is) trap — no visited set → infinite loop. Priya loses marks for that every viva.

After a K-connected Graph (what is), Priya should still remember no visited set → infinite loop.

Viva for a K-connected Graph (what is): what it is → BFS queue / DFS stack → the mistake (no visited set → infinite loop).

Exam tip

For a K-connected Graph (what is): definition + a city map + 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)

What is a K-connected Graph — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Short notes

Defa K-connected Graph (what is) — Priya uses it for bus routes in a city map.
Rulea K-connected Graph (what is) → BFS queue / DFS stack.
Remembera K-connected Graph (what is) + time vs memory (a city map).
Usea K-connected Graph (what is) in a city map (bus routes).
Trapa K-connected Graph (what is) — no visited set → infinite loop.
Exa K-connected Graph (what is) → bus routes.

What is a K-connected Graph

Example

Short notes

Questions

What is a K-connected Graph

Example

Short notes

Questions