Lines Matching refs:Reachable
135 /// NodesReachableFrom - Return the set of all nodes reachable from the given
140 NodeSubset Reachable;
142 // The initial node is reachable.
143 Reachable.AddNode(Idx);
145 NodeSubset Previous(Reachable);
147 // Add in all nodes which are children of a reachable node.
150 Reachable = Reachable.Join(Nodes[i].second);
152 // If nothing changed then we have found all reachable nodes.
153 if (Reachable == Previous)
154 return Reachable;
290 // Check that every node in the SCC is reachable from every other node in
296 // OK, now that we now that every node in the SCC is reachable from every
297 // other, this means that the set of nodes reachable from any node in the
298 // SCC is the same as the set of nodes reachable from every node in the
299 // SCC. Check that for every node N not in the SCC but reachable from the
300 // SCC, no element of the SCC is reachable from N.
317 // reachable from every other.
327 // of nodes reachable from this SCC must be contained either in the
341 // reachable from the initial node.