Boost Users :
From: Dmitry Bufistov (dmitry_at_[hidden])
Date: 2008-06-30 04:21:07
I don't know how to help (
Abde Ali Kagalwalla wrote:
> So, basically I want to find the number of cycles in an undirected
> graph. Now the vertices of the
> graph are colored red or green. As soon as I locate a cycle, I want to
> count the number of red and black vertices in the cycle.
> I want to find all possible cycles and the number of red and black
> vertices for each cycle.
> I was thinking of using BFS but it is ok if I can find the solution
> using DFS or some other method.
> Abde Ali
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