| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
113 Graph::Node *dn = dom.parent();
310 Graph::Edge *e = cfg.outgoing(true).getEdge();
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
351 Graph::Node *bn = &that->dom;
352 Graph::Node *dn = &this->dom;
363 Graph::Node *out[2];
365 Graph::Edge::Type eR;
371 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK
[all...] |
| /external/opencv3/modules/calib3d/src/ |
| circlesgrid.hpp | 82 class Graph
92 Graph(size_t n);
160 void drawBasisGraphs(const std::vector<Graph> &basisGraphs, cv::Mat &drawImg, bool drawEdges = true,
164 void computeRNG(Graph &rng, std::vector<cv::Point2f> &vectors, cv::Mat *drawImage = 0) const;
165 void rng2gridGraph(Graph &rng, std::vector<cv::Point2f> &vectors) const;
166 void eraseUsedGraph(std::vector<Graph> &basisGraphs) const;
169 std::vector<Graph> &basisGraphs);
170 void findMCS(const std::vector<cv::Point2f> &basis, std::vector<Graph> &basisGraphs);
171 size_t findLongestPath(std::vector<Graph> &basisGraphs, Path &bestPath);
172 float computeGraphConfidence(const std::vector<Graph> &basisGraphs, bool addRow, const std::vector<size_t> &points
[all...] |
| /external/ceres-solver/internal/ceres/ |
| graph_algorithms_test.cc | 36 #include "ceres/graph.h"
44 Graph<int> graph; local
45 graph.AddVertex(0);
46 graph.AddVertex(1);
47 graph.AddVertex(2);
48 graph.AddVertex(3);
49 graph.AddVertex(4);
51 graph.AddEdge(0, 1);
52 graph.AddEdge(1, 2)
74 Graph<int> graph; local
105 Graph<int> graph; local
122 Graph<int> graph; local
169 Graph<int> graph; local
201 Graph<int> graph; local
[all...] |
| canonical_views_clustering.cc | 40 #include "ceres/graph.h"
56 // graph. centers will contain the vertices that are the identified
64 const Graph<int>& graph,
77 const Graph<int>* graph_;
88 const Graph<int>& graph,
93 cv.ComputeClustering(options, graph, centers, membership);
101 const Graph<int>& graph,
[all...] |
| graph_algorithms.h | 40 #include "ceres/graph.h"
46 // Compare two vertices of a graph by their degrees, if the degrees
51 explicit VertexTotalOrdering(const Graph<Vertex>& graph)
52 : graph_(graph) {}
62 const Graph<Vertex>& graph_;
68 explicit VertexDegreeLessThan(const Graph<Vertex>& graph)
69 : graph_(graph) {}
76 const Graph<Vertex>& graph_
[all...] |
| graph.h | 46 // A weighted undirected graph templated over the vertex ids. Vertex
49 class Graph {
51 Graph() {}
53 // Add a weighted vertex. If the vertex already exists in the graph,
92 // AddEdge on a pair of vertices which do not exist in the graph yet
117 // Calling VertexWeight on a vertex not in the graph will result in
124 // vertices is not present in the graph will result in undefined
135 // Calling Neighbors on a vertex not in the graph will result in
155 CERES_DISALLOW_COPY_AND_ASSIGN(Graph);
|
| visibility.cc | 46 #include "ceres/graph.h"
79 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility) {
125 Graph<int>* graph = new Graph<int>(); local
132 graph->AddVertex(i);
133 graph->AddEdge(i, i, kSelfEdgeWeight);
149 graph->AddEdge(camera1, camera2, weight);
152 VLOG(2) << "Schur complement graph time: " << (time(NULL) - start_time);
153 return graph;
[all...] |
| visibility_based_preconditioner.h | 55 #include "ceres/graph.h"
99 // by constructing a weighted graph on the clusters, with the weight
102 // maximum spanning forest is identified in this graph and the camera
159 Graph<int>* CreateClusterGraph(const vector<set<int> >& visibility) const;
160 void ForestToClusterPairs(const Graph<int>& forest,
|
| /external/opencv3/modules/stitching/include/opencv2/stitching/detail/ |
| util_inl.hpp | 56 B Graph::forEach(B body) const
69 B Graph::walkBreadthFirst(int from, B body) const
|
| /external/v8/src/compiler/ |
| diamond.h | 9 #include "src/compiler/graph.h"
18 Graph* graph; member in struct:v8::internal::compiler::Diamond
25 Diamond(Graph* g, CommonOperatorBuilder* b, Node* cond,
27 graph = g;
29 branch = graph->NewNode(common->Branch(hint), cond, graph->start());
30 if_true = graph->NewNode(common->IfTrue(), branch);
31 if_false = graph->NewNode(common->IfFalse(), branch);
32 merge = graph->NewNode(common->Merge(2), if_true, if_false)
[all...] |
| source-position.h | 67 explicit SourcePositionTable(Graph* graph);
80 Graph* const graph_;
|
| graph-trimmer.cc | 5 #include "src/compiler/graph-trimmer.h"
7 #include "src/compiler/graph.h"
13 GraphTrimmer::GraphTrimmer(Zone* zone, Graph* graph)
14 : graph_(graph), is_live_(graph, 2), live_(zone) {
15 live_.reserve(graph->NodeCount());
24 MarkAsLive(graph()->end());
|
| js-generic-lowering.h | 9 #include "src/compiler/graph-reducer.h"
47 Graph* graph() const;
|
| js-inlining.h | 8 #include "src/compiler/js-graph.h"
9 #include "src/compiler/graph-reducer.h"
19 // The JSInliner provides the core graph inlining machinery. Note that this
20 // class only deals with the mechanics of how to inline one graph into another,
39 Graph* graph() const;
|
| select-lowering.cc | 9 #include "src/compiler/graph.h"
17 SelectLowering::SelectLowering(Graph* graph, CommonOperatorBuilder* common)
18 : common_(common), graph_(graph) {}
32 Diamond d(graph(), common(), cond, p.hint());
|
| simplified-operator-reducer.h | 8 #include "src/compiler/graph-reducer.h"
44 Graph* graph() const;
|
| escape-analysis.h | 8 #include "src/compiler/graph.h"
25 EscapeAnalysis(Graph* graph, CommonOperatorBuilder* common, Zone* zone);
68 Graph* graph() const;
|
| /external/v8/test/unittests/compiler/ |
| graph-unittest.h | 9 #include "src/compiler/graph.h"
32 Node* start() { return graph()->start(); }
33 Node* end() { return graph()->end(); }
59 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::GraphTest
63 Graph graph_;
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| GraphUtil.py | 8 from altgraph import Graph
13 Generates and returns a :py:class:`~altgraph.Graph.Graph` instance with *node_num* nodes
16 g = Graph.Graph()
53 Generates and returns a :py:class:`~altgraph.Graph.Graph` instance that will have *steps* \* *growth_num* nodes
54 and a scale free (powerlaw) connectivity. Starting with a fully connected graph with *growth_num* nodes
55 at every step *growth_num* nodes are added to the graph and are connected to existing nodes with
59 graph = Graph.Graph(
[all...] |
| /system/update_engine/payload_generator/ |
| graph_utils.cc | 38 uint64_t EdgeWeight(const Graph& graph, const Edge& edge) {
41 graph[edge.first].out_edges.find(edge.second)->second.extents;
94 // For each node N in graph, drop all edges N->|index|.
95 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index) {
97 // edges in the graph.
98 for (Graph::iterator it = graph->begin(), e = graph->end(); it != e; ++it)
[all...] |
| cycle_breaker_unittest.cc | 39 void SetOpForNodes(Graph* graph) {
40 for (Vertex& vertex : *graph) {
58 const Graph::size_type kNodeCount = counter++;
60 Graph graph(kNodeCount);
61 SetOpForNodes(&graph);
63 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties()));
64 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties()));
65 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()))
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
45 /// PBQP Graph class.
49 class Graph : public GraphBase {
83 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
114 NIds[0] = NIds[1] = Graph::invalidNodeId();
120 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) {
136 void connect(Graph &G, EdgeId ThisEdgeId)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 92 const Function *Graph) {
94 return getSimpleNodeLabel(Node, Graph);
96 return getCompleteNodeLabel(Node, Graph);
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_graph.py | 4 from altgraph.Graph import Graph
9 graph = Graph()
11 self.assertEqual(graph.node_list(), [])
16 graph.add_node(1, o1)
17 graph.add_node(1, o1b)
18 graph.add_node(2, o2)
19 graph.add_node(3)
21 self.assertRaises(TypeError, graph.add_node, []
[all...] |
| /external/clang/lib/AST/ |
| StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) {
|
