Lines Matching refs:Reachable
133 /// NodesReachableFrom - Return the set of all nodes reachable from the given
138 NodeSubset Reachable;
140 // The initial node is reachable.
141 Reachable.AddNode(Idx);
143 NodeSubset Previous(Reachable);
145 // Add in all nodes which are children of a reachable node.
148 Reachable = Reachable.Join(Nodes[i].second);
150 // If nothing changed then we have found all reachable nodes.
151 if (Reachable == Previous)
152 return Reachable;
288 // Check that every node in the SCC is reachable from every other node in
294 // OK, now that we now that every node in the SCC is reachable from every
295 // other, this means that the set of nodes reachable from any node in the
296 // SCC is the same as the set of nodes reachable from every node in the
297 // SCC. Check that for every node N not in the SCC but reachable from the
298 // SCC, no element of the SCC is reachable from N.
315 // reachable from every other.
325 // of nodes reachable from this SCC must be contained either in the
339 // reachable from the initial node.
