Bug 29: Breadth-First Search Bogged Down
- This is breadth-first traversal of a directed graph with n nodes: 0, 1, ..., n-1.
- len(arcs) is n and each node i has an outgoing edge to each node listed in arcs[i].
- All nodes reachable from root are sent onto channel emit in breadth-first order.
Fix The Tiny Bug In This Go Code: