Public Member Functions | Protected Member Functions | List of all members
te::graph::AddDeepAttribute Class Reference

This class defines a function used to add to a graph the deep information attribute. More...

#include <AddDeepAttribute.h>

Public Member Functions

 AddDeepAttribute (te::graph::BidirectionalGraph *graph, std::string attributeName)
 Default constructor. More...
 
virtual ~AddDeepAttribute ()
 Virtual destructor. More...
 

Protected Member Functions

void calculateDeepValue (te::graph::Vertex *v, te::graph::BidirectionalGraph *g, int &deepValue, std::set< int > &vertexIdSet)
 Recursive function used to calculate the deep attribute. More...
 

Detailed Description

This class defines a function used to add to a graph the deep information attribute.

Definition at line 53 of file AddDeepAttribute.h.

Constructor & Destructor Documentation

te::graph::AddDeepAttribute::AddDeepAttribute ( te::graph::BidirectionalGraph *  graph,
std::string  attributeName 
)

Default constructor.

Parameters
graphPointer to a bidirectional graph
attributeNameThe name used to represent the deep attribute

Definition at line 43 of file AddDeepAttribute.cpp.

References te::graph::Vertex::addAttribute(), te::graph::Graph::addVertexProperty(), calculateDeepValue(), te::graph::Graph::flush(), te::graph::SequenceIterator::getFirstVertex(), te::graph::Vertex::getId(), te::dt::Property::getName(), te::graph::AbstractIterator::getNextVertex(), te::graph::AbstractIterator::getVertexInteratorCount(), te::graph::Graph::getVertexProperty(), te::graph::Graph::getVertexPropertySize(), te::dt::INT32_TYPE, te::graph::AbstractIterator::isVertexIteratorAfterEnd(), p, te::common::TaskProgress::pulse(), te::dt::Property::setId(), te::common::TaskProgress::setMessage(), te::dt::Property::setParent(), te::common::TaskProgress::setTotalSteps(), te::graph::Graph::update(), and ~AddDeepAttribute().

te::graph::AddDeepAttribute::~AddDeepAttribute ( )
virtualdefault

Virtual destructor.

Referenced by AddDeepAttribute().

Member Function Documentation

void te::graph::AddDeepAttribute::calculateDeepValue ( te::graph::Vertex *  v,
te::graph::BidirectionalGraph *  g,
int &  deepValue,
std::set< int > &  vertexIdSet 
)
protected

Recursive function used to calculate the deep attribute.

Parameters
vCurrent vertex in processing
gThe bidirection graph
deepValueCurrent value for deep attribute calculated
vertexIdSetThe set of vertex already visited

Definition at line 109 of file AddDeepAttribute.cpp.

References te::graph::Graph::getEdge(), te::graph::Vertex::getId(), te::graph::Edge::getIdFrom(), te::graph::Vertex::getPredecessors(), and te::graph::Graph::getVertex().

Referenced by AddDeepAttribute().

The documentation for this class was generated from the following files: