Boost logo

Boost :

From: vladimir josef sykora (vladimir.sykora_at_[hidden])
Date: 2003-02-11 05:18:19

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?
Also, in BFS and DFS algorithms, why not receive visitors by reference?
Anyone has implemented Ullman's algorithm for subgraph isomorphism with
BGL's interface? Any experience with maximal common subgraph and/or maximal
overlap set?

vladimir josef sykora
morphochem AG
gmunder str. 37-37a
81379 muenchen
tel. ++49-89-78005-0
fax  ++49-89-78005-555

Boost list run by bdawes at, gregod at, cpdaniel at, john at