27 #ifndef __TERRALIB_GRAPH_INTERNAL_ADDDEEPATTRIBUTE_H
28 #define __TERRALIB_GRAPH_INTERNAL_ADDDEEPATTRIBUTE_H
31 #include "../Config.h"
43 class BidirectionalGraph;
This class defines a function used to add to a graph the deep information attribute.
virtual ~AddDeepAttribute()
Virtual destructor.
void calculateDeepValue(te::graph::Vertex *v, te::graph::BidirectionalGraph *g, int &deepValue, std::set< int > &vertexIdSet)
Recursive function used to calculate the deep attribute.
AddDeepAttribute(te::graph::BidirectionalGraph *graph, std::string attributeName)
Default constructor.
This is a implementation of a Bidirectional Graph. By convention a bidirectional graph provides acces...
From the point of view of graph theory, vertices are treated as featureless and indivisible objects,...
#define TEGRAPHEXPORT
You can use this macro in order to export/import classes and functions from this module.