| /external/llvm/include/llvm/CodeGen/PBQP/ |
| HeuristicBase.h | 25 /// <li> void addToHeuristicList(Graph::NodeItr) : Add a node to the
28 /// <li> void preUpdateEdgeCosts(Graph::EdgeItr) : Handle the (imminent)
30 /// <li> void postUpdateEdgeCostts(Graph::EdgeItr) : Handle the new
32 /// <li> void handleAddEdge(Graph::EdgeItr) : Handle the addition of a new
33 /// edge into the PBQP graph (by R2).
34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the
49 /// node/edge in the PBQP graph.
55 typedef std::list<Graph::NodeItr> OptimalList;
58 Graph &g
[all...] |
| Solution.h | 17 #include "Graph.h"
29 typedef std::map<Graph::ConstNodeItr, unsigned,
76 void setSelection(Graph::NodeItr nItr, unsigned selection) {
83 unsigned getSelection(Graph::ConstNodeItr nItr) const {
|
| HeuristicSolver.h | 19 #include "Graph.h"
29 /// to HeuristicSolver<HImpl>::solve(Graph&).
33 /// backpropagation phase, and maintains the internal copy of the graph on
43 typedef std::list<Graph::EdgeItr> SolverEdges;
47 /// \brief Iterator type for edges in the solver graph.
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) {
104 Graph &g;
107 std::vector<Graph::NodeItr> stack;
118 /// graph.
119 /// @param g The graph representing the problem instance to be solved
[all...] |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
26 /// PBQP Graph class.
28 class Graph {
144 inline void copyFrom(const Graph &other);
147 /// \brief Construct an empty PBQP graph.
148 Graph() : numNodes(0), numEdges(0) {}
150 /// \brief Copy construct this graph from "other". Note: Does not copy node
151 /// and edge data, only graph structure and costs
[all...] |
| /external/ceres-solver/internal/ceres/ |
| graph_test.cc | 31 #include "ceres/graph.h"
40 TEST(Graph, EmptyGraph) {
41 Graph<int> graph; local
42 EXPECT_EQ(graph.vertices().size(), 0);
45 TEST(Graph, AddVertexAndEdge) {
46 Graph<int> graph; local
47 graph.AddVertex(0, 1.0);
48 graph.AddVertex(1, 2.0)
62 Graph<int> graph; local
87 Graph<int> graph; local
97 Graph<int> graph; local
[all...] |
| visibility.h | 40 #include "ceres/graph.h"
60 // function above, construct and return a graph whose vertices are
66 // This graph reflects the sparsity structure of reduced camera
70 // Caller acquires ownership of the returned Graph pointer
72 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility);
|
| canonical_views_clustering.h | 48 #include "ceres/graph.h"
57 // Compute a partitioning of the vertices of the graph using the
61 // interchangably. Given a weighted Graph G(V,E), the canonical views
63 // of the graph. If w_ij i s the weight connecting the vertex i to
78 // for each vertex in the graph which best explains it, while trying
101 const Graph<int>& graph,
|
| parameter_block_ordering.h | 36 #include "ceres/graph.h"
68 // Builds a graph on the parameter blocks of a Problem, whose
73 Graph<ParameterBlock*>* CreateHessianGraph(const Program& program);
|
| parameter_block_ordering.cc | 33 #include "ceres/graph.h"
49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
50 int independent_set_size = IndependentSetOrdering(*graph, ordering);
68 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
75 IndependentSetOrdering(*graph, &independent_set_ordering);
79 graph->RemoveVertex(parameter_block);
86 Graph<ParameterBlock*>*
88 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>) local
[all...] |
| 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
[all...] |
| canonical_views_clustering.cc | 35 #include "ceres/graph.h"
51 // graph. centers will contain the vertices that are the identified
58 void ComputeClustering(const Graph<int>& graph,
72 const Graph<int>* graph_;
82 const Graph<int>& graph,
88 cv.ComputeClustering(graph, options, centers, membership);
95 const Graph<int>& graph,
[all...] |
| graph_algorithms.h | 39 #include "ceres/graph.h"
44 // Compare two vertices of a graph by their degrees.
48 explicit VertexDegreeLessThan(const Graph<Vertex>& graph)
49 : graph_(graph) {}
59 const Graph<Vertex>& graph_;
62 // Order the vertices of a graph using its (approximately) largest
63 // independent set, where an independent set of a graph is a set of
72 // Given a undirected graph G(V,E), the algorithm is a greedy BFS
79 int IndependentSetOrdering(const Graph<Vertex>& graph
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 30 import org.antlr.misc.Graph;
39 Graph g = new Graph();
60 Graph g = new Graph();
74 Graph g = new Graph();
88 Graph g = new Graph();
102 Graph g = new Graph()
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 29 Analysis *Graph = &getAnalysis<Analysis>();
30 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
33 ViewGraph(Graph, Name, Simple, Title);
54 Analysis *Graph = &getAnalysis<Analysis>();
61 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
65 WriteGraph(File, Graph, Simple, Title);
89 Analysis *Graph = &getAnalysis<Analysis>();
90 std::string Title = DOTGraphTraits<Analysis*>::getGraphName(Graph);
92 ViewGraph(Graph, Name, Simple, Title);
113 Analysis *Graph = &getAnalysis<Analysis>()
[all...] |
| /external/srec/tools/grxmlcompile/ |
| gr_iface.cpp | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
30 int Graph::addSubGraph (SubGraph *sbGraph)
68 int Graph::getSubGraphIndex (int subId)
76 int Graph::getSubGraphIndex (SubGraph *sGraph)
86 void Graph::BeginRule (SubGraph *subg)
95 void Graph::EndRule (SubGraph *subg)
104 void Graph::BeginItem (SubGraph *subg)
113 void Graph::BeginItemRepeat (SubGraph *subg, int minCount, int maxCount)
122 void Graph::AddRuleRef (SubGraph *subg, int ruleNo)
132 void Graph::AddLabel (SubGraph *subg, int labNo
[all...] |
| grph.h | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
23 class Graph
26 Graph (const char *name)
36 ~Graph()
|
| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
23 // GraphTraits - This class should be specialized by different graph types...
30 // typedef NodeType - Type of Node in the graph
31 // typedef ChildIteratorType - Type used to iterate over children in graph
34 // Return the entry node of the graph
46 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
49 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGByteCodeParser.h | 40 // Populate the Graph with a basic block of code from the CodeBlock,
42 bool parse(Graph&, JSGlobalData*, CodeBlock*);
|
| DFGAliasTracker.h | 45 AliasTracker(Graph& graph)
46 : m_graph(graph)
112 // The graph, to look up potentially aliasing nodes.
113 Graph& m_graph;
|
| DFGScoreBoard.h | 38 // This class is used in performing a virtual register allocation over the graph.
45 ScoreBoard(Graph& graph, uint32_t firstTemporary)
46 : m_graph(graph)
113 // The graph, so we can get refCounts for nodes, to determine when values are dead.
114 Graph& m_graph;
|
| /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
| Briggs.h | 11 // PBQP graph representing a register allocation problem. Nodes which can be
13 // the PBQP graph first. If no provably allocable node is present in the graph
50 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
63 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
77 Graph *g;
80 typedef std::list<Graph::NodeItr> RNAllocableList;
83 typedef std::list<Graph::NodeItr> RNUnallocableList;
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 21 #include "llvm/CodeGen/PBQP/Graph.h"
43 PBQP::Graph& getGraph() { return graph; }
45 const PBQP::Graph& getGraph() const { return graph; }
54 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node,
66 unsigned getVRegForNode(PBQP::Graph::ConstNodeItr node) const;
69 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const;
94 typedef std::map<PBQP::Graph::ConstNodeItr, unsigned,
96 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node
99 PBQP::Graph graph; member in class:llvm::PBQPRAProblem
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 49 const ScheduleDAG *Graph) {
57 const ScheduleDAG *Graph) {
66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
68 const ScheduleDAG *Graph) {
99 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
21 class Graph {
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
32 /// NodeSubset - A subset of the graph's nodes.
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
101 /// Nodes - The list of nodes for this graph
[all...] |
| /external/llvm/lib/Analysis/IPA/ |
| CallPrinter.cpp | 1 //===- CallPrinter.cpp - DOT printer for call graph -----------------------===//
11 // containing the call graph of a module.
29 static std::string getGraphName(CallGraph *Graph) {
30 return "Call graph";
33 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
69 "View call graph",
74 "Print call graph to 'dot' file",
|
