| /external/ceres-solver/internal/ceres/ |
| single_linkage_clustering_test.cc | 54 graph.AddEdge(0, 1, 1.0);
55 graph.AddEdge(1, 2, 1.0);
56 graph.AddEdge(2, 3, 1.0);
57 graph.AddEdge(4, 5, 1.0);
81 graph.AddEdge(0, 1, 1.0);
82 graph.AddEdge(1, 2, 1.0);
83 graph.AddEdge(2, 3, 1.0);
86 graph.AddEdge(4, 5, 0.5);
110 graph.AddEdge(0, 1, 1.0);
111 graph.AddEdge(1, 2, 1.0)
[all...] |
| graph_algorithms_test.cc | 51 graph.AddEdge(0, 1);
52 graph.AddEdge(1, 2);
53 graph.AddEdge(2, 3);
54 graph.AddEdge(3, 4);
81 graph.AddEdge(0, 1);
82 graph.AddEdge(0, 2);
83 graph.AddEdge(0, 3);
84 graph.AddEdge(0, 4);
108 graph.AddEdge(0, 1, 0.5);
109 graph.AddEdge(1, 0, 0.5)
[all...] |
| graph_test.cc | 49 graph.AddEdge(0, 1, 0.5);
65 graph.AddEdge(0, 1, 0.5);
90 graph.AddEdge(0, 1, 0.5);
100 graph.AddEdge(0, 1, 0.5);
|
| graph.h | 92 // AddEdge on a pair of vertices which do not exist in the graph yet
97 void AddEdge(const Vertex& vertex1, const Vertex& vertex2, double weight) {
113 void AddEdge(const Vertex& vertex1, const Vertex& vertex2) {
114 AddEdge(vertex1, vertex2, 1.0);
|
| canonical_views_clustering_test.cc | 62 graph_.AddEdge(i, i, 1.0);
70 graph_.AddEdge(kVertexIds[i], kVertexIds[i + 1], kEdgeWeights[i]);
|
| visibility.cc | 133 graph->AddEdge(i, i, kSelfEdgeWeight);
149 graph->AddEdge(camera1, camera2, weight);
|
| parameter_block_ordering.cc | 139 graph->AddEdge(parameter_blocks[j], parameter_blocks[k]);
|
| graph_algorithms.h | 342 forest->AddEdge(vertex1, vertex2, edge_weight);
343 forest->AddEdge(vertex2, vertex1, edge_weight);
|
| visibility_based_preconditioner.cc | 567 cluster_graph->AddEdge(i, j, intersection.size());
|
| /external/chromium_org/components/keyed_service/core/ |
| dependency_graph_unittest.cc | 49 graph.AddEdge(&parent, &child);
71 graph.AddEdge(&parent, &child1);
72 graph.AddEdge(&parent, &child2);
97 graph.AddEdge(&parent1, &child_of_1);
100 graph.AddEdge(&parent1, &child_of_12);
101 graph.AddEdge(&parent2, &child_of_12);
104 graph.AddEdge(&parent2, &child_of_2);
132 graph.AddEdge(&parent, &middle1);
135 graph.AddEdge(&parent, &middle2);
138 graph.AddEdge(&middle1, &bottom)
[all...] |
| dependency_graph.h | 30 void AddEdge(DependencyNode* depended, DependencyNode* dependee);
|
| dependency_graph.cc | 37 void DependencyGraph::AddEdge(DependencyNode* depended,
|
| /art/compiler/sea_ir/ir/ |
| regions_test.cc | 37 sg.AddEdge(root, then_region);
45 sg.AddEdge(root, else_region);
|
| sea.h | 310 void AddEdge(Region* src, Region* dst) const;
|
| sea.cc | 56 void SeaGraph::AddEdge(Region* src, Region* dst) const {
247 AddEdge(r, it->second); // Add edge to branch target.
255 AddEdge(r, it->second); // Add flow-through edge.
|
| /external/chromium_org/components/keyed_service/content/ |
| browser_context_dependency_manager.h | 39 void AddEdge(BrowserContextKeyedBaseFactory* depended,
|
| browser_context_keyed_base_factory.cc | 31 dependency_manager_->AddEdge(rhs, this);
|
| browser_context_dependency_manager.cc | 36 void BrowserContextDependencyManager::AddEdge(
39 dependency_graph_.AddEdge(depended, dependee);
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 113 /// AddEdge - Add an edge from the node with index FromIdx to the node with
115 void AddEdge(unsigned FromIdx, unsigned ToIdx) {
266 G.AddEdge(i, j);
270 G.AddEdge(i, j);
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 719 void AddEdge(ExplodedNode *Src, ExplodedNode *Dst) override;
736 void UbigraphViz::AddEdge(ExplodedNode *Src, ExplodedNode *Dst) {
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 236 virtual void AddEdge(ExplodedNode *Src, ExplodedNode *Dst) = 0;
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 223 if (NodeAuditor) NodeAuditor->AddEdge(V, this);
|
