Description
template<class VertexOrEdgeKey, class VertexOrEdgeConstIterator>
struct Sawyer::Container::GraphIndexTraits< VertexOrEdgeKey, VertexOrEdgeConstIterator >
struct Sawyer::Container::GraphIndexTraits< VertexOrEdgeKey, VertexOrEdgeConstIterator >
Traits for vertex and edge indexing.
By partly specializing this class template a user can define the type of index used for a particular vertex or edge key type. Sawyer already defines specializations for graphs that have no vertex or edge keys. The SAWYER_GRAPH_INDEXING_SCHEME_1 and SAWYER_GRAPH_INDEXING_SHCEME_2 macros can be used at the global scope to add partial specializations for users that aren't keen to use C++ templates. They both take two arguments: the key type and the index type. They differ only in whether the index type template takes one argument (a vertex or edge iterator type) or two (the key type and an iterator type).
#include <Sawyer/Graph.h>
Inheritance diagram for Sawyer::Container::GraphIndexTraits< VertexOrEdgeKey, VertexOrEdgeConstIterator >:
Public Types | |
| typedef GraphBimapIndex< VertexOrEdgeKey, VertexOrEdgeConstIterator > | Index |
| Type of index to use for the specified key type. | |
Member Typedef Documentation
◆ Index
template<class VertexOrEdgeKey , class VertexOrEdgeConstIterator >
| typedef GraphBimapIndex<VertexOrEdgeKey, VertexOrEdgeConstIterator> Sawyer::Container::GraphIndexTraits< VertexOrEdgeKey, VertexOrEdgeConstIterator >::Index |
The documentation for this struct was generated from the following file:
