From: Vladimir Prus (ghost_at_[hidden])
Date: 2003-02-11 05:24:40
> 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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk