I'm looking to do a breadth first search over a di...
# announcements
g
I'm looking to do a breadth first search over a directed acyclic graph, appending the result to a
Sequence
, where no node appears before its parent in the resulting list. Anyone care to do a better implementation?