Boost logo

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.


View this message in context:
Sent from the Boost - Users mailing list archive at

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at