Lines Matching full:root
42 // // Invoked when state discovered (2nd arg is DFS tree root)
43 // bool InitState(StateId s, StateId root);
51 // // when S is tree root)
100 for (StateId root = start; dfs && root < nstates;) {
101 state_color[root] = kDfsGrey;
102 state_stack.push(new DfsState<Arc>(fst, root));
103 dfs = visitor->InitState(root, root);
136 dfs = visitor->InitState(arc.nextstate, root);
148 // Find next tree root
149 for (root = root == start ? 0 : root + 1;
150 root < nstates && state_color[root] != kDfsWhite;
151 ++root);
