Lines Matching refs:Nodes
19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
32 /// NodeSubset - A subset of the graph's nodes.
99 /// Nodes - The list of nodes for this graph.
100 NodeType Nodes[N];
106 // the Nodes array given a pointer to any element of it.
108 Nodes[i].first = i;
115 Nodes[FromIdx].second.AddNode(ToIdx);
122 Nodes[FromIdx].second.DeleteNode(ToIdx);
130 return const_cast<NodeType *>(&Nodes[Idx]);
133 /// NodesReachableFrom - Return the set of all nodes reachable from the given
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.
162 /// FirstNode - Pointer to first node in the graph's Nodes array.
164 /// Children - Set of nodes which are children of this one and that haven't
245 // Test SCC computation against every graph with NUM_NODES nodes or less.
274 /// NodesInSomeSCC - Those nodes which are in some SCC.
280 // Get the nodes in this SCC as a NodeSubset rather than a vector.
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
309 // The result must be the same for all other nodes in this SCC, so
314 // This is indeed a SCC: a maximal set of nodes for which each node is
325 // of nodes reachable from this SCC must be contained either in the
332 // The result must be the same for all other nodes in this SCC, so
338 // Finally, check that the nodes in some SCC are exactly those that are
