template<class VertexOrEdgeKey, class VertexOrEdgeConstIterator>
class Sawyer::Container::GraphHashIndex< VertexOrEdgeKey, VertexOrEdgeConstIterator >
Hash-based indexing.
This index has O(N) insert, erase, and lookup times, although nominally the times are constant because the index uses hashing. The vertex or edge keys must have a hash function appropriate for boost::unordered_map
and an equality operator.
The semantics for each of the class methods are documented in GraphVoidIndex.
Definition at line 193 of file Graph.h.