te::graph::GetSubGraph Class Reference

This class defines a function used to get a sub graph for a graph. More...

#include <GetSubGraph.h>

Public Member Functions

 GetSubGraph (te::graph::BidirectionalGraph *graph, te::graph::AbstractGraph *outGraph, int vertexId)
 Default constructor. More...
 
virtual ~GetSubGraph ()
 Virtual destructor. More...
 

Protected Member Functions

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

Detailed Description

This class defines a function used to get a sub graph for a graph.

Definition at line 54 of file GetSubGraph.h.

Constructor & Destructor Documentation

te::graph::GetSubGraph::GetSubGraph ( te::graph::BidirectionalGraph graph,
te::graph::AbstractGraph outGraph,
int  vertexId 
)

Default constructor.

Parameters
graphPointer to a bidirectional graph
outGraphPointer to a output graph
vertexIdorigin vertex identifier
virtual te::graph::GetSubGraph::~GetSubGraph ( )
virtual

Virtual destructor.

Member Function Documentation

void te::graph::GetSubGraph::getPredecessor ( te::graph::Vertex v,
te::graph::BidirectionalGraph g,
te::graph::AbstractGraph outGraph,
std::set< int > &  vertexIdSet 
)
protected

Recursive function used to calculate the deep attribute.

Parameters
vCurrent vertex in processing
gThe bidirection graph
outGraphPointer to a output graph
vertexIdSetThe set of vertex already visited

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