Thea
List of all members
IsAdjacencyGraph< T > Class Template Reference

Checks if a class is a graph that, in addition to satisfying IsGraph, allows iterating over the neighbors of a vertex. More...

#include <GraphType.hpp>

Detailed Description

template<typename T>
class Thea::IsAdjacencyGraph< T >

Checks if a class is a graph that, in addition to satisfying IsGraph, allows iterating over the neighbors of a vertex.

The class T must define the following types:

NeighborIterator // Iterator over neighbors of a vertex.
NeighborConstIterator // Const iterator over neighbors of a vertex.

and implement the following functions:

intx numNeighbors(VertexConstHandle vertex) const;
Neighbor[Const]Iterator neighborsBegin(Vertex[Const]Handle vertex) [const];
Neighbor[Const]Iterator neighborsEnd(Vertex[Const]Handle vertex) [const];
Vertex[Const]Handle getVertex(Neighbor[Const]Iterator) [const];
[numerical-type] distance(VertexConstHandle, NeighborConstIterator) const;

Definition at line 88 of file GraphType.hpp.


The documentation for this class was generated from the following file: