graph
graph copied to clipboard
request: toposort into levels
I don't think it's currently possible to get each "level" fromtopological_sort (where a level contains the set of vertices with no unfinished dependencies e.g. if a depends on b, b depends on z, and c depends on z, then the levels are [z], [b, c], [a]).
I think this would be a helpful feature. I'd be happy to write a PR if others are interested.