Lines Matching defs:Graph
19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
21 class Graph {
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
103 /// Graph - Default constructor. Creates an empty graph.
104 Graph() {
129 // on taking a constant Graph.
160 friend class Graph;
231 struct GraphTraits<Graph<N> > {
232 typedef typename Graph<N>::NodeType NodeType;
233 typedef typename Graph<N>::ChildIterator ChildIteratorType;
235 static inline NodeType *getEntryNode(const Graph<N> &G) { return G.AccessNode(0); }
237 return Graph<N>::child_begin(Node);
240 return Graph<N>::child_end(Node);
250 typedef Graph<NUM_NODES> GT;