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 |
|
virtual |
Virtual destructor.
|
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 |