DSA · Theory

Check whether a given graph is Bipartite or not

Theory

762/810

Check whether a given graph is Bipartite or not

Check whether a given graph is Bipartite or not is a DSA topic. In plain words you use it for bus routes in a city map. Don’t start with a slogan — start with that picture.

Smallest example: BFS queue / DFS stack. Type it, run it, and say what you see. If you can do that from memory, you know Check whether a given graph is Bipartite or not.

From the example next to this theory: Check whether a given graph is Bipartite or not — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Trap — no visited set → infinite loop. Fix that before you talk about advanced DSA.

Viva — what is Check whether a given graph is Bipartite or not? Then show BFS queue / DFS stack. Then name the trap.

Exam tip

What is Check whether a given graph is Bipartite or not? Show this: BFS queue / DFS stack. Trap: no visited set → infinite loop.

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)

Check whether a given graph is Bipartite or not — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Short notes

DefCheck whether a given graph is Bipartite or not — bus routes in a city map.
RuleBFS queue / DFS stack
Trapno visited set → infinite loop
Usea city map

DSA · Theory

Check whether a given graph is Bipartite or not

← All stacks

Theory

762/810

Check whether a given graph is Bipartite or not

Check whether a given graph is Bipartite or not is a DSA topic. In plain words you use it for bus routes in a city map. Don’t start with a slogan — start with that picture.

Smallest example: BFS queue / DFS stack. Type it, run it, and say what you see. If you can do that from memory, you know Check whether a given graph is Bipartite or not.

From the example next to this theory: Check whether a given graph is Bipartite or not — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Trap — no visited set → infinite loop. Fix that before you talk about advanced DSA.

Viva — what is Check whether a given graph is Bipartite or not? Then show BFS queue / DFS stack. Then name the trap.

Exam tip

What is Check whether a given graph is Bipartite or not? Show this: BFS queue / DFS stack. Trap: no visited set → infinite loop.

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)

Check whether a given graph is Bipartite or not — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Short notes

DefCheck whether a given graph is Bipartite or not — bus routes in a city map.
RuleBFS queue / DFS stack
Trapno visited set → infinite loop
Usea city map

Check whether a given graph is Bipartite or not

Example

Short notes

Questions

Check whether a given graph is Bipartite or not

Example

Short notes

Questions