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

/system/update_engine/payload_generator/
H A Dtarjan_unittest.cc38 const Vertex::Index n_b = 1; local
51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties()));
70 EXPECT_TRUE(utils::VectorContainsValue(vertex_indexes, n_b));
H A Dtopological_sort_unittest.cc55 const Vertex::Index n_b = counter++; local
72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties()));
73 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
H A Dcycle_breaker_unittest.cc51 const Vertex::Index n_b = counter++; local
65 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
69 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties()));
87 utils::SetContainsKey(broken_edges, make_pair(n_e, n_b)) ||
88 utils::SetContainsKey(broken_edges, make_pair(n_b, n_a)));
181 const Vertex::Index n_b = counter++; local
195 graph[n_a].out_edges.insert(EdgeWithWeight(n_b, 4));
198 graph[n_b].out_edges.insert(EdgeWithWeight(n_a, 3));
199 graph[n_b].out_edges.insert(EdgeWithWeight(n_c, 4));
200 graph[n_c].out_edges.insert(EdgeWithWeight(n_b,
230 const Vertex::Index n_b = counter++; local
258 const Vertex::Index n_b = counter++; local
[all...]

Completed in 49 milliseconds