Searched refs:n_c (Results 1 - 3 of 3) sorted by relevance

/system/update_engine/payload_generator/
H A Dcycle_breaker_unittest.cc52 const Vertex::Index n_c = counter++; local
66 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties()));
70 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties()));
89 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_c, n_d)) ||
91 utils::SetContainsKey(broken_edges, make_pair(n_e, n_c)));
182 const Vertex::Index n_c = counter++; local
199 graph[n_b].out_edges.insert(EdgeWithWeight(n_c, 4));
200 graph[n_c].out_edges.insert(EdgeWithWeight(n_b, 5));
201 graph[n_c].out_edges.insert(EdgeWithWeight(n_d, 3));
221 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_b, n_c)));
231 const Vertex::Index n_c = counter++; local
259 const Vertex::Index n_c = counter++; local
[all...]
H A Dtopological_sort_unittest.cc56 const Vertex::Index n_c = counter++; local
69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties()));
72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties()));
H A Dtarjan_unittest.cc39 const Vertex::Index n_c = 2; local
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties()));
56 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties()));
71 EXPECT_TRUE(utils::VectorContainsValue(vertex_indexes, n_c));

Completed in 348 milliseconds