94   EXPECT_EQ(E.size(), G.edges().size());  in graphEdgeTester()
95   EXPECT_FALSE(G.edges().empty());  in graphEdgeTester()
103     EXPECT_NE(G.edges().end(),  in graphEdgeTester()
104               std::find_if(G.edges().begin(), G.edges().end(), Pred));  in graphEdgeTester()
108   for (auto &EV : G.edges()) {  in graphEdgeTester()
193   EXPECT_TRUE(G.edges().empty());  in TEST()
195   EXPECT_EQ(G.edges().begin(), G.edges().end());  in TEST()
212   EXPECT_EQ(0u, G.edges().size());  in TEST()
214   EXPECT_TRUE(G.edges().empty());  in TEST()
216   EXPECT_EQ(G.edges().begin(), G.edges().end());  in TEST()
240   EXPECT_EQ(1u, G.edges().size());  in TEST()
242   EXPECT_FALSE(G.edges().empty());  in TEST()
244   EXPECT_NE(G.edges().begin(), G.edges().end());  in TEST()
245   EXPECT_EQ(EI(0u, 0u), G.edges().begin()->first);  in TEST()
246   EXPECT_EQ(2u, G.edges().begin()->second.EA);  in TEST()