Representing interconnected networks of objects (nodes) connected by relations (edges). Master BFS, DFS, and adjacency representations.
1function BFS(startNode):2 queue = [startNode]3 visited = {startNode}4 while queue:5 u = queue.dequeue()6 for v in neighbors(u):7 if v not in visited:8 visited.add(v)9 queue.enqueue(v)
Select a traversal to start.