Hello vladimir, "Vladimir Prus" <[EMAIL PROTECTED]> wrote in message b2aipc$6us$[EMAIL PROTECTED]">news:b2aipc$6us$[EMAIL PROTECTED]... > Hi vladimir, > > DF visit and undirected-DFV implementations (depth_first_visit_impl > > and undir_dfv_impl) functions receive ColorMaps by value, consequently the > > main trunk of the algorithm loose the graph coloring that these functions > > have performed. > > Am I missing something here? > > I think so. Property maps usually have shallow copy semantics. Copies > reference the same data. >
The point is that I have my own internal properties for vertices and edges, and I had to construct new color maps to pass to the algorithms (providing get() and put()). Does this mean a that shallow copy is a requirement for the concept of property map? _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
