[Boost-users] bfs problem :right

From: adel essafi (adel.essafi_at_[hidden])
Date: 2003-11-11 09:26:00

this is my graph
         0
     /        \
   3  <---- 2
     \
      1
      |
      4
what is the algorithme that allow me to visit vertices 0 -> 2 -> 3 -> 1 ->
4. A virtice is not visited if all vis patent are visited.
I forgot his name.
Cheers.