| /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...] |
| 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...] |
| 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...] |
| parameter_block_ordering_test.cc | 37 #include "ceres/graph.h"
48 typedef Graph<ParameterBlock*> HessianGraph;
86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
88 const VertexSet& vertices = graph->vertices();
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]);
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]);
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]);
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]);
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
132 EXPECT_EQ(graph->vertices().size(), 0)
[all...] |
| 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,
|
| 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...] |
| visibility.cc | 39 #include "ceres/graph.h"
72 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility) {
118 Graph<int>* graph = new Graph<int>(); local
125 graph->AddVertex(i);
126 graph->AddEdge(i, i, kSelfEdgeWeight);
141 graph->AddEdge(camera1, camera2, weight);
144 VLOG(2) << "Schur complement graph time: " << (time(NULL) - start_time);
145 return graph;
[all...] |
| visibility_test.cc | 37 #include "ceres/graph.h"
106 scoped_ptr<Graph<int> > graph(CreateSchurComplementGraph(visibility));
107 EXPECT_EQ(graph->vertices().size(), visibility.size());
109 EXPECT_EQ(graph->VertexWeight(i), 1.0);
119 EXPECT_EQ(graph->EdgeWeight(i, j), edge_weight)
121 << " weight: " << graph->EdgeWeight(i, j)
182 scoped_ptr<Graph<int> > graph(CreateSchurComplementGraph(visibility));
183 EXPECT_EQ(graph->vertices().size(), visibility.size())
[all...] |
| /external/clang/test/PCH/Inputs/ |
| typo.hpp | 4 namespace graph { namespace in namespace:boost
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| Scheduler.java | 31 Scheduler(FilterGraph graph) {
32 mGraph = graph;
|
| SimpleScheduler.java | 28 public SimpleScheduler(FilterGraph graph) {
29 super(graph);
|
| RandomScheduler.java | 33 public RandomScheduler(FilterGraph graph) {
34 super(graph);
|
| RoundRobinScheduler.java | 32 public RoundRobinScheduler(FilterGraph graph) {
33 super(graph);
|
| FilterContext.java | 105 for (FilterGraph graph : mGraphs) {
106 graph.tearDown(this);
123 final void addGraph(FilterGraph graph) {
124 mGraphs.add(graph);
|
| /external/libvorbis/examples/ |
| frameview.pl | 289 my($graph)=@_;
294 my$w=$graph->{"canvas"};
304 if($graph->{"vars"}->[$i]){
306 if(!defined($graph->{"minx"})){
308 $graph->{"maxx"}=$1;
309 $graph->{"minx"}=$1;
310 $graph->{"maxy"}=$2;
311 $graph->{"miny"}=$2;
317 $rescale=1 if($1>$graph->{"maxx"});
318 $rescale=1 if($1<$graph->{"minx"})
[all...] |
| /frameworks/base/media/mca/filterfw/java/android/filterfw/ |
| GraphEnvironment.java | 35 * A GraphEnvironment provides a simple front-end to filter graph setup and execution using the
38 * 2. Perform any configuration, such as adding graph references and setting a GL environment.
39 * 3. Load a graph file using loadGraph() or add a graph using addGraph().
59 public GraphHandle(FilterGraph graph) {
60 mGraph = graph;
95 * @param reader The GraphReader to use for graph loading, or null to auto-create one.
97 * null if you will not load any graph files.
105 * Returns the used graph reader. This will create one, if a reader has not been set already.
115 * Add graph references to resolve during graph reading. The references added here are share
133 FilterGraph graph = null; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvclique.cpp | 56 CvGraph* graph;
58 int N; //graph size
92 void _MarkNodes( CvGraph* graph )
95 for( int i = 0; i < graph->total; i++ )
97 CvGraphVtx* ver = cvGetGraphVtx( graph, i );
105 void _FillAdjMatrix( CvGraph* graph, int** connected, int reverse )
108 for( int i = 0; i < graph->total; i++ )
110 for( int j = 0; j < graph->total; j++ )
114 //memset( connected[i], 0, sizeof(int)*graph->total );
115 CvGraphVtx* ver = cvGetGraphVtx( graph, i )
[all...] |
| /external/svox/pico/lib/ |
| picoklex.h | 102 /** lookup lex by graph; result(s) are in lexres, ie. the phones are
110 const picoos_uint8 *graph,
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/i686-linux/bits/ |
| ctype_base.h | 55 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/i686-linux/bits/ |
| ctype_base.h | 57 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/x86_64-linux/bits/ |
| ctype_base.h | 57 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
