---

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

Provides for navigation among edges in a graph. More...

#include <graph.h>

List of all members.

Public Methods
edge_iterator &	operator++ ()
edge_iterator	operator++ (int)
edge_iterator &	operator-- ()
edge_iterator	operator-- (int)
edge &	operator * ()
edge *	operator-> ()
bool	operator== (const edge_iterator &i)
bool	operator!= (const edge_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 >::edge_iterator

Provides for navigation among edges in a graph.

The edge_iterator is provided for navigating among the edges that extend from a given node. Iteration of nodes is done in the order in which the edges were added to the graph. The edge_iterator behaves like a pointer to an edge object. The graph object has begin and end functions that take a key value as a parameter, and it is those functions that are to be used with the edge_iterator.

Pre- and post-increment and decrement operators are implemented for edge_iterator. Also, edge_iterators may be compared for equality and inequality. Two edge_iterator objects are considered equal if they refer to the same edge.

---

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

• graph.h

---