
12 Aug
2010
12 Aug
'10
6:32 p.m.
Hi, I have a directed graph where every vertex has a twin vertex. It is known ahead of time which pairs of vertices are twins. I want to remove as few vertices as possible from the graph such that no vertex and its twin is in the same connected component. Could someone suggest an appropriate algorithm? I've just started delving into the BGL. So far I'm suitably impressed! Cheers, Shaun