29 #ifndef __TERRALIB_GRAPH_INTERNAL_MEMORYITERATOR_H
30 #define __TERRALIB_GRAPH_INTERNAL_MEMORYITERATOR_H
33 #include "../Config.h"
102 virtual bool isVertexIteratorAfterEnd();
109 virtual size_t getVertexInteratorCount();
144 virtual bool isEdgeIteratorAfterEnd();
151 virtual size_t getEdgeInteratorCount();
168 #endif // __TERRALIB_GRAPH_INTERNAL_MEMORYITERATOR_H
#define TEGRAPHEXPORT
You can use this macro in order to export/import classes and functions from this module.
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...
Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and...
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...
std::map< int, Edge * > m_edgeMap
This map contains all edges from this graph.
This class defines a commun interface to represents a graph iterator class. The main diferency to ano...
std::map< int, Vertex * >::iterator m_vertexMapIt
Iterator for all vertexs from this graph.
This class defines a commun interface to represents a graph iterator class. The main diferency to ano...