boostorg / boostorg/graph

request: toposort into levels

Abierto
#240 2 comentarios 3 reacciones 0 asignados Ver en GitHub
algorithm
Lenguaje dominante
C++
Estrellas
392
Forks
239
Merge medio
1 d 11 min
PR fusionados (30 d)
20

Descripción

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.

Guía de contribución

Abrir la guía de contribución

Evaluación

Este issue todavía no se ha evaluado.

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.