#include <MemoryIterator.h>
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::auto_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::auto_ptr< te::da::DataSet > | m_vertexQuery |
Attribute used to keep the vertex iterator. More... | |
Definition at line 60 of file MemoryIterator.h.
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, and m_vertexMapIt.
|
virtual |
Virtual destructor.
Definition at line 52 of file MemoryIterator.cpp.
|
virtual |
It returns the number of elements of this iterator.
Reimplemented from te::graph::AbstractIterator.
Definition at line 119 of file MemoryIterator.cpp.
Referenced by te::sa::MinimumSpanningTree::kruskal().
|
virtual |
It returns a pointer to the first edge element of a graph.
Implements te::graph::AbstractIterator.
Definition at line 90 of file MemoryIterator.cpp.
Referenced by te::sa::SkaterOperation::createWeightAttribute(), te::graph::LayerRenderer::drawMemoryGraph(), and te::sa::MinimumSpanningTree::kruskal().
|
virtual |
It returns a pointer to the first vertex element of a graph.
Implements te::graph::AbstractIterator.
Definition at line 56 of file MemoryIterator.cpp.
Referenced by te::sa::GPMWeightsNoWeightsStrategy::calculate(), te::sa::GPMWeightsSquaredInverseDistanceStrategy::calculate(), and te::sa::GPMWeightsInverseDistanceStrategy::calculate().
|
virtual |
It returns a pointer to the next edge element of a graph.
Reimplemented from te::graph::AbstractIterator.
Definition at line 97 of file MemoryIterator.cpp.
Referenced by te::sa::SkaterOperation::createWeightAttribute(), te::graph::LayerRenderer::drawMemoryGraph(), and te::sa::MinimumSpanningTree::kruskal().
|
virtual |
It returns a pointer to the next vertex element of a graph.
Reimplemented from te::graph::AbstractIterator.
Definition at line 63 of file MemoryIterator.cpp.
Referenced by te::sa::GPMWeightsNoWeightsStrategy::calculate(), te::sa::GPMWeightsSquaredInverseDistanceStrategy::calculate(), and te::sa::GPMWeightsInverseDistanceStrategy::calculate().
|
virtual |
It returns a pointer to the previous edge element of a graph.
Reimplemented from te::graph::AbstractIterator.
Definition at line 107 of file MemoryIterator.cpp.
|
virtual |
It returns a pointer to the previous vertex element of a graph.
Reimplemented from te::graph::AbstractIterator.
Definition at line 73 of file MemoryIterator.cpp.
|
virtual |
It returns the number of elements of this iterator.
Reimplemented from te::graph::AbstractIterator.
Definition at line 85 of file MemoryIterator.cpp.
Referenced by te::sa::MinimumSpanningTree::kruskal().
|
virtual |
Used to check the iterator position.
Reimplemented from te::graph::AbstractIterator.
Definition at line 114 of file MemoryIterator.cpp.
Referenced by te::graph::LayerRenderer::drawMemoryGraph().
|
virtual |
Used to check the iterator position.
Reimplemented from te::graph::AbstractIterator.
Definition at line 80 of file MemoryIterator.cpp.
|
inherited |
Used to set that the isolated vertex must be listed.
flag | Flag used to set. |
Definition at line 109 of file AbstractIterator.cpp.
|
protected |
This map contains all edges from this graph.
Definition at line 158 of file MemoryIterator.h.
Referenced by MemoryIterator().
|
protected |
Iterator for all edges from this graph.
Definition at line 161 of file MemoryIterator.h.
Referenced by MemoryIterator().
|
protectedinherited |
Attribute used to keep the edge iterator.
Definition at line 168 of file AbstractIterator.h.
|
protectedinherited |
Pointer to a abstract graph used to access the elements.
Definition at line 165 of file AbstractIterator.h.
|
protectedinherited |
Flag used to indicated that the isolated vertex will be listed.
Definition at line 170 of file AbstractIterator.h.
|
protected |
This map contains all vertexs from this graph.
Definition at line 157 of file MemoryIterator.h.
Referenced by MemoryIterator().
|
protected |
Iterator for all vertexs from this graph.
Definition at line 160 of file MemoryIterator.h.
Referenced by MemoryIterator().
|
protectedinherited |
Attribute used to keep the vertex iterator.
Definition at line 167 of file AbstractIterator.h.