Re: [boost] [Boost-users] [BGL] Stoer–Wagner min-cut algorithm

Hi Jeremiah, I react on this point only:

- Property maps are passed by copy; they are intended to be lightweight and using copies allows temporary property maps to be passed in.

I don't understand this. If I have a graph of one million vertices and even more edges, the property map (e.g. defining something for each vertex) is certainly not lightweight. Or do you mean other property maps? -- ------------------------------------- Barend Gehrels, Geodan Holding b.v., Amsterdam, The Netherlands, www.geodan.nl