Lines Matching refs:scc
28 // DFS SCC algorithm (see Aho, et al, "Design and Analysis of Computer
37 // scc[i]: strongly-connected component number for state i.
38 // SCC numbers will be in topological order for acyclic input.
44 SccVisitor(vector<StateId> *scc, vector<bool> *access,
46 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}
132 if ((*dfnumber_)[s] == (*lowlink_)[s]) { // root of new SCC
165 // Numbers SCC's in topological order when acyclic.
178 vector<StateId> *scc_; // State's scc number
185 StateId nscc_; // SCC count
188 vector<StateId> *lowlink_; // lowlink[s] == dfnumber[s] => SCC root
189 vector<bool> *onstack_; // is a state on the SCC stack
190 vector<StateId> *scc_stack_; // SCC stack (w/ random access)
