Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 376) sorted by relevance

12345678910>>...16

/external/ceres-solver/internal/ceres/
Dgraph_test.cc41 Graph<int> graph; in TEST() local
42 EXPECT_EQ(graph.vertices().size(), 0); in TEST()
46 Graph<int> graph; in TEST() local
47 graph.AddVertex(0, 1.0); in TEST()
48 graph.AddVertex(1, 2.0); in TEST()
49 graph.AddEdge(0, 1, 0.5); in TEST()
51 const HashSet<int>& vertices = graph.vertices(); in TEST()
53 EXPECT_EQ(graph.VertexWeight(0), 1.0); in TEST()
54 EXPECT_EQ(graph.VertexWeight(1), 2.0); in TEST()
55 EXPECT_EQ(graph.Neighbors(0).size(), 1); in TEST()
[all …]
Dgraph_algorithms_test.cc44 Graph<int> graph; in TEST() local
45 graph.AddVertex(0); in TEST()
46 graph.AddVertex(1); in TEST()
47 graph.AddVertex(2); in TEST()
48 graph.AddVertex(3); in TEST()
49 graph.AddVertex(4); in TEST()
51 graph.AddEdge(0, 1); in TEST()
52 graph.AddEdge(1, 2); in TEST()
53 graph.AddEdge(2, 3); in TEST()
54 graph.AddEdge(3, 4); in TEST()
[all …]
Dparameter_block_ordering.cc49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeStableSchurOrdering() local
51 const HashSet<ParameterBlock*>& vertices = graph->vertices(); in ComputeStableSchurOrdering()
58 int independent_set_size = StableIndependentSetOrdering(*graph, ordering); in ComputeStableSchurOrdering()
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeSchurOrdering() local
76 int independent_set_size = IndependentSetOrdering(*graph, ordering); in ComputeSchurOrdering()
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeRecursiveIndependentSetOrdering() local
101 IndependentSetOrdering(*graph, &independent_set_ordering); in ComputeRecursiveIndependentSetOrdering()
105 graph->RemoveVertex(parameter_block); in ComputeRecursiveIndependentSetOrdering()
114 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); in CreateHessianGraph() local
119 graph->AddVertex(parameter_block); in CreateHessianGraph()
[all …]
Dgraph_algorithms.h51 explicit VertexTotalOrdering(const Graph<Vertex>& graph) in VertexTotalOrdering() argument
52 : graph_(graph) {} in VertexTotalOrdering()
68 explicit VertexDegreeLessThan(const Graph<Vertex>& graph) in VertexDegreeLessThan() argument
69 : graph_(graph) {} in VertexDegreeLessThan()
96 int IndependentSetOrdering(const Graph<Vertex>& graph, in IndependentSetOrdering() argument
98 const HashSet<Vertex>& vertices = graph.vertices(); in IndependentSetOrdering()
122 VertexTotalOrdering<Vertex>(graph)); in IndependentSetOrdering()
134 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); in IndependentSetOrdering()
172 int StableIndependentSetOrdering(const Graph<Vertex>& graph, in StableIndependentSetOrdering() argument
175 const HashSet<Vertex>& vertices = graph.vertices(); in StableIndependentSetOrdering()
[all …]
Dparameter_block_ordering_test.cc86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
88 const VertexSet& vertices = graph->vertices(); in TEST_F()
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); in TEST_F()
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); in TEST_F()
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); in TEST_F()
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]); in TEST_F()
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
132 EXPECT_EQ(graph->vertices().size(), 0); in TEST_F()
140 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
142 const VertexSet& vertices = graph->vertices(); in TEST_F()
[all …]
Dschur_ordering_test.cc86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
88 const VertexSet& vertices = graph->vertices(); in TEST_F()
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); in TEST_F()
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); in TEST_F()
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); in TEST_F()
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]); in TEST_F()
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
132 EXPECT_EQ(graph->vertices().size(), 0); in TEST_F()
140 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
142 const VertexSet& vertices = graph->vertices(); in TEST_F()
[all …]
/external/chromium_org/components/browser_context_keyed_service/
Ddependency_graph_unittest.cc16 explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) { in DummyNode() argument
32 DependencyGraph graph; in TEST_F() local
33 DummyNode node(&graph); in TEST_F()
36 EXPECT_TRUE(graph.GetConstructionOrder(&construction_order)); in TEST_F()
41 EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order)); in TEST_F()
48 DependencyGraph graph; in TEST_F() local
49 DummyNode parent(&graph); in TEST_F()
50 DummyNode child(&graph); in TEST_F()
52 graph.AddEdge(&parent, &child); in TEST_F()
55 EXPECT_TRUE(graph.GetConstructionOrder(&construction_order)); in TEST_F()
[all …]
/external/libvorbis/examples/
Dframeview.pl289 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 …]
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-GB/
Den-GB_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Den-GB_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/es-ES/
Des-ES_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Des-ES_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/it-IT/
Dit-IT_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Dit-IT_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/de-DE/
Dde-DE_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Dde-DE_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-US/
Den-US_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Den-US_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/fr-FR/
Dfr-FR_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Dfr-FR_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
Dnv50_ir_graph.cpp49 node->graph = this; in insert()
88 in(0), out(0), graph(0), in Node()
119 assert(graph || node->graph); in attach()
120 if (!node->graph) in attach()
121 graph->insert(node); in attach()
122 if (!graph) in attach()
123 node->graph->insert(this); in attach()
126 graph->classifyEdges(); in attach()
151 if (graph) { in cut()
152 if (graph->root == this) in cut()
[all …]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
Dnv50_ir_graph.cpp49 node->graph = this; in insert()
88 in(0), out(0), graph(0), in Node()
119 assert(graph || node->graph); in attach()
120 if (!node->graph) in attach()
121 graph->insert(node); in attach()
122 if (!graph) in attach()
123 node->graph->insert(this); in attach()
126 graph->classifyEdges(); in attach()
151 if (graph) { in cut()
152 if (graph->root == this) in cut()
[all …]
/external/opencv/cvaux/src/
Dcvclique.cpp92 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++ )
115 CvGraphVtx* ver = cvGetGraphVtx( graph, i );
129 void cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse, int weighted, int wei…
137 finder->vertex_weights = (float*)malloc( sizeof(float)*(graph->total+1));
138 finder->cur_weight = (float*)malloc( sizeof(float)*(graph->total+1));
[all …]
/external/chromium_org/chrome/test/functional/perf/endure_graphs/
Dendure_plotter.js85 function goTo(graph) { argument
86 params.graph = graph;
96 function goToClosure(graph) { argument
97 return function(){goTo(graph)};
208 var graph = graphList[i];
209 html += '<option id=\"r' + graph.name + '\"';
210 if (graph.name == params.graphOther)
212 html += '>' + graph.name + '</option>';
243 var is_selected = tabs[i] == params.graph;
474 Fetch(escape(params.graph) + '-summary.dat', receivedSummary);
[all …]
/external/chromium_org/v8/src/
Dhydrogen-bch.cc105 HGraph* graph() const { return graph_; } in graph() function in v8::internal::BASE_EMBEDDED
106 Counters* counters() const { return graph()->isolate()->counters(); } in counters()
120 for (int i = 0; i < graph()->blocks()->length(); i++) { in InitializeLoop()
200 explicit InductionVariableBlocksTable(HGraph* graph) in InductionVariableBlocksTable() argument
201 : graph_(graph), loop_header_(NULL), in InductionVariableBlocksTable()
202 elements_(graph->blocks()->length(), graph->zone()) { in InductionVariableBlocksTable()
203 for (int i = 0; i < graph->blocks()->length(); i++) { in InductionVariableBlocksTable()
205 element.set_block(graph->blocks()->at(i)); in InductionVariableBlocksTable()
206 elements_.Add(element, graph->zone()); in InductionVariableBlocksTable()
254 !graph()->use_optimistic_licm())) { in ProcessRelatedChecks()
[all …]

12345678910>>...16