boostorg / boostorg/graph

request: toposort into levels

未关闭
#240 2 条评论 3 个 reaction 已指派 0 人 在 GitHub 查看
algorithm
主要语言
C++
星标
392
派生
239
平均合并
1 天 11 分钟
30 天内合并 PR
20

描述

I don't think it's currently possible to get each "level" from`topological_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.

贡献指南

打开贡献指南

评估

这个 Issue 还没有评估数据。

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。