Searched refs:Edge (Results 1 – 12 of 12) sorted by relevance
| /system/update_engine/payload_generator/ |
| D | cycle_breaker.h | 46 void BreakCycles(const Graph& graph, std::set<Edge>* out_cut_edges);
62 std::set<Edge> cut_edges_;
|
| D | cycle_breaker.cc | 40 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) { in BreakCycles()
112 Edge min_edge = make_pair(stack_[0], stack_[1]); in HandleCircuit()
118 Edge edge = make_pair(*it, *(it + 1)); in HandleCircuit()
153 Edge edge = make_pair(*(it - 1), *it); in StackContainsCutEdge()
|
| D | cycle_breaker_unittest.cc | 78 set<Edge> broken_edges; in TEST()
163 set<Edge> broken_edges; in TEST()
167 set<Edge> expected_cuts; in TEST()
217 set<Edge> broken_edges; in TEST()
248 set<Edge> broken_edges; in TEST()
273 set<Edge> broken_edges; in TEST()
|
| D | graph_utils.h | 34 uint64_t EdgeWeight(const Graph& graph, const Edge& edge);
|
| D | graph_types.h | 80 typedef std::pair<Vertex::Index, Vertex::Index> Edge; typedef
|
| D | inplace_generator.h | 94 const std::set<Edge>& edges,
|
| D | graph_utils.cc | 38 uint64_t EdgeWeight(const Graph& graph, const Edge& edge) { in EdgeWeight()
|
| D | inplace_generator.cc | 140 const set<Edge>& edges, in CutEdges()
147 for (const Edge& edge : edges) { in CutEdges()
594 set<Edge> cut_edges; in ConvertGraphToDag()
|
| D | inplace_generator_unittest.cc | 242 set<Edge> cut_edges; in TEST_F()
|
| /system/core/libmemunreachable/ |
| D | LeakFolding.cpp | 53 leak.scc->node.Edge(&ref->ptr->scc->node); in ComputeDAG()
91 leak.node.Edge(&ptr_leak->node); in FoldLeaks()
|
| D | Tarjan.h | 42 void Edge(Node<T>* ref) { in Edge() function
|
| /system/core/libpixelflinger/ |
| D | trap.cpp | 631 struct Edge struct
640 edge_dump( Edge* edge ) in edge_dump()
650 triangle_dump_edges( Edge* edges, in triangle_dump_edges()
663 Edge* edges, in edge_setup()
672 Edge* edge = edges + *pcount; in edge_setup()
719 triangle_sweep_edges( Edge* left, in triangle_sweep_edges()
720 Edge* right, in triangle_sweep_edges()
765 Edge edges[3]; in trianglex_big()
777 Edge* left = &edges[0]; in trianglex_big()
778 Edge* right = &edges[1]; in trianglex_big()
[all …]
|