te::graph::SequenceIterator Class Reference

#include <SequenceIterator.h>

Inheritance diagram for te::graph::SequenceIterator:
te::graph::AbstractIterator

Public Member Functions

 SequenceIterator (te::graph::AbstractGraph *g)
 Default constructor. More...
 
virtual ~SequenceIterator ()
 Virtual destructor. More...
 
Vertex Access Methods

Method used to access vertex elements from a graph.

virtual te::graph::VertexgetFirstVertex ()
 It returns a pointer to the first vertex element of a graph. More...
 
virtual te::graph::EdgegetFirstEdge ()
 It returns a pointer to the first edge element of a graph. More...
 
Vertex Iterator Methods

Method used to access vertex elements from a graph.

virtual te::graph::VertexgetNextVertex ()
 It returns a pointer to the next vertex element of a graph. More...
 
virtual te::graph::VertexgetPreviousVertex ()
 It returns a pointer to the previous vertex element of a graph. More...
 
virtual bool isVertexIteratorAfterEnd ()
 Used to check the iterator position. More...
 
virtual size_t getVertexInteratorCount ()
 It returns the number of elements of this iterator. More...
 
void listIsolatedVertex (bool flag)
 Used to set that the isolated vertex must be listed. More...
 
virtual te::graph::EdgegetNextEdge ()
 It returns a pointer to the next edge element of a graph. More...
 
virtual te::graph::EdgegetPreviousEdge ()
 It returns a pointer to the previous edge element of a graph. More...
 
virtual bool isEdgeIteratorAfterEnd ()
 Used to check the iterator position. More...
 
virtual size_t getEdgeInteratorCount ()
 It returns the number of elements of this iterator. More...
 

Protected Attributes

std::auto_ptr< te::da::DataSetm_edgeQuery
 Attribute used to keep the edge iterator. More...
 
te::graph::AbstractGraphm_graph
 Pointer to a abstract graph used to access the elements. More...
 
bool m_listIsolatedVertex
 Flag used to indicated that the isolated vertex will be listed. More...
 
std::auto_ptr< te::da::DataSetm_vertexQuery
 Attribute used to keep the vertex iterator. More...
 

Detailed Description

Definition at line 65 of file SequenceIterator.h.

Constructor & Destructor Documentation

te::graph::SequenceIterator::SequenceIterator ( te::graph::AbstractGraph g)

Default constructor.

virtual te::graph::SequenceIterator::~SequenceIterator ( )
virtual

Virtual destructor.

Member Function Documentation

virtual size_t te::graph::AbstractIterator::getEdgeInteratorCount ( )
virtualinherited

It returns the number of elements of this iterator.

Returns
Size t value.

Reimplemented in te::graph::MemoryIterator.

virtual te::graph::Edge* te::graph::SequenceIterator::getFirstEdge ( )
virtual

It returns a pointer to the first edge element of a graph.

Returns
A valid edge point if the element was found and a null pointer in other case.

Implements te::graph::AbstractIterator.

virtual te::graph::Vertex* te::graph::SequenceIterator::getFirstVertex ( )
virtual

It returns a pointer to the first vertex element of a graph.

Returns
A valid vertex point if the element was found and a null pointer in other case.

Implements te::graph::AbstractIterator.

virtual te::graph::Edge* te::graph::AbstractIterator::getNextEdge ( )
virtualinherited

It returns a pointer to the next edge element of a graph.

Returns
A valid edge point if the element was found and a null pointer in other case.

Reimplemented in te::graph::MemoryIterator.

virtual te::graph::Vertex* te::graph::AbstractIterator::getNextVertex ( )
virtualinherited

It returns a pointer to the next vertex element of a graph.

Returns
A valid vertex point if the element was found and a null pointer in other case.

Reimplemented in te::graph::MemoryIterator.

virtual te::graph::Edge* te::graph::AbstractIterator::getPreviousEdge ( )
virtualinherited

It returns a pointer to the previous edge element of a graph.

Returns
A valid edge point if the element was found and a null pointer in other case.

Reimplemented in te::graph::MemoryIterator.

virtual te::graph::Vertex* te::graph::AbstractIterator::getPreviousVertex ( )
virtualinherited

It returns a pointer to the previous vertex element of a graph.

Returns
A valid vertex point if the element was found and a null pointer in other case.

Reimplemented in te::graph::MemoryIterator.

virtual size_t te::graph::AbstractIterator::getVertexInteratorCount ( )
virtualinherited

It returns the number of elements of this iterator.

Returns
Size t value.

Reimplemented in te::graph::MemoryIterator.

virtual bool te::graph::AbstractIterator::isEdgeIteratorAfterEnd ( )
virtualinherited

Used to check the iterator position.

Returns
True if the iterator is at after the end and false in other case

Reimplemented in te::graph::MemoryIterator.

virtual bool te::graph::AbstractIterator::isVertexIteratorAfterEnd ( )
virtualinherited

Used to check the iterator position.

Returns
True if the iterator is at after the end and false in other case

Reimplemented in te::graph::MemoryIterator.

void te::graph::AbstractIterator::listIsolatedVertex ( bool  flag)
inherited

Used to set that the isolated vertex must be listed.

Parameters
flagFlag used to set.

Member Data Documentation

std::auto_ptr<te::da::DataSet> te::graph::AbstractIterator::m_edgeQuery
protectedinherited

Attribute used to keep the edge iterator.

Definition at line 168 of file AbstractIterator.h.

te::graph::AbstractGraph* te::graph::AbstractIterator::m_graph
protectedinherited

Pointer to a abstract graph used to access the elements.

Definition at line 165 of file AbstractIterator.h.

bool te::graph::AbstractIterator::m_listIsolatedVertex
protectedinherited

Flag used to indicated that the isolated vertex will be listed.

Definition at line 170 of file AbstractIterator.h.

std::auto_ptr<te::da::DataSet> te::graph::AbstractIterator::m_vertexQuery
protectedinherited

Attribute used to keep the vertex iterator.

Definition at line 167 of file AbstractIterator.h.


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