#include <MemoryIterator.h>

Inheritance diagram for te::graph::MemoryIterator:

Public Member Functions
	MemoryIterator (te::graph::AbstractGraph *g)
	Default constructor. More...

virtual	~MemoryIterator ()
	Virtual destructor. More...

Vertex Iterator Methods
Method used to access vertex elements from a graph.
virtual te::graph::Vertex *	getFirstVertex ()
	It returns a pointer to the first vertex element of a graph. More...

virtual te::graph::Vertex *	getNextVertex ()
	It returns a pointer to the next vertex element of a graph. More...

virtual te::graph::Vertex *	getPreviousVertex ()
	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...

virtual te::graph::Edge *	getFirstEdge ()
	It returns a pointer to the first edge element of a graph. More...

virtual te::graph::Edge *	getNextEdge ()
	It returns a pointer to the next edge element of a graph. More...

virtual te::graph::Edge *	getPreviousEdge ()
	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...

Vertex Iterator Methods
Method used to access vertex elements from a graph.
void	listIsolatedVertex (bool flag)
	Used to set that the isolated vertex must be listed. More...

Protected Attributes
std::map< int, Edge * >	m_edgeMap
	This map contains all edges from this graph. More...

std::map< int, Edge * >::iterator	m_edgeMapIt
	Iterator for all edges from this graph. More...

std::unique_ptr< te::da::DataSet >	m_edgeQuery
	Attribute used to keep the edge iterator. More...

te::graph::AbstractGraph *	m_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::map< int, Vertex * >	m_vertexMap
	This map contains all vertexs from this graph. More...

std::map< int, Vertex * >::iterator	m_vertexMapIt
	Iterator for all vertexs from this graph. More...

std::unique_ptr< te::da::DataSet >	m_vertexQuery
	Attribute used to keep the vertex iterator. More...

Detailed Description

Definition at line 60 of file MemoryIterator.h.

Constructor & Destructor Documentation

te::graph::MemoryIterator::MemoryIterator ( te::graph::AbstractGraph * g )

Default constructor.

Definition at line 37 of file MemoryIterator.cpp.

References te::graph::GraphData::getEdgeMap(), te::graph::GraphData::getVertexMap(), m_edgeMap, m_edgeMapIt, te::graph::Graph::m_graphData, m_vertexMap, m_vertexMapIt, and ~MemoryIterator().

te::graph::MemoryIterator::~MemoryIterator ( )

virtualdefault

Virtual destructor.

Referenced by MemoryIterator().

Member Function Documentation

size_t te::graph::MemoryIterator::getEdgeInteratorCount ( )

virtual

It returns the number of elements of this iterator.

Returns: Size t value.

Reimplemented from te::graph::AbstractIterator.

Definition at line 117 of file MemoryIterator.cpp.

References m_edgeMap.

Referenced by te::sa::MinimumSpanningTree::kruskal().

te::graph::Edge * te::graph::MemoryIterator::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.

Definition at line 88 of file MemoryIterator.cpp.

References m_edgeMap, and m_edgeMapIt.

Referenced by CreateWeightAttribute(), te::sa::SkaterOperation::createWeightAttribute(), te::graph::LayerRenderer::drawMemoryGraph(), and te::sa::MinimumSpanningTree::kruskal().

te::graph::Vertex * te::graph::MemoryIterator::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.

Definition at line 54 of file MemoryIterator.cpp.

References m_vertexMap, and m_vertexMapIt.

Referenced by te::sa::GPMWeightsNoWeightsStrategy::calculate(), te::sa::GPMWeightsSquaredInverseDistanceStrategy::calculate(), and te::sa::GPMWeightsInverseDistanceStrategy::calculate().

te::graph::Edge * te::graph::MemoryIterator::getNextEdge ( )

virtual

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 from te::graph::AbstractIterator.

Definition at line 95 of file MemoryIterator.cpp.

References m_edgeMap, and m_edgeMapIt.

Referenced by CreateWeightAttribute(), te::sa::SkaterOperation::createWeightAttribute(), te::graph::LayerRenderer::drawMemoryGraph(), and te::sa::MinimumSpanningTree::kruskal().

te::graph::Vertex * te::graph::MemoryIterator::getNextVertex ( )

virtual

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 from te::graph::AbstractIterator.

Definition at line 61 of file MemoryIterator.cpp.

References m_vertexMap, and m_vertexMapIt.

Referenced by te::sa::GPMWeightsNoWeightsStrategy::calculate(), te::sa::GPMWeightsSquaredInverseDistanceStrategy::calculate(), and te::sa::GPMWeightsInverseDistanceStrategy::calculate().

te::graph::Edge * te::graph::MemoryIterator::getPreviousEdge ( )

virtual

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 from te::graph::AbstractIterator.

Definition at line 105 of file MemoryIterator.cpp.

References m_edgeMapIt.

te::graph::Vertex * te::graph::MemoryIterator::getPreviousVertex ( )

virtual

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 from te::graph::AbstractIterator.

Definition at line 71 of file MemoryIterator.cpp.

References m_vertexMapIt.

size_t te::graph::MemoryIterator::getVertexInteratorCount ( )

virtual

It returns the number of elements of this iterator.

Returns: Size t value.

Reimplemented from te::graph::AbstractIterator.

Definition at line 83 of file MemoryIterator.cpp.

References m_vertexMap.

Referenced by te::sa::MinimumSpanningTree::kruskal().

bool te::graph::MemoryIterator::isEdgeIteratorAfterEnd ( )

virtual

Used to check the iterator position.

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

Reimplemented from te::graph::AbstractIterator.

Definition at line 112 of file MemoryIterator.cpp.

References m_edgeMap, and m_edgeMapIt.

Referenced by te::graph::LayerRenderer::drawMemoryGraph().

bool te::graph::MemoryIterator::isVertexIteratorAfterEnd ( )

virtual

Used to check the iterator position.

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

Reimplemented from te::graph::AbstractIterator.

Definition at line 78 of file MemoryIterator.cpp.

References m_vertexMap, and m_vertexMapIt.

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

inherited

Used to set that the isolated vertex must be listed.

Parameters

flag	Flag used to set.

Definition at line 106 of file AbstractIterator.cpp.

References te::graph::AbstractIterator::m_listIsolatedVertex.

Member Data Documentation

std::map<int, Edge*> te::graph::MemoryIterator::m_edgeMap

protected

This map contains all edges from this graph.

Definition at line 158 of file MemoryIterator.h.

Referenced by getEdgeInteratorCount(), getFirstEdge(), getNextEdge(), isEdgeIteratorAfterEnd(), and MemoryIterator().

std::map<int, Edge*>::iterator te::graph::MemoryIterator::m_edgeMapIt

protected

Iterator for all edges from this graph.

Definition at line 161 of file MemoryIterator.h.

Referenced by getFirstEdge(), getNextEdge(), getPreviousEdge(), isEdgeIteratorAfterEnd(), and MemoryIterator().

std::unique_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.

Referenced by te::graph::AbstractIterator::getEdgeInteratorCount(), te::graph::SequenceIterator::getFirstEdge(), te::graph::QueryIterator::getFirstEdge(), te::graph::BoxIterator::getFirstEdge(), te::graph::AbstractIterator::getNextEdge(), te::graph::AbstractIterator::getPreviousEdge(), and te::graph::AbstractIterator::isEdgeIteratorAfterEnd().

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.

Referenced by te::graph::SequenceIterator::getFirstEdge(), te::graph::QueryIterator::getFirstEdge(), te::graph::BoxIterator::getFirstEdge(), te::graph::SequenceIterator::getFirstVertex(), te::graph::QueryIterator::getFirstVertex(), te::graph::BoxIterator::getFirstVertex(), te::graph::AbstractIterator::getNextEdge(), te::graph::AbstractIterator::getNextVertex(), te::graph::AbstractIterator::getPreviousEdge(), and te::graph::AbstractIterator::getPreviousVertex().

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.

Referenced by te::graph::SequenceIterator::getFirstVertex(), and te::graph::AbstractIterator::listIsolatedVertex().

std::map<int, Vertex*> te::graph::MemoryIterator::m_vertexMap

protected

This map contains all vertexs from this graph.

Definition at line 157 of file MemoryIterator.h.

Referenced by getFirstVertex(), getNextVertex(), getVertexInteratorCount(), isVertexIteratorAfterEnd(), and MemoryIterator().

std::map<int, Vertex*>::iterator te::graph::MemoryIterator::m_vertexMapIt

protected

Iterator for all vertexs from this graph.

Definition at line 160 of file MemoryIterator.h.

Referenced by getFirstVertex(), getNextVertex(), getPreviousVertex(), isVertexIteratorAfterEnd(), and MemoryIterator().

std::unique_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.

Referenced by te::graph::SequenceIterator::getFirstVertex(), te::graph::QueryIterator::getFirstVertex(), te::graph::BoxIterator::getFirstVertex(), te::graph::AbstractIterator::getNextVertex(), te::graph::AbstractIterator::getPreviousEdge(), te::graph::AbstractIterator::getPreviousVertex(), te::graph::AbstractIterator::getVertexInteratorCount(), and te::graph::AbstractIterator::isVertexIteratorAfterEnd().

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

Public Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation