27 #include "../../common/Translator.h"
28 #include "../../common/StringUtils.h"
29 #include "../core/AbstractGraph.h"
30 #include "../core/GraphData.h"
31 #include "../graphs/Graph.h"
32 #include "../Config.h"
33 #include "../Exception.h"
34 #include "../Globals.h"
58 m_vertexMapIt = m_vertexMap.begin();
60 return m_vertexMapIt->second;
67 if(m_vertexMapIt != m_vertexMap.end())
68 return m_vertexMapIt->second;
77 return m_vertexMapIt->second;
82 return m_vertexMapIt == m_vertexMap.end();
87 return m_vertexMap.size();
92 m_edgeMapIt = m_edgeMap.begin();
94 return m_edgeMapIt->second;
101 if(m_edgeMapIt != m_edgeMap.end())
102 return m_edgeMapIt->second;
111 return m_edgeMapIt->second;
116 return m_edgeMapIt == m_edgeMap.end();
121 return m_edgeMap.size();
virtual te::graph::Edge * getNextEdge()
It returns a pointer to the next edge element of a graph.
virtual te::graph::Vertex * getFirstVertex()
It returns a pointer to the first vertex element of a graph.
virtual te::graph::Vertex * getNextVertex()
It returns a pointer to the next vertex element of a graph.
VertexMap & getVertexMap()
It returns the the vertex map.
virtual ~MemoryIterator()
Virtual destructor.
std::map< int, Edge * >::iterator m_edgeMapIt
Iterator for all edges from this graph.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
MemoryIterator(te::graph::AbstractGraph *g)
Default constructor.
Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and...
virtual te::graph::Edge * getPreviousEdge()
It returns a pointer to the previous edge element of a graph.
std::map< int, Vertex * > m_vertexMap
This map contains all vertexs from this graph.
Abstract class used to define the main functions of graph struct. All graph implementations must used...
virtual bool isEdgeIteratorAfterEnd()
Used to check the iterator position.
EdgeMap & getEdgeMap()
It returns the the edge map.
virtual bool isVertexIteratorAfterEnd()
Used to check the iterator position.
virtual te::graph::Edge * getFirstEdge()
It returns a pointer to the first edge element of a graph.
std::map< int, Edge * > m_edgeMap
This map contains all edges from this graph.
GraphData * m_graphData
This class has the graph data and properties.
virtual size_t getEdgeInteratorCount()
It returns the number of elements of this iterator.
This class defines a commun interface to represents a graph iterator class. The main diferency to ano...
virtual size_t getVertexInteratorCount()
It returns the number of elements of this iterator.
This is the main graph implementation, that uses a cache policy anda graph loader to get all elements...
virtual te::graph::Vertex * getPreviousVertex()
It returns a pointer to the previous vertex element of a graph.
std::map< int, Vertex * >::iterator m_vertexMapIt
Iterator for all vertexs from this graph.