Re: [Boost-users] hash function for edge_descriptor

From: Doug Gregor (dgregor_at_[hidden])
Date: 2005-08-09 16:25:44

On Aug 9, 2005, at 3:18 PM, Wolfram Koska wrote:

>>>  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 ?

The BGL algorithms can work on any graph that matches the BGL Concepts. 
So, for instance, this probably wouldn't work on a LEDA graph, 
edge_list_graph, or vector_as_graph.

        Doug