Boost Users :
From: Wolfram Koska (koskaw_at_[hidden])
Date: 2005-08-09 15:18:13
>> Well, the big question for me is could I use
>> this as my hash, too?
> Well, yes, you could. However, by using the source and target for your
> hash function you can be sure that it will work for *all* BGL graphs,
> whereas accessing "m_property" in the edge descriptor will only work
> for some graphs.
Thank you very much for your help, Doug! I have only one last question: for
which graphs will this not work? It seems to work for me, and I will most
probably not change the graph I am using (a directed adjacency_list). Will
it not work for graphs with edges without properties? I can't quite believe
this... maybe it will not work for adjacency_matrix ?
Again, thanks very much! Regards,
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net