Boost logo

Boost :

From: Jonathan de Halleux (dehalleux_at_[hidden])
Date: 2003-08-14 13:05:03

Thanks, stupid me ! I guess it has been too hot around here these days.

At 13:12 14/08/2003 -0400, you wrote:

>From: Jonathan de Halleux <dehalleux_at_[hidden]>
> > 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.
>Unsubscribe & other changes:

Jonathan de Halleux, Research Assistant
Center for Systems Engineering and Applied Mechanics (CESAME)
Universite catholique de Louvain
Batiment Euler , Av. Georges Lemaitre, 4 Tel : +32-10-47 2595
B-1348 Louvain-la-Neuve Belgium
E-mail : dehalleux_at_[hidden]

Boost list run by bdawes at, gregod at, cpdaniel at, john at