55 template <> struct GraphTraits<DGTestNode *> {  struct
56   using NodeRef = DGTestNode *;
58   static DGTestNode *DGTestGetTargetNode(DGEdge<DGTestNode, DGTestEdge> *P) {  in DGTestGetTargetNode()
64   using ChildIteratorType =
66   using ChildEdgeIteratorType = DGTestNode::iterator;
68   static NodeRef getEntryNode(NodeRef N) { return N; }  in getEntryNode()
69   static ChildIteratorType child_begin(NodeRef N) {  in child_begin()
72   static ChildIteratorType child_end(NodeRef N) {  in child_end()
76   static ChildEdgeIteratorType child_edge_begin(NodeRef N) {  in child_edge_begin()
79   static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end(); }  in child_edge_end()
83 struct GraphTraits<DGTestGraph *> : public GraphTraits<DGTestNode *> {  struct
84   using nodes_iterator = DGTestGraph::iterator;
85   static NodeRef getEntryNode(DGTestGraph *DG) { return *DG->begin(); }  in getEntryNode()
86   static nodes_iterator nodes_begin(DGTestGraph *DG) { return DG->begin(); }  in nodes_begin()
87   static nodes_iterator nodes_end(DGTestGraph *DG) { return DG->end(); }  in nodes_end()