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... | |
This class defines a function used to get a sub graph for a graph.
Definition at line 54 of file GetSubGraph.h.
te::graph::GetSubGraph::GetSubGraph | ( | te::graph::BidirectionalGraph * | graph, |
te::graph::AbstractGraph * | outGraph, | ||
int | vertexId | ||
) |
Default constructor.
graph | Pointer to a bidirectional graph |
outGraph | Pointer to a output graph |
vertexId | origin vertex identifier |
Definition at line 45 of file GetSubGraph.cpp.
References te::graph::AbstractGraph::add(), te::graph::Graph::getEdge(), te::graph::Vertex::getId(), te::graph::Edge::getIdFrom(), getPredecessor(), te::graph::Vertex::getPredecessors(), and te::graph::Graph::getVertex().
|
virtual |
Virtual destructor.
Definition at line 98 of file GetSubGraph.cpp.
|
protected |
Recursive function used to calculate the deep attribute.
v | Current vertex in processing |
g | The bidirection graph |
outGraph | Pointer to a output graph |
vertexIdSet | The set of vertex already visited |
Definition at line 102 of file GetSubGraph.cpp.
References te::graph::AbstractGraph::add(), te::graph::Graph::getEdge(), te::graph::Vertex::getId(), te::graph::Edge::getIdFrom(), te::graph::Vertex::getPredecessors(), and te::graph::Graph::getVertex().
Referenced by GetSubGraph().