Sorry, I do not know of such an algorithm. On Tue, 11 Nov 2003, adel essafi wrote: adel.e> this is my graph adel.e> 0 adel.e> / \ adel.e> 3 <---- 2 adel.e> \ adel.e> 1 adel.e> | adel.e> 4 adel.e> what is the algorithme that allow me to visit vertices 0 -> 2 -> 3 -> 1 -> adel.e> 4. A virtice is not visited if all vis patent are visited. adel.e> I forgot his name. adel.e> Cheers. ---------------------------------------------------------------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ----------------------------------------------------------------------