Searched defs:n_g (Results 1 - 3 of 3) sorted by relevance

/system/update_engine/payload_generator/
H A Dtarjan_unittest.cc43 const Vertex::Index n_g = 6; local
58 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties()));
59 graph[n_g].out_edges.insert(make_pair(n_h, EdgeProperties()));
60 graph[n_h].out_edges.insert(make_pair(n_g, EdgeProperties()));
84 for (Vertex::Index i = n_g; i <= n_h; i++) {
89 EXPECT_TRUE(utils::VectorContainsValue(vertex_indexes, n_g));
H A Dtopological_sort_unittest.cc60 const Vertex::Index n_g = counter++; local
75 graph[n_e].out_edges.insert(make_pair(n_g, EdgeProperties()));
76 graph[n_g].out_edges.insert(make_pair(n_d, EdgeProperties()));
77 graph[n_g].out_edges.insert(make_pair(n_f, EdgeProperties()));
H A Dcycle_breaker_unittest.cc56 const Vertex::Index n_g = counter++; local
72 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties()));
73 graph[n_g].out_edges.insert(make_pair(n_h, EdgeProperties()));
74 graph[n_h].out_edges.insert(make_pair(n_g, EdgeProperties()));
92 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_g, n_h)) ||
93 utils::SetContainsKey(broken_edges, make_pair(n_h, n_g)));
186 const Vertex::Index n_g = counter++; local
205 graph[n_e].out_edges.insert(EdgeWithWeight(n_g, 5));
206 graph[n_f].out_edges.insert(EdgeWithWeight(n_g, 2));
207 graph[n_g]
[all...]

Completed in 321 milliseconds