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()
95   DGTestGraph DG;  in TEST()  local
100   EXPECT_TRUE(DG.addNode(N1));  in TEST()
101   EXPECT_TRUE(DG.addNode(N2));  in TEST()
102   EXPECT_TRUE(DG.addNode(N3));  in TEST()
105   EXPECT_FALSE(DG.addNode(N1));  in TEST()
108   EXPECT_TRUE(DG.connect(N1, N2, E2));  in TEST()
109   EXPECT_TRUE(DG.connect(N2, N3, E3));  in TEST()
110   EXPECT_TRUE(DG.connect(N3, N1, E1));  in TEST()
120   EXPECT_FALSE(DG.connect(N3, N1, E1));  in TEST()
123   EXPECT_TRUE(DG.size() == 3);  in TEST()
126   EXPECT_NE(DG.findNode(N3), DG.end());  in TEST()
130   EXPECT_EQ(DG.findNode(N4), DG.end());  in TEST()
134   EXPECT_TRUE(DG.findIncomingEdgesToNode(N1, EL));  in TEST()
140   DGTestGraph DG;  in TEST()  local
143   DG.addNode(N1);  in TEST()
144   DG.addNode(N2);  in TEST()
145   DG.addNode(N3);  in TEST()
146   DG.connect(N1, N2, E2);  in TEST()
147   DG.connect(N2, N3, E3);  in TEST()
148   DG.connect(N3, N1, E1);  in TEST()
157   EXPECT_TRUE(DG.size() == 3);  in TEST()
173   EXPECT_FALSE(DG.findIncomingEdgesToNode(N2, EL));  in TEST()
181   EXPECT_TRUE(DG.findIncomingEdgesToNode(N2, EL));  in TEST()
186   DGTestGraph DG;  in TEST()  local
189   DG.addNode(N1);  in TEST()
190   DG.addNode(N2);  in TEST()
191   DG.addNode(N3);  in TEST()
192   DG.connect(N1, N2, E2);  in TEST()
193   DG.connect(N2, N3, E3);  in TEST()
194   DG.connect(N3, N1, E1);  in TEST()
195   DG.connect(N2, N1, E4);  in TEST()
210   DGTestGraph DG;  in TEST()  local
213   DG.addNode(N1);  in TEST()
214   DG.addNode(N2);  in TEST()
215   DG.addNode(N3);  in TEST()
216   DG.connect(N1, N2, E2);  in TEST()
217   DG.connect(N2, N3, E3);  in TEST()
218   DG.connect(N3, N1, E1);  in TEST()
227   EXPECT_TRUE(DG.size() == 3);  in TEST()
230   EXPECT_TRUE(DG.removeNode(N1));  in TEST()
231   EXPECT_EQ(DG.findNode(N1), DG.end());  in TEST()
232   EXPECT_FALSE(DG.removeNode(N1));  in TEST()
239   EXPECT_TRUE(DG.size() == 2);  in TEST()
242   EXPECT_FALSE(DG.findIncomingEdgesToNode(N2, EL));  in TEST()
248   DGTestGraph DG;  in TEST()  local
251   DG.addNode(N1);  in TEST()
252   DG.addNode(N2);  in TEST()
253   DG.addNode(N3);  in TEST()
254   DG.addNode(N4);  in TEST()
255   DG.connect(N1, N2, E2);  in TEST()
256   DG.connect(N2, N3, E3);  in TEST()
257   DG.connect(N3, N1, E1);  in TEST()
258   DG.connect(N3, N4, E4);  in TEST()
273   for (auto &SCC : make_range(scc_begin(&DG), scc_end(&DG)))  in TEST()