#include <fst/connect.h>

Public Types | |
| typedef A | Arc |
| typedef Arc::Weight | Weight |
| typedef A::StateId | StateId |
Public Member Functions | |
| SccVisitor (vector< StateId > *scc, vector< bool > *access, vector< bool > *coaccess, uint64 *props) | |
| SccVisitor (uint64 *props) | |
| void | InitVisit (const Fst< A > &fst) |
| bool | InitState (StateId s, StateId root) |
| 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 () |
Finds and returns strongly-connected components, accessible and coaccessible states and related properties. Uses Tarjan's single DFS SCC algorithm (see Aho, et al, "Design and Analysis of Computer Algorithms", 189pp). Use with DfsVisit();
Definition at line 120 of file connect.h.
| typedef A fst::SccVisitor< A >::Arc |
| typedef A::StateId fst::SccVisitor< A >::StateId |
| typedef Arc::Weight fst::SccVisitor< A >::Weight |
| fst::SccVisitor< A >::SccVisitor | ( | vector< StateId > * | scc, | |
| vector< bool > * | access, | |||
| vector< bool > * | coaccess, | |||
| uint64 * | props | |||
| ) | [inline] |
scc[i]: strongly-connected component number for state i. SCC numbers will be in topological order for acyclic input. access[i]: accessibility of state i. coaccess[i]: coaccessibility of state i. Any of above can be NULL. props: related property bits (cyclicity, initial cyclicity, accessibiliity, coaccessiblity) set/cleared (o.w. unchanged).
| fst::SccVisitor< A >::SccVisitor | ( | uint64 * | props | ) | [inline] |
| bool fst::SccVisitor< A >::BackArc | ( | StateId | s, | |
| const A & | arc | |||
| ) | [inline] |
| void fst::SccVisitor< A >::FinishState | ( | StateId | s, | |
| StateId | p, | |||
| const A * | ||||
| ) | [inline] |
| void fst::SccVisitor< A >::FinishVisit | ( | ) | [inline] |
| bool fst::SccVisitor< A >::ForwardOrCrossArc | ( | StateId | s, | |
| const A & | arc | |||
| ) | [inline] |
| bool fst::SccVisitor< A >::InitState | ( | StateId | s, | |
| StateId | root | |||
| ) | [inline] |
| void fst::SccVisitor< A >::InitVisit | ( | const Fst< A > & | fst | ) | [inline] |
| bool fst::SccVisitor< A >::TreeArc | ( | StateId | s, | |
| const A & | arc | |||
| ) | [inline] |
1.7.1