Hi, I have a question on the copy constructor for boost graphs. When I make a copy G of a graph D as follows: Graph G(D); It makes a deep copy of D, correct? If so, is there a way to maintain a map from vertices in G to vertices in D, and vice versa? Or is this something I have to do manually with std::map? It seems that the copy constructor (as above) is quite time-consuming.. Thanks for any help in advance! -- Ethan DH Kim