|
Boost Users : |
Subject: Re: [Boost-users] Identify cycles in a undirected graph
From: ddboy40 (ddboy40_at_[hidden])
Date: 2012-03-08 19:40:14
Hey, thanks for the rasch reply.
I need just all cycles of any length. At the moment I donot care if the code
is inefficient. I just need something really working.
My graph is undirected and unweighted.
Thanks.
Daniel
-- View this message in context: http://boost.2283326.n4.nabble.com/Identify-cycles-in-a-undirected-graph-tp4370333p4458176.html Sent from the Boost - Users mailing list archive at Nabble.com.
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