21 class Graph {  class
24   Graph(const Graph&);
25   Graph& operator=(const Graph&);
104   Graph() {  in Graph()  function in llvm::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); }  in getEntryNode()
237    return Graph<N>::child_begin(Node);  in child_begin()
240    return Graph<N>::child_end(Node);  in child_end()
250   typedef Graph<NUM_NODES> GT;  in TEST()