Searched defs:vertex (Results 1 - 5 of 5) sorted by relevance

/system/update_engine/payload_generator/
H A Dtarjan.cc34 void TarjanAlgorithm::Execute(Vertex::Index vertex, argument
42 required_vertex_ = vertex;
44 Tarjan(vertex, graph);
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) { argument
50 CHECK_EQ((*graph)[vertex].index, kInvalidIndex);
51 (*graph)[vertex].index = index_;
52 (*graph)[vertex].lowlink = index_;
54 stack_.push_back(vertex);
55 for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin();
56 it != (*graph)[vertex]
[all...]
H A Dcycle_breaker.cc48 // strong (-ly connected) component K with least vertex in subgraph
50 // We arbitrarily order each vertex by its index in the graph. Thus,
52 // and looking for the strongly connected component with vertex s.
74 // Calculate SCC (strongly connected component) with vertex i.
156 bool CycleBreaker::Circuit(Vertex::Index vertex, Vertex::Index depth) { argument
157 // "vertex" was "v" in the original paper.
159 stack_.push_back(vertex);
160 blocked_[vertex] = true;
176 subgraph_[vertex].subgraph_edges.begin();
177 w != subgraph_[vertex]
[all...]
H A Dinplace_generator_unittest.cc157 Vertex vertex; local
158 InstallOperation& op = vertex.aop.op;
164 InplaceGenerator::SubstituteBlocks(&vertex, remove_blocks, replace_blocks);
574 Vertex vertex; local
575 InplaceGenerator::CreateScratchNode(12, 34, &vertex);
576 EXPECT_EQ(InstallOperation::REPLACE_BZ, vertex.aop.op.type());
577 EXPECT_EQ(0U, vertex.aop.op.data_offset());
578 EXPECT_EQ(0U, vertex.aop.op.data_length());
579 EXPECT_EQ(1, vertex.aop.op.dst_extents_size());
580 EXPECT_EQ(12U, vertex
[all...]
H A Dinplace_generator.cc89 // Compares the operations in the vertex a and b of graph_.
108 Vertex* vertex,
113 ExpandExtents(vertex->aop.op.src_extents());
125 for (auto& edge_prop_pair : vertex->out_edges) {
134 vertex->aop.op.clear_src_extents();
136 StoreExtents(new_extents, vertex->aop.op.mutable_src_extents());
155 // create vertex to copy original->scratch
410 LOG(INFO) << "Removing block 0 from the selected scratch range in vertex "
492 << ": old dst: " << cuts[i].old_dst << " new vertex: "
660 Vertex* vertex) {
107 SubstituteBlocks( Vertex* vertex, const vector<Extent>& remove_extents, const vector<Extent>& replace_extents) argument
658 CreateScratchNode(uint64_t start_block, uint64_t num_blocks, Vertex* vertex) argument
670 AddInstallOpToBlocksVector( const InstallOperation& operation, const Graph& graph, Vertex::Index vertex, vector<Block>* blocks) argument
709 Vertex::Index vertex = existing_vertex; local
782 const Vertex& vertex = graph[vertex_index]; local
[all...]
/system/core/libmemunreachable/
H A DTarjan.h71 void Tarjan(Node<T>* vertex, Graph<T>& graph);
97 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) { argument
98 assert(vertex->index == UNDEFINED_INDEX);
99 vertex->index = index_;
100 vertex->lowlink = index_;
102 stack_.push_back(vertex);
103 for (auto& it: vertex->references_out) {
107 vertex->lowlink = std::min(vertex->lowlink, vertex_next->lowlink);
109 vertex
[all...]

Completed in 37 milliseconds