Lines Matching refs:scc
118 // DFS SCC algorithm (see Aho, et al, "Design and Analysis of Computer
127 // scc[i]: strongly-connected component number for state i.
128 // SCC numbers will be in topological order for acyclic input.
134 SccVisitor(vector<StateId> *scc, vector<bool> *access,
136 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}
174 // Numbers SCC's in topological order when acyclic.
187 vector<StateId> *scc_; // State's scc number
194 StateId nscc_; // SCC count
197 vector<StateId> *lowlink_; // lowlink[s] == dfnumber[s] => SCC root
198 vector<bool> *onstack_; // is a state on the SCC stack
199 vector<StateId> *scc_stack_; // SCC stack (w/ random access)
260 if ((*dfnumber_)[s] == (*lowlink_)[s]) { // root of new SCC
