---

gtc::_base_graph< K, W, T >::iterator Class Template Reference

Provides for iteration among nodes in a graph. More...

#include <graph.h>

List of all members.

Public Methods
iterator &	operator++ ()
iterator	operator++ (int)
iterator &	operator-- ()
iterator	operator-- (int)
std::pair< const K, T > &	operator * ()
std::pair< const K, T > *	operator-> ()
bool	operator== (const iterator &i)
bool	operator!= (const iterator &i)
Friends
class	_base_graph< K, W, T >

---

Detailed Description

template<typename K, typename W, typename T>
class gtc::_base_graph< K, W, T >::iterator

Provides for iteration among nodes in a graph.

Serves as an interator among nodes in a graph. This iterator works much in the same was as an STL map iterator. The iterator points to a pair object, whose members are as follows:

• first, a const reference to the key value
• second, a reference to the data value

This iterator is bi-directional, and as such the pre- and post-increment and decrement operators are supported.

---

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

• graph.h

---