Lines Matching full:g

26   Graph<4> G;
27   G.AddEdge(0, 1);
28   G.AddEdge(0, 2);
29   G.AddEdge(1, 3);
31   auto It = BFIter::begin(G);
32   auto End = BFIter::end(G);
34   EXPECT_EQ(*It, G.AccessNode(0));
37   EXPECT_EQ(*It, G.AccessNode(1));
40   EXPECT_EQ(*It, G.AccessNode(2));
43   EXPECT_EQ(*It, G.AccessNode(3));
51   Graph<4> G;
52   G.AddEdge(0, 1);
53   G.AddEdge(1, 0);
54   G.AddEdge(1, 2);
55   G.AddEdge(2, 1);
56   G.AddEdge(2, 1);
57   G.AddEdge(2, 3);
58   G.AddEdge(3, 2);
59   G.AddEdge(3, 1);
60   G.AddEdge(3, 0);
62   auto It = BFIter::begin(G);
63   auto End = BFIter::end(G);
65   EXPECT_EQ(*It, G.AccessNode(0));
68   EXPECT_EQ(*It, G.AccessNode(1));
71   EXPECT_EQ(*It, G.AccessNode(2));
74   EXPECT_EQ(*It, G.AccessNode(3));
88   Graph<4> G;
89   G.AddEdge(0, 1);
90   G.AddEdge(1, 2);
91   G.AddEdge(1, 3);
93   std::array<decltype(G)::NodeType *, 4> NodesFirstPass, NodesSecondPass;
95   auto B = bf_begin(G), E = bf_end(G);