Boost logo

Boost Users :

Subject: [Boost-users] [BGL] Separating twin vertices
From: Shaun Jackman (sjackman_at_[hidden])
Date: 2010-08-12 14:32:25


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!


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