DiaDes
0.1
DIAgnosis of Discrete-Event System
|
#include <DFS.hh>
Public Types | |
typedef GraphSearch< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut > | Search |
typedef Search::Graph | Graph |
typedef Search::Node | Node |
typedef Search::Container | Container |
typedef Search::Opposite | Opposite |
typedef Search::Solution | Solution |
typedef Search::PathCut | PathCut |
typedef Search::Accumulator | Accumulator |
typedef Search::IncidentEdges | IncidentEdges |
![]() | |
typedef TContainer | Container |
typedef TAccumulator | Accumulator |
typedef TMark | Mark |
typedef TIncidentEdges | IncidentEdges |
typedef TOpposite | Opposite |
typedef TSolution | Solution |
typedef TPathCut | PathCut |
typedef IncidentEdges::Graph | Graph |
typedef IncidentEdges::Node | Node |
Public Member Functions | |
DFS (Graph &graph, const Container &nodes, const Opposite &opposite, Solution &s, PathCut &cut, Accumulator &results) | |
virtual | ~DFS () |
virtual void | initialize () |
bool | finished () const |
void | next () |
![]() | |
GraphSearch (Graph &graph, const Container &nodes, const Opposite &opposite, Solution &s, PathCut &cut, Accumulator &results) | |
virtual | ~GraphSearch () |
const Accumulator & | currentResults () |
bool | updated () const |
Private Attributes | |
std::stack< Node > | _stack |
Additional Inherited Members | |
![]() | |
bool | _updated |
Mark | _m |
Graph & | _graph |
const Container & | _nodes |
const Opposite & | _opposite |
Solution & | _s |
PathCut & | _cut |
Accumulator & | _results |
Implements a generic Depth-First Search (use of std::stack). Derives from Diades::Graph::GraphSearch
typedef Search::Accumulator Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::Accumulator |
typedef Search::Container Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::Container |
typedef Search::Graph Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::Graph |
typedef Search::IncidentEdges Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::IncidentEdges |
typedef Search::Node Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::Node |
typedef Search::Opposite Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::Opposite |
typedef Search::PathCut Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::PathCut |
typedef GraphSearch<TIncidentEdges,TOpposite,TContainer,TAccumulator, TMark,TSolution,TPathCut> Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::Search |
typedef Search::Solution Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::Solution |
|
inline |
Constructor
graph | see GraphSearch |
nodes | see GraphSearch |
opposite | see GraphSearch |
s | see GraphSearch |
cut | see GraphSearch |
results | see GraphSearch |
|
inlinevirtual |
|
inline |
Definition at line 93 of file DFS.hh.
Referenced by Diades::Graph::DFS< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >::next().
|
inlinevirtual |
Initialize the DFS
Reimplemented from Diades::Graph::GraphSearch< TIncidentEdges, TOpposite, TContainer, TAccumulator, TMark, TSolution, TPathCut >.
|
inline |
|
private |