51#ifndef DOXYGEN_SHOULD_SKIP_THIS
58 template <
typename VAL >
60 return _edges_.hashMap(f, size);
63 template <
typename VAL >
65 return _edges_.hashMap(val, size);
68 template <
typename VAL >
EdgeProperty< VAL > edgesProperty(VAL(*f)(const Edge &), Size size=0) const
a method to create a hashMap of VAL from a set of edges (using for every edge, say x,...
EdgeSet _edges_
the set of all the edges contained within the EdgeGraphPart
List< VAL > listMapEdges(VAL(*f)(const Edge &)) const
a method to create a list of VAL from a set of edges (using for every edge, say x,...
The base class for all undirected edges.
Generic doubly linked lists.
std::size_t Size
In aGrUM, hashed values are unsigned long int.
HashTable< Edge, VAL > EdgeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities