I'm new in boost library. I have created a disjoint set structure on a graph to have some partitions on it, what is the best way to obtain the multigraph of the set components?
Asked
Active
Viewed 42 times
0
-
no code whatsoever? There could be a zillion ways you have done what you describe. – sehe May 06 '14 at 08:05
-
yes, I know, I would one of them :) my teacher said to me that I could use filtered graph, but I have understood that a filtered graph is based on predicates that says if an Edge or a Vertex of the original graph has to be included in the filtered graph, so I can't create the multigraph that I want, right? – Cattani Simone May 06 '14 at 08:25