Cross Reference: /external/ceres-solver/internal/ceres/graph_algorithms

Lines Matching defs:graph
36 #include "ceres/graph.h"
44   Graph<int> graph;
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);
53   graph.AddEdge(2, 3);
54   graph.AddEdge(3, 4);
59   int independent_set_size = IndependentSetOrdering(graph, &ordering);
74   Graph<int> graph;
75   graph.AddVertex(0);
76   graph.AddVertex(1);
77   graph.AddVertex(2);
78   graph.AddVertex(3);
79   graph.AddVertex(4);
81   graph.AddEdge(0, 1);
82   graph.AddEdge(0, 2);
83   graph.AddEdge(0, 3);
84   graph.AddEdge(0, 4);
93   int independent_set_size = IndependentSetOrdering(graph, &ordering);
105   Graph<int> graph;
106   graph.AddVertex(0, 1.0);
107   graph.AddVertex(1, 2.0);
108   graph.AddEdge(0, 1, 0.5);
109   graph.AddEdge(1, 0, 0.5);
111   scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph));
122   Graph<int> graph;
123   graph.AddVertex(0);
124   graph.AddVertex(1);
125   graph.AddVertex(2);
126   graph.AddVertex(3);
127   graph.AddVertex(4);
129   graph.AddEdge(0, 1, 1.0);
130   graph.AddEdge(0, 2, 2.0);
131   graph.AddEdge(0, 3, 3.0);
132   graph.AddEdge(0, 4, 4.0);
134   scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph));
169   Graph<int> graph;
170   graph.AddVertex(0);
171   graph.AddVertex(1);
172   graph.AddVertex(2);
173   graph.AddVertex(3);
179   graph.AddEdge(0, 1, 1.0);
180   graph.AddEdge(2, 3, 1.0);
181   VertexTotalOrdering<int> less_than(graph);
201   Graph<int> graph;
202   graph.AddVertex(0);
203   graph.AddVertex(1);
204   graph.AddVertex(2);
205   graph.AddVertex(3);
207   graph.AddEdge(0, 1);
208   graph.AddEdge(0, 2);
209   graph.AddEdge(0, 3);
210   graph.AddEdge(1, 2);
211   graph.AddEdge(1, 3);
212   graph.AddEdge(2, 3);
214   // Since this is a completely connected graph, the independent set
225         StableIndependentSetOrdering(graph, &ordering);
237         StableIndependentSetOrdering(graph, &ordering);