PYTHON PROBLEM 300 · Beginner

Traverse a graph with BFS: Disconnected graph

Visit only the component reachable from the chosen start.

graph · BFSgraphBFS

PROBLEM OVERVIEW

What this Python exercise asks you to practise

This scenario tests traverse a graph with bfs. It belongs to the Graphs and Connectivity roadmap and uses the graph · bfs pattern.

Graph representation, BFS, DFS, shortest paths, topological order, and union-find.

COMPLETE WORKSPACE

Learn the plan, trace the logic and run the solution

Complete access unlocks the full statement, input and output examples, visual execution plan, hints, browser compiler, solution and line-by-line interpretation.

Unlock all 360 problems · ₹599One full year · one payment · no automatic renewal

SKILL TO CARRY FORWARD

Pattern relevance

This exercise strengthens graph · bfs. Be ready to explain the input, the rule, the boundary cases, and why the chosen approach is appropriate.