Home
last modified time | relevance | path

Searched refs:tVertex (Results 1 – 25 of 29) sorted by relevance

12

/dports/devel/indi/indi-1.9.1/libs/indibase/alignment/
H A DConvexHull.h119 typedef tsVertex *tVertex; typedef
134 tVertex next, prev;
140 tVertex endpts[2];
151 tVertex vertex[3];
164 tVertex vertices;
174 bool AddOne(tVertex p);
207 void CleanUp(tVertex *pvnext);
220 bool Collinear(tVertex a, tVertex b, tVertex c);
279 tFace MakeFace(tVertex v0, tVertex v1, tVertex v2, tFace f);
298 tVertex MakeNullVertex();
[all …]
H A DConvexHull.cpp106 tVertex v; in CheckEndpts()
159 tVertex v; in Checks()
265 tVertex v, t; in CleanVertices()
310 bool ConvexHull::Collinear(tVertex a, tVertex b, tVertex c) in Collinear()
376 tVertex v; in Convexity()
570 ConvexHull::tFace ConvexHull::MakeFace(tVertex v0, tVertex v1, tVertex v2, tFace fold) in MakeFace()
612 tVertex v; in MakeNewVertex()
655 tVertex v; in MakeNullVertex()
669 tVertex v; in Print()
826 tVertex v; in PrintObj()
[all …]
/dports/databases/grass7/grass-7.8.6/vector/v.hull/
H A Dchull.c54 tVertex next, prev;
60 tVertex endpts[2];
69 tVertex vertex[3];
97 tFace MakeFace(tVertex v0, tVertex v1, tVertex v2, tFace f);
102 bool Collinear(tVertex a, tVertex b, tVertex c);
116 tVertex v; in freeMem()
185 tVertex v; in MakeNullVertex()
204 tVertex v; in ReadVertices()
625 tFace MakeFace(tVertex v0, tVertex v1, tVertex v2, tFace fold) in MakeFace()
749 tVertex v, t; in CleanVertices()
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp174 typedef Node<tTraits::edge_descriptor> tVertex; in test_bundled_properties() typedef
186 get(&tVertex::vertex_color, g), in test_bundled_properties()
246 typedef typename graph_traits<Graph>::vertex_descriptor tVertex; typedef in boykov_kolmogorov_test
267 void invariant_four(tVertex v) const{ in invariant_four()
288 void invariant_five(const tVertex& v) const{ in invariant_five()
292 void invariant_six(const tVertex& v) const{ in invariant_six()
296 tVertex current_node = v; in invariant_six()
312 void invariant_seven(const tVertex& v) const{ in invariant_seven()
318 tVertex current_node = v; in invariant_seven()
327 void invariant_eight(const tVertex& v) const{ in invariant_eight()
[all …]
H A Dmax_flow_test.cpp74 typedef graph_traits<Graph>::vertex_descriptor tVertex; in test_main() typedef
100 tVertex source_vertex = random_vertex(g, gen); in test_main()
101 tVertex sink_vertex = graph_traits<Graph>::null_vertex(); in test_main()
115 tVertex source_vertex = target(old_edge, g); in test_main()
116 tVertex target_vertex = source(old_edge, g); in test_main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp174 typedef Node<tTraits::edge_descriptor> tVertex; in test_bundled_properties() typedef
186 get(&tVertex::vertex_color, g), in test_bundled_properties()
246 typedef typename graph_traits<Graph>::vertex_descriptor tVertex; typedef in boykov_kolmogorov_test
267 void invariant_four(tVertex v) const{ in invariant_four()
288 void invariant_five(const tVertex& v) const{ in invariant_five()
292 void invariant_six(const tVertex& v) const{ in invariant_six()
296 tVertex current_node = v; in invariant_six()
312 void invariant_seven(const tVertex& v) const{ in invariant_seven()
318 tVertex current_node = v; in invariant_seven()
327 void invariant_eight(const tVertex& v) const{ in invariant_eight()
[all …]
H A Dmax_flow_test.cpp74 typedef graph_traits<Graph>::vertex_descriptor tVertex; in test_main() typedef
100 tVertex source_vertex = random_vertex(g, gen); in test_main()
101 tVertex sink_vertex = graph_traits<Graph>::null_vertex(); in test_main()
115 tVertex source_vertex = target(old_edge, g); in test_main()
116 tVertex target_vertex = source(old_edge, g); in test_main()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp174 typedef Node<tTraits::edge_descriptor> tVertex; in test_bundled_properties() typedef
186 get(&tVertex::vertex_color, g), in test_bundled_properties()
246 typedef typename graph_traits<Graph>::vertex_descriptor tVertex; typedef in boykov_kolmogorov_test
267 void invariant_four(tVertex v) const{ in invariant_four()
288 void invariant_five(const tVertex& v) const{ in invariant_five()
292 void invariant_six(const tVertex& v) const{ in invariant_six()
296 tVertex current_node = v; in invariant_six()
312 void invariant_seven(const tVertex& v) const{ in invariant_seven()
318 tVertex current_node = v; in invariant_seven()
327 void invariant_eight(const tVertex& v) const{ in invariant_eight()
[all …]
H A Dmax_flow_test.cpp74 typedef graph_traits<Graph>::vertex_descriptor tVertex; in test_main() typedef
100 tVertex source_vertex = random_vertex(g, gen); in test_main()
101 tVertex sink_vertex = graph_traits<Graph>::null_vertex(); in test_main()
115 tVertex source_vertex = target(old_edge, g); in test_main()
116 tVertex target_vertex = source(old_edge, g); in test_main()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp174 typedef Node<tTraits::edge_descriptor> tVertex; in test_bundled_properties() typedef
186 get(&tVertex::vertex_color, g), in test_bundled_properties()
246 typedef typename graph_traits<Graph>::vertex_descriptor tVertex; typedef in boykov_kolmogorov_test
267 void invariant_four(tVertex v) const{ in invariant_four()
288 void invariant_five(const tVertex& v) const{ in invariant_five()
292 void invariant_six(const tVertex& v) const{ in invariant_six()
296 tVertex current_node = v; in invariant_six()
312 void invariant_seven(const tVertex& v) const{ in invariant_seven()
318 tVertex current_node = v; in invariant_seven()
327 void invariant_eight(const tVertex& v) const{ in invariant_eight()
[all …]
H A Dmax_flow_test.cpp74 typedef graph_traits<Graph>::vertex_descriptor tVertex; in test_main() typedef
100 tVertex source_vertex = random_vertex(g, gen); in test_main()
101 tVertex sink_vertex = graph_traits<Graph>::null_vertex(); in test_main()
115 tVertex source_vertex = target(old_edge, g); in test_main()
116 tVertex target_vertex = source(old_edge, g); in test_main()
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp174 typedef Node<tTraits::edge_descriptor> tVertex; in test_bundled_properties() typedef
186 get(&tVertex::vertex_color, g), in test_bundled_properties()
246 typedef typename graph_traits<Graph>::vertex_descriptor tVertex; typedef in boykov_kolmogorov_test
267 void invariant_four(tVertex v) const{ in invariant_four()
288 void invariant_five(const tVertex& v) const{ in invariant_five()
292 void invariant_six(const tVertex& v) const{ in invariant_six()
296 tVertex current_node = v; in invariant_six()
312 void invariant_seven(const tVertex& v) const{ in invariant_seven()
318 tVertex current_node = v; in invariant_seven()
327 void invariant_eight(const tVertex& v) const{ in invariant_eight()
[all …]
H A Dmax_flow_test.cpp74 typedef graph_traits<Graph>::vertex_descriptor tVertex; in test_main() typedef
100 tVertex source_vertex = random_vertex(g, gen); in test_main()
101 tVertex sink_vertex = graph_traits<Graph>::null_vertex(); in test_main()
115 tVertex source_vertex = target(old_edge, g); in test_main()
116 tVertex target_vertex = source(old_edge, g); in test_main()
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp174 typedef Node<tTraits::edge_descriptor> tVertex; in test_bundled_properties() typedef
186 get(&tVertex::vertex_color, g), in test_bundled_properties()
246 typedef typename graph_traits<Graph>::vertex_descriptor tVertex; typedef in boykov_kolmogorov_test
267 void invariant_four(tVertex v) const{ in invariant_four()
288 void invariant_five(const tVertex& v) const{ in invariant_five()
292 void invariant_six(const tVertex& v) const{ in invariant_six()
296 tVertex current_node = v; in invariant_six()
312 void invariant_seven(const tVertex& v) const{ in invariant_seven()
318 tVertex current_node = v; in invariant_seven()
327 void invariant_eight(const tVertex& v) const{ in invariant_eight()
[all …]
H A Dmax_flow_test.cpp74 typedef graph_traits<Graph>::vertex_descriptor tVertex; in test_main() typedef
100 tVertex source_vertex = random_vertex(g, gen); in test_main()
101 tVertex sink_vertex = graph_traits<Graph>::null_vertex(); in test_main()
115 tVertex source_vertex = target(old_edge, g); in test_main()
116 tVertex target_vertex = source(old_edge, g); in test_main()
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp174 typedef Node<tTraits::edge_descriptor> tVertex; in test_bundled_properties() typedef
186 get(&tVertex::vertex_color, g), in test_bundled_properties()
246 typedef typename graph_traits<Graph>::vertex_descriptor tVertex; typedef in boykov_kolmogorov_test
267 void invariant_four(tVertex v) const{ in invariant_four()
288 void invariant_five(const tVertex& v) const{ in invariant_five()
292 void invariant_six(const tVertex& v) const{ in invariant_six()
296 tVertex current_node = v; in invariant_six()
312 void invariant_seven(const tVertex& v) const{ in invariant_seven()
318 tVertex current_node = v; in invariant_seven()
327 void invariant_eight(const tVertex& v) const{ in invariant_eight()
[all …]
H A Dmax_flow_test.cpp74 typedef graph_traits<Graph>::vertex_descriptor tVertex; in test_main() typedef
100 tVertex source_vertex = random_vertex(g, gen); in test_main()
101 tVertex sink_vertex = graph_traits<Graph>::null_vertex(); in test_main()
115 tVertex source_vertex = target(old_edge, g); in test_main()
116 tVertex target_vertex = source(old_edge, g); in test_main()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp174 typedef Node<tTraits::edge_descriptor> tVertex; in test_bundled_properties() typedef
186 get(&tVertex::vertex_color, g), in test_bundled_properties()
246 typedef typename graph_traits<Graph>::vertex_descriptor tVertex; typedef in boykov_kolmogorov_test
267 void invariant_four(tVertex v) const{ in invariant_four()
288 void invariant_five(const tVertex& v) const{ in invariant_five()
292 void invariant_six(const tVertex& v) const{ in invariant_six()
296 tVertex current_node = v; in invariant_six()
312 void invariant_seven(const tVertex& v) const{ in invariant_seven()
318 tVertex current_node = v; in invariant_seven()
327 void invariant_eight(const tVertex& v) const{ in invariant_eight()
[all …]
H A Dmax_flow_test.cpp74 typedef graph_traits<Graph>::vertex_descriptor tVertex; in test_main() typedef
100 tVertex source_vertex = random_vertex(g, gen); in test_main()
101 tVertex sink_vertex = graph_traits<Graph>::null_vertex(); in test_main()
115 tVertex source_vertex = target(old_edge, g); in test_main()
116 tVertex target_vertex = source(old_edge, g); in test_main()
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/
H A Dboykov_kolmogorov_max_flow_test.cpp180 typedef Node< tTraits::edge_descriptor > tVertex; in test_bundled_properties() typedef
193 get(&tVertex::vertex_predecessor, g), get(&tVertex::vertex_color, g), in test_bundled_properties()
265 void invariant_four(tVertex v) const in invariant_four()
270 typename std::list< tVertex >::const_iterator it in invariant_four()
296 void invariant_five(const tVertex& v) const in invariant_five()
302 void invariant_six(const tVertex& v) const in invariant_six()
309 tVertex current_node = v; in invariant_six()
330 void invariant_seven(const tVertex& v) const in invariant_seven()
338 tVertex current_node = v; in invariant_seven()
350 void invariant_eight(const tVertex& v) const in invariant_eight()
[all …]
H A Dmax_flow_test.cpp76 typedef graph_traits< Graph >::vertex_descriptor tVertex; in main() typedef
105 tVertex source_vertex = random_vertex(g, gen); in main()
106 tVertex sink_vertex = graph_traits< Graph >::null_vertex(); in main()
123 tVertex source_vertex = target(old_edge, g); in main()
124 tVertex target_vertex = source(old_edge, g); in main()
/dports/math/ogdf/OGDF/src/ogdf/cluster/
H A DHananiTutteCPlanarity.cpp257 OGDF_ASSERT(obj.m_t == Type::tVertex); in numeomove()
527 obj2 = CLinearSystem::Object(Type::tVertex, st, c, eo->m_e); in ends()
543 obj2 = CLinearSystem::Object(Type::tVertex, st, c2, eo->m_e); in ends()
582 bool isClusterVertex = obj11.m_t == Type::tVertex in cAdjacent()
653 OGDF_ASSERT(vo1.m_t == Type::tVertex); in before()
654 OGDF_ASSERT(vo2.m_t == Type::tVertex); in before()
754 if (obj.m_t == Type::tVertex) { in affect()
791 if (obj.m_t == Type::tVertex) { in affect()
800 if (obj.m_t != Type::tVertex) return; in affect()
852 m_ls.numOx(CLinearSystem::Object(Type::tVertex, SubType::stInnerCluster, c, e)); in prepareLinearSystem()
[all …]
/dports/math/latte-integrale/latte-version_1_7_6/code/latte/top-knapsack/
H A DTopKnapsack.h128 void findVertex(vec_ZZ & tVertex, const ZZ &f, const vector<ZZ> &fnDivAlpha) const;
130 …void findResidue(GeneralMonomialSum<PeriodicFunction, int> & fSeries, const vec_ZZ & tVertex, cons…
H A DTopKnapsack.cpp414 vec_ZZ tVertex; in E() local
415 tVertex.SetLength(fnDivAlpha.size()); in E()
416 findVertex(tVertex, f, fnDivAlpha); in E()
430 …findResidue(*(gcds.unweightedSeries[fIndex]), tVertex, uniCones, latticeBasis, invLatticeBasis, in… in E()
645 void TopKnapsack::findVertex(vec_ZZ & tVertex, const ZZ &f, const vector<ZZ> &fnDivAlpha) const in findVertex() argument
665 tVertex[i]= u[i]; in findVertex()
/dports/math/vtk6/VTK-6.2.0/Infovis/Parallel/
H A DvtkPBGLRandomGraphSource.cxx284 vtkIdType tVertex in RequestData() local
291 dirBuilder->LazyAddEdge(sVertex, tVertex); in RequestData()
295 undirBuilder->LazyAddEdge(sVertex, tVertex); in RequestData()

12