[Boost-users] BGL, cut set

Hi, I'm looking into how you can quickly find the cut set of a graph without having to loop over the colormap as a vector. I'm using the http://www.boost.org/doc/libs/1_56_0/libs/graph/doc/edmonds_karp_max_flow.ht... (the example provided does mostly what I want, except that it uses a vector, and not a regular map). Boykov Kolmogorov also has the colormap parameter. It seems that associative_property_map could be used, but I don't really see how? Hints on how to do this will be appreciated. A lot of the examples of the Boost graph library use the preprocessor with a check similar to: #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 What's so special about this? Thank you, -- Med Venlig Hilsen / Kind regards, Mads Jensen