DFS visitor class to return topological ordering. More...
#include <fst/topsort.h>

Public Types | |
| typedef A | Arc |
| typedef A::StateId | StateId |
Public Member Functions | |
| TopOrderVisitor (vector< StateId > *order, bool *acyclic) | |
| void | InitVisit (const Fst< A > &fst) |
| bool | InitState (StateId s, StateId r) |
| bool | TreeArc (StateId s, const A &arc) |
| bool | BackArc (StateId s, const A &arc) |
| bool | ForwardOrCrossArc (StateId s, const A &arc) |
| void | FinishState (StateId s, StateId p, const A *) |
| void | FinishVisit () |
DFS visitor class to return topological ordering.
Definition at line 36 of file topsort.h.
| typedef A fst::TopOrderVisitor< A >::Arc |
| typedef A::StateId fst::TopOrderVisitor< A >::StateId |
| fst::TopOrderVisitor< A >::TopOrderVisitor | ( | vector< StateId > * | order, | |
| bool * | acyclic | |||
| ) | [inline] |
| bool fst::TopOrderVisitor< A >::BackArc | ( | StateId | s, | |
| const A & | arc | |||
| ) | [inline] |
| void fst::TopOrderVisitor< A >::FinishState | ( | StateId | s, | |
| StateId | p, | |||
| const A * | ||||
| ) | [inline] |
| void fst::TopOrderVisitor< A >::FinishVisit | ( | ) | [inline] |
| bool fst::TopOrderVisitor< A >::ForwardOrCrossArc | ( | StateId | s, | |
| const A & | arc | |||
| ) | [inline] |
| bool fst::TopOrderVisitor< A >::InitState | ( | StateId | s, | |
| StateId | r | |||
| ) | [inline] |
| void fst::TopOrderVisitor< A >::InitVisit | ( | const Fst< A > & | fst | ) | [inline] |
| bool fst::TopOrderVisitor< A >::TreeArc | ( | StateId | s, | |
| const A & | arc | |||
| ) | [inline] |
1.7.1