Subject: Re: [boost] [BGL] Testing a graph for bipartiteness
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2010-02-18 08:35:57
Yes, a version only with a graph (maybe +index-map) is needed and
> I also didn't make any effort in using named parameters, yet. For this I
> especially want to get feedback whether my approach for returning
> the odd-cycle via one iterator is a good one. My headache with it
> is that the user won't get the resulting iterator like in std::copy,
> the return-value is used for bipartiteness-predicate.
Having a version that takes only a graph is a good thing. I tend to avoid
named params also, so you shouldn't feel that building such an
implementation is necessary.
Maybe the version taking the out_iterator should be a different function?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk