Le Sam 24 janvier 2009 10:51, Thomas Klimpel a écrit :

Are you sure? The original poster seems to have a "rooted tree" in mind,

which is a special "directed acyclic graph" (DAG). I just looked at the TOC of the boost::graph documentation, and the only DAG algorithm I could find was "topological_sort". There is also the transitive_closure algorithm, which could be used to compute the "partial order" relation of the DAG, but I'm not sure whether this is really the appropriate way to compute the "partial order" relation of a DAG (because the number of edges could increase to O(V^2) and DAG's are not mentioned in the

corresponding documentation). Indeed, I wasn't thinking of the related algorithm. So yeah, boost::tree seems to lack then