|
Boost Users : |
From: Sohail Somani (s.somani_at_[hidden])
Date: 2006-09-27 14:37:06
> -----Original Message-----
> From: boost-users-bounces_at_[hidden]
> [mailto:boost-users-bounces_at_[hidden]] On Behalf Of
> Michele Russo
> Sent: Wednesday, September 27, 2006 12:52 AM
> To: boost-users_at_[hidden]
> Subject: [Boost-users] [Graph] find cycles
>
> Hi all,
>
> Please, couold you suggest me a simple way to find a cycle
> into a graph (just a sentence, no code)? What about the
> computational complexity?
In a sentence: DFS.
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net