Enlosing in what sense? Ary you thinking spatially? Perhaps you want an algorithm from computational geometry, like convex hull. Cheers, Jeremy On Wed, 13 Aug 2003, Stefan Slapeta wrote: yg-boo> Hi all, yg-boo> yg-boo> finding edges of cycles in a directed graph is a solved problem and done by yg-boo> the strong_components algorithm. yg-boo> yg-boo> Is there also any a good solution for finding the path (= the exact sequence yg-boo> of vertices) that encloses a strong component? (Note that in a strong yg-boo> component there can be also smaller subcycles that are not of interest.) yg-boo> With other words: I want to find the way through a strong component that yg-boo> visits all its edges. yg-boo> yg-boo> Thanks in advance! yg-boo> yg-boo> Stefan ---------------------------------------------------------------------- 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 ----------------------------------------------------------------------