template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter>
class Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::VertexBaseIterator< Derived, Value, Node, BaseIter >
Base class for vertex iterators.
Definition at line 853 of file Graph.h.
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived , class Value , class Node , class BaseIter >
Increment.
Causes this iterator to advance to the next node of the vertex list. This method should not be invoked on an iterator that points to the end of the list.
Definition at line 880 of file Graph.h.
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived , class Value , class Node , class BaseIter >
Increment.
Causes this iterator to advance to the next node of the vertex list. This method should not be invoked on an iterator that points to the end of the list.
Definition at line 881 of file Graph.h.
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived , class Value , class Node , class BaseIter >
Decrement.
Causes this iterator to advance to the previous node of the vertex list. This method should not be invoked on an iterator that points to the beginning of the list.
Definition at line 890 of file Graph.h.
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived , class Value , class Node , class BaseIter >
Decrement.
Causes this iterator to advance to the previous node of the vertex list. This method should not be invoked on an iterator that points to the beginning of the list.
Definition at line 891 of file Graph.h.
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived , class Value , class Node , class BaseIter >
template<class OtherIter >
Equality predicate.
Two iterators are equal if they point to the same node of the vertex list, and unequal otherwise.
Definition at line 899 of file Graph.h.
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived , class Value , class Node , class BaseIter >
template<class OtherIter >
Equality predicate.
Two iterators are equal if they point to the same node of the vertex list, and unequal otherwise.
Definition at line 900 of file Graph.h.