18 Feb
2010
18 Feb
'10
1:35 p.m.
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, because 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? Andrew Sutton andrew.n.sutton@gmail.com