From: Jonathan de Halleux <[EMAIL PROTECTED]> > I have a tree built with the BGL. I want to find the root of the tree. > > Has anybody an idea on the algorithm I should be using ? thks
Assuming your graph is bidirectional and has a single root, then you should just be able to pick any node, pick any parent thereof, repeat until you deadend. that is the root. ? Joel _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
