TuttleOFX
1
|
detect if there is a cycle inside a directed graph or if we can garantee that it's a DAG, Directed Acyclic Graph. More...
#include <Visitors.hpp>
Public Member Functions | |
CycleDetector (bool &hasCycle) | |
template<class EdgeDescriptor , class Graph > | |
void | back_edge (EdgeDescriptor, const Graph &) |
Data Fields | |
bool & | _hasCycle |
detect if there is a cycle inside a directed graph or if we can garantee that it's a DAG, Directed Acyclic Graph.
Definition at line 20 of file Visitors.hpp.
tuttle::host::graph::visitor::CycleDetector::CycleDetector | ( | bool & | hasCycle | ) | [inline] |
Definition at line 23 of file Visitors.hpp.
References _hasCycle.
void tuttle::host::graph::visitor::CycleDetector::back_edge | ( | EdgeDescriptor | , |
const Graph & | |||
) | [inline] |
Definition at line 31 of file Visitors.hpp.
References _hasCycle.
Definition at line 37 of file Visitors.hpp.
Referenced by back_edge(), and CycleDetector().