proland::Graph::GraphIterator< T > Class Template Reference

An abstract iterator to iterate over the elements of a Graph. More...

#include <Graph.h>

Inherits Object.

List of all members.

Public Member Functions

virtual bool hasNext ()=0
 Returns true if the iterator can still be incremented.
virtual T next ()=0
 Returns the next element from the list.
 GraphIterator ()
 Creates a new GraphIterator.

Detailed Description

template<typename T>
class proland::Graph::GraphIterator< T >

An abstract iterator to iterate over the elements of a Graph.

This template is specialized for nodes, curves and areas, and two implementations are provided (one for LazyGraph and one for BasicGraph).


Constructor & Destructor Documentation

template<typename T>
proland::Graph::GraphIterator< T >::GraphIterator (  )  [inline]

Creates a new GraphIterator.


Member Function Documentation

template<typename T>
virtual bool proland::Graph::GraphIterator< T >::hasNext (  )  [pure virtual]

Returns true if the iterator can still be incremented.

Implemented in proland::BasicGraph::BasicGraphIterator< T, U >, and proland::LazyGraph::LazyGraphIterator< T, U >.

template<typename T>
virtual T proland::Graph::GraphIterator< T >::next (  )  [pure virtual]

Returns the next element from the list.

Implemented in proland::BasicGraph::BasicGraphIterator< T, U >, and proland::LazyGraph::LazyGraphIterator< T, U >.


Generated on Sat May 12 09:42:47 2012 for proland by  doxygen 1.6.1