latest version v1.9 - last update 24 Nov 2005

lti::adjacencyGraph< N, W, D, F, E >::const_iterator Class Reference

The graph const_iterator iterates on all nodes in a read-only fashion. More...

#include <ltiAdjacencyGraph.h>

List of all members.

Public Member Functions
	const_iterator ()
	const_iterator (const const_iterator &other)
	const_iterator (const iterator &other)
const_iterator &	operator++ ()
const_iterator	operator++ (int)
const_iterator &	operator-- ()
const_iterator	operator-- (int)
bool	operator== (const const_iterator &other) const
bool	operator== (const iterator &other) const
bool	operator!= (const const_iterator &other) const
bool	operator!= (const iterator &other) const
const node_type &	operator * () const
id_type	id () const
const_iterator &	operator= (const iterator &other)
const_iterator &	operator= (const const_iterator &other)
Protected Member Functions
	const_iterator (const int startPos, const nodes_type *vct)

---

Detailed Description

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>>
class lti::adjacencyGraph< N, W, D, F, E >::const_iterator

The graph const_iterator iterates on all nodes in a read-only fashion.

This class is similar to the usual iterators of the STL. The const_iterator also allows you to access the id of the nodes. See the class iterator for more information.

---

Constructor & Destructor Documentation

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> lti::adjacencyGraph< N, W, D, F, E >::const_iterator::const_iterator (   )  [inline]

Default constructor.

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> lti::adjacencyGraph< N, W, D, F, E >::const_iterator::const_iterator (  const const_iterator &  other  )  [inline]

copy constructor

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> lti::adjacencyGraph< N, W, D, F, E >::const_iterator::const_iterator (  const iterator &  other  )  [inline]

copy constructor

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> lti::adjacencyGraph< N, W, D, F, E >::const_iterator::const_iterator (  const int  startPos, const nodes_type *  vct )  [inline, explicit, protected]

protected constructor (for internal use only)

---

Member Function Documentation

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> id_type lti::adjacencyGraph< N, W, D, F, E >::const_iterator::id (   )  const [inline]

get pointed node's id. Please note that the id can become invalid if the pointed node is removed.

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> const node_type& lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator * (   )  const [inline]

get pointed data

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> bool lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator!= (  const iterator &  other  )  const [inline]

compare if both pointed positions are different

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> bool lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator!= (  const const_iterator &  other  )  const [inline]

compare if both pointed positions are different

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> const_iterator lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator++ (  int   )  [inline]

advance to next item

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> const_iterator& lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator++ (   )  [inline]

advance to next item

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> const_iterator lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator-- (  int   )  [inline]

recede to previous item

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> const_iterator& lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator-- (   )  [inline]

recede to previous item // prefix

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> const_iterator& lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator= (  const const_iterator &  other  )  [inline]

copy member

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> const_iterator& lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator= (  const iterator &  other  )  [inline]

copy member

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> bool lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator== (  const iterator &  other  )  const [inline]

compare if both pointed positions are the same

template<class N, class W = float, class D = int, class F = adjacencyGraphVoidWeightFunction<N,W,D>, class E = symmetricEdgeTraits<W>> bool lti::adjacencyGraph< N, W, D, F, E >::const_iterator::operator== (  const const_iterator &  other  )  const [inline]

compare if both pointed positions are the same

---

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

• ltiAdjacencyGraph.h

---