30 #ifndef __TERRALIB_GRAPH_INTERNAL_VERTEX_H
31 #define __TERRALIB_GRAPH_INTERNAL_VERTEX_H
34 #include "../Config.h"
49 namespace dt {
class AbstractData; }
80 Vertex(
int id,
bool isNew =
true);
106 std::vector<te::dt::AbstractData*>& getAttributes();
117 void setAttributeVecSize(
int size);
135 void removeAttribute(
int idx);
145 std::set<int>& getPredecessors();
155 std::set<int>& getSuccessors();
165 std::set<int>& getNeighborhood();
172 void setDirty(
bool flag);
208 #endif // __TERRALIB_GRAPH_INTERNAL_VERTEX_H
#define TEGRAPHEXPORT
You can use this macro in order to export/import classes and functions from this module.
bool m_new
Flag used to indicate if this element is a new one.
std::set< int > m_predecessors
List of all input edges (used in bidirectional graph).
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
std::vector< te::dt::AbstractData * > m_attrs
This is the list of all vertex attributes.
bool m_dirty
Flag used to indicate that vertex was changed.
A base class for values that can be retrieved from the data access module.
int m_vertexId
This is the vertex unique identifier.
std::set< int > m_successors
List of all output edges (used in directional graph).
std::set< int > m_neighborhood
List of all neighbors edges (used in undirectional graph).