Searched refs:n_i (Results 1 - 2 of 2) sorted by relevance
/system/update_engine/payload_generator/ |
H A D | topological_sort_unittest.cc | 62 const Vertex::Index n_i = counter++; local 68 graph[n_i].out_edges.insert(make_pair(n_j, EdgeProperties())); 69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties())); 70 graph[n_i].out_edges.insert(make_pair(n_e, EdgeProperties())); 71 graph[n_i].out_edges.insert(make_pair(n_h, EdgeProperties()));
|
H A D | cycle_breaker_unittest.cc | 188 const Vertex::Index n_i = counter++; local 209 graph[n_h].out_edges.insert(EdgeWithWeight(n_i, 8)); 210 graph[n_i].out_edges.insert(EdgeWithWeight(n_e, 4)); 211 graph[n_i].out_edges.insert(EdgeWithWeight(n_h, 9)); 212 graph[n_i].out_edges.insert(EdgeWithWeight(n_j, 6)); 224 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_h, n_i)));
|
Completed in 84 milliseconds