31 #include "../../common/STLUtils.h"
32 #include "../../datatype/AbstractData.h"
42 m_vertexId = rhs->
getId();
56 this->addAttribute(t, ad);
64 m_predecessors.clear();
66 m_neighborhood.clear();
103 return m_predecessors;
113 return m_neighborhood;
void setAttributeVecSize(int size)
This function is used to set the number of attributes associated with the vertex elements.
bool isDirty()
Used to verify the vertex state.
std::set< int > & getPredecessors()
Returns the Predecessors vector.
void removeAttribute(int idx)
Remove a attribute associated with this element.
bool isNew()
Flag used to indicate that this element was a new one.
std::vector< te::dt::AbstractData * > & getAttributes()
It returns the vector of attributes associated with this element.
Vertex(int id, bool isNew=true)
Constructor.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
void setDirty(bool flag)
Flag used to indicate that this element was changed.
A base class for values that can be retrieved from the data access module.
std::set< int > & getSuccessors()
Returns the Successors vector.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
~Vertex()
Default destructor.
std::set< int > & getNeighborhood()
Returns the Neighborhood vector.
int getId()
It returns the vertex id.
void addAttribute(int idx, te::dt::AbstractData *ad)
Add a new attribute to this element.
void FreeContents(boost::unordered_map< K, V * > &m)
This function can be applied to a map of pointers. It will delete each pointer in the map...