Subject: [boost] [BGL] Testing a graph for bipartiteness
From: Matthias Walter (xammy_at_[hidden])
Date: 2010-02-14 18:08:03
Hi,
I'm working on a project where I need to determine whether a given graph
is bipartite (possible yielding certificates for the two cases). As such
a test can be perfectly implemented via BFS and visitor patterns, I
wondered why there is no implementation in the BGL. Is there any reason
or am I just to blind to find it?
If I'm forced to write my own one, how about submitting it to BGL?
best regards
Matthias Walter