| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.cc | 49 #include "ceres/graph.h"
154 // clusters by constructing another graph with the clusters as
164 // Construct a weighted graph on the set of clusters, where the
167 // maximum spanning forest of this graph.
170 scoped_ptr<Graph<int> > cluster_graph(
172 scoped_ptr<Graph<int> > forest(
192 scoped_ptr<Graph<int> > schur_complement_graph(
498 // Convert a graph into a list of edges that includes self edges for
501 const Graph<int>& forest,
541 // Construct a graph whose vertices are the clusters, and the edg
[all...] |
| canonical_views_clustering_test.cc | 40 #include "ceres/graph.h"
50 // The graph structure is as follows.
68 // The graph interface is directed, so remember to create both
78 Graph<int> graph_;
|
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 137 /// \brief Holds graph-level metadata relevant to PBQP RA problems.
185 // optimally reducible) when reducing the graph.
345 typedef PBQP::Graph<RegAllocSolverImpl> Graph;
347 RegAllocSolverImpl(Graph &G) : G(G) {}
360 "PBQP Graph should not contain single or zero-option nodes");
484 // Compute a reduction order for the graph by iteratively applying PBQP
491 assert(!G.empty() && "Cannot reduce empty graph.");
545 SpillCostComparator(const Graph& G) : G(G) {}
554 const Graph& G
[all...] |
| /external/opencv3/modules/calib3d/src/ |
| circlesgrid.cpp | 429 Graph::Graph(size_t n)
437 bool Graph::doesVertexExist(size_t id) const
442 void Graph::addVertex(size_t id)
449 void Graph::addEdge(size_t id1, size_t id2)
458 void Graph::removeEdge(size_t id1, size_t id2)
467 bool Graph::areVerticesAdjacent(size_t id1, size_t id2) const
476 size_t Graph::getVerticesCount() const
481 size_t Graph::getDegree(size_t id) const
489 void Graph::floydWarshall(cv::Mat &distanceMatrix, int infinity) cons
[all...] |
| /external/v8/src/compiler/ |
| node-properties.h | 15 class Graph;
76 // within the graph (i.e. an IfException projection is present).
93 // Merge the control node {node} into the end of the graph, introducing a
95 static void MergeControlToEnd(Graph* graph, CommonOperatorBuilder* common,
112 // assumes a linear effect-chain up to a {CheckPoint} node in the graph.
|
| branch-elimination.h | 8 #include "src/compiler/graph-reducer.h"
90 Graph* graph() const;
|
| graph-replay.cc | 5 #include "src/compiler/graph-replay.h"
9 #include "src/compiler/graph.h"
20 void GraphReplayPrinter::PrintReplay(Graph* graph) {
22 PrintF(" Node* nil = graph()->NewNode(common()->Dead());\n");
23 Zone zone(graph->zone()->allocator());
24 AllNodes nodes(&zone, graph);
29 PrintF(" Node* n%d = graph()->NewNode(op", node->id());
|
| js-builtin-reducer.h | 8 #include "src/compiler/graph-reducer.h"
61 Graph* graph() const;
|
| simplified-lowering.h | 9 #include "src/compiler/js-graph.h"
85 Graph* graph() { return jsgraph()->graph(); } function in class:v8::internal::compiler::final
|
| loop-peeling.cc | 6 #include "src/compiler/graph.h"
49 // from the peeled iteration, resulting in the graph as follows:
98 // graph, but are instead computed by the {LoopFinder}.
110 Peeling(Graph* graph, Zone* tmp_zone, size_t max, NodeVector* p)
111 : node_map(graph, static_cast<uint32_t>(max)), pairs(p) {}
124 void CopyNodes(Graph* graph, Zone* tmp_zone, Node* dead, NodeRange nodes) {
130 Insert(node, graph->NewNode(node->op(), node->InputCount(), &inputs[0]));
195 PeeledIteration* LoopPeeler::Peel(Graph* graph, CommonOperatorBuilder* common
[all...] |
| js-create-lowering.h | 8 #include "src/compiler/graph-reducer.h"
79 Graph* graph() const;
|
| js-intrinsic-lowering.h | 9 #include "src/compiler/graph-reducer.h"
77 Graph* graph() const;
|
| js-native-context-specialization.h | 9 #include "src/compiler/graph-reducer.h"
105 Graph* graph() const;
|
| /external/v8/test/unittests/compiler/ |
| value-numbering-reducer-unittest.cc | 7 #include "src/compiler/graph.h"
36 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::ValueNumberingReducerTest
39 Graph graph_;
45 Node* na = graph()->NewNode(&kOp0);
46 Node* nb = graph()->NewNode(&kOp0);
47 Node* n1 = graph()->NewNode(&kOp1, na);
48 Node* n2 = graph()->NewNode(&kOp1, nb);
55 Node* n0 = graph()->NewNode(&kOp0);
56 Node* n1 = graph()->NewNode(&kOp1, n0)
[all...] |
| instruction-selector-unittest.h | 41 new (test->zone()) Graph(test->zone()),
49 test->isolate(), new (test->zone()) Graph(test->zone()),
57 test->isolate(), new (test->zone()) Graph(test->zone()),
67 test->isolate(), new (test->zone()) Graph(test->zone()),
|
| /system/update_engine/payload_generator/ |
| tarjan_unittest.cc | 45 const Graph::size_type kNodeCount = 8;
47 Graph graph(kNodeCount);
49 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties()));
50 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties()));
51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties()));
53 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties()));
54 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties()));
55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties()))
[all...] |
| cycle_breaker.cc | 39 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) {
45 subgraph_ = graph;
47 // The paper calls for the "adjacency structure (i.e., graph) of
50 // We arbitrarily order each vertex by its index in the graph. Thus,
57 for (Graph::size_type i = 0; i < subgraph_.size(); i++) {
58 InstallOperation_Type op_type = graph[i].aop.op.type();
69 for (Graph::size_type j = i; j < subgraph_.size(); j++) {
84 // If there's a link from *it -> *jt in the graph,
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
36 public class Graph {
|
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 127 /// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| ObjectGraph.py | 2 altgraph.ObjectGraph - Graph of objects with an identifier
5 A graph of objects that have a "graphident" attribute.
6 graphident is the key for the object in the graph
10 from altgraph.Graph import Graph
15 A graph of objects that have a "graphident" attribute.
16 graphident is the key for the object in the graph
18 def __init__(self, graph=None, debug=0):
19 if graph is None:
20 graph = Graph(
[all...] |
| /external/testng/src/main/java/org/testng/internal/ |
| MethodHelper.java | 31 private static final Map<ITestNGMethod[], Graph<ITestNGMethod>> GRAPH_CACHE =
191 private static Graph<ITestNGMethod> topologicalSort(ITestNGMethod[] methods,
193 Graph<ITestNGMethod> result = new Graph<>();
200 // Create the graph
299 Graph<ITestNGMethod> g = GRAPH_CACHE.get(methods);
|
| /external/llvm/lib/Analysis/ |
| CFLAliasAnalysis.cpp | 15 // papers, we build a graph of the uses of a variable, where each node is a
23 // Because this algorithm requires a graph search on each query, we execute the
25 // in order to transform the graph into sets of variables that may alias in
155 // \brief Gets the edges our graph should have, based on an Instruction*
463 // users of in order to build our graph. In some cases (i.e. add),
496 // Set building requires a weighted bidirectional graph.
529 // ----- Various Edge iterators for the graph ----- //
531 // \brief Iterator for edges. Because this graph is bidirected, we don't
585 // ----- Actual graph-related things ----- //
623 // \brief Gets an arbitrary node in the graph as a starting point fo
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ra.cpp | 319 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next())
320 if (ei.getType() == Graph::Edge::TREE ||
321 ei.getType() == Graph::Edge::FORWARD)
342 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
354 pb->cfg.attach(&pn->cfg, Graph::Edge::TREE);
355 pn->cfg.attach(&bb->cfg, Graph::Edge::FORWARD);
364 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
462 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
520 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
521 if (ei.getType() == Graph::Edge::DUMMY
[all...] |
| /external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_lowering_nvc0.cpp | 387 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
409 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
412 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) {
434 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
507 Graph::EdgeIterator ei = bb->cfg.incident();
508 if (ei.getType() != Graph::Edge::BACK)
510 if (ei.getType() != Graph::Edge::BACK
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-js-context-specialization.cc | 6 #include "src/compiler/js-graph.h"
13 #include "test/cctest/compiler/graph-builder-tester.h"
22 : graph_(new (main_zone()) Graph(main_zone())),
27 jsgraph_(main_isolate(), graph(), common(), &javascript_, &simplified_,
29 reducer_(main_zone(), graph()),
38 Graph* graph() { return graph_; } function in class:v8::internal::compiler::ContextSpecializationTester
41 Graph* graph_;
55 Node* start = t.graph()->NewNode(t.common()->Start(0));
56 t.graph()->SetStart(start)
[all...] |
