| /dports/math/py-apgl/apgl-0.8.1/apgl/generator/test/ |
| H A D | ErdoRenyiGeneratorTest.py | 35 self.assertEquals(graph.getNumEdges(), 0)
42 self.assertEquals(graph.getNumEdges(), 0)
50 … self.assertEquals(graph.getNumEdges(), (self.numVertices*self.numVertices-self.numVertices)/2)
58 self.assertEquals(graph.getNumEdges(), self.numVertices*self.numVertices-self.numVertices)
73 … self.assertAlmostEquals(graph.getNumEdges()/float(numVertices**2 - numVertices), p, places=2)
80 … self.assertAlmostEquals(graph.getNumEdges()/float(numVertices**2 - numVertices), p, places=2)
92 numEdges = graph.getNumEdges()
95 self.assertTrue(graph.getNumEdges() > numEdges)
118 logging.debug((graph.getNumEdges()))
135 self.assertTrue((graph.getNumEdges() - p*numVertices*numVertices/2) < 8)
|
| H A D | BarabasiAlbertGeneratorTest.py | 21 self.assertEquals(graph.getNumEdges(), 0)
27 self.assertEquals(graph.getNumEdges(), 0)
36 self.assertEquals(graph.getNumEdges(), (numVertices-ell)*m)
42 self.assertEquals(graph.getNumEdges(), (numVertices-ell)*m)
|
| H A D | SmallWorldGeneratorTest.py | 32 self.assertEquals(sGraph.getNumEdges(), sGraph.getNumVertices())
44 self.assertEquals(sGraph.getNumEdges(), sGraph.getNumVertices()*k)
56 self.assertEquals(sGraph.getNumEdges(), sGraph.getNumVertices())
64 self.assertEquals(sGraph.getNumEdges(), sGraph.getNumVertices()*k)
|
| /dports/graphics/blender/blender-2.91.0/intern/opensubdiv/internal/topology/ |
| H A D | mesh_topology_compare.cc | 39 if (converter->getNumEdges == nullptr) { in getEffectiveNumEdges()
43 return converter->getNumEdges(converter); in getEffectiveNumEdges()
55 if (getEffectiveNumEdges(converter) != mesh_topology.getNumEdges()) { in isEqualGeometryCounters()
70 if (num_requested_edges != mesh_topology.getNumEdges()) { in isEqualGeometryEdge()
176 const int num_edges = mesh_topology.getNumEdges(); in isEqualEdgeTags()
|
| H A D | mesh_topology.cc | 85 int MeshTopology::getNumEdges() const in getNumEdges() function in blender::opensubdiv::MeshTopology
93 assert(edge_index < getNumEdges()); in setEdgeVertexIndices()
111 assert(edge_index < getNumEdges()); in getEdgeVertexIndices()
127 assert(edge_index < getNumEdges()); in isEdgeEqual()
140 assert(edge_index < getNumEdges()); in setEdgeSharpness()
|
| H A D | topology_refiner_factory.cc | 77 if (converter->getNumEdges != nullptr) { in resizeComponentTopology()
78 const int num_edges = converter->getNumEdges(converter); in resizeComponentTopology()
102 const int num_edges = converter->getNumEdges(converter); in resizeComponentTopology()
171 const int num_edges = converter->getNumEdges(converter); in assignComponentTopology()
205 const int num_edges = converter->getNumEdges(converter); in assignComponentTags()
|
| H A D | topology_refiner_capi.cc | 59 int getNumEdges(const OpenSubdiv_TopologyRefiner *topology_refiner) in getNumEdges() function
206 topology_refiner->getNumEdges = getNumEdges; in assignFunctionPointers()
|
| /dports/math/py-apgl/apgl-0.8.1/apgl/graph/test/ |
| H A D | SparseMultiGraphTest.py | 75 self.assertEquals(sMultiGraph.getNumEdges(), 0)
78 self.assertEquals(sMultiGraph.getNumEdges(i), 0)
83 self.assertEquals(sMultiGraph.getNumEdges(), 2)
84 self.assertEquals(sMultiGraph.getNumEdges(1), 1)
85 self.assertEquals(sMultiGraph.getNumEdges(2), 1)
89 self.assertEquals(sMultiGraph.getNumEdges(), 4)
90 self.assertEquals(sMultiGraph.getNumEdges(0), 2)
|
| H A D | DictGraphTest.py | 96 self.assertEquals(dictGraph.getNumEdges(), 0)
101 self.assertEquals(dictGraph.getNumEdges(), 3)
104 self.assertEquals(dictGraph.getNumEdges(), 3)
107 self.assertEquals(dictGraph.getNumEdges(), 4)
110 self.assertEquals(dictGraph.getNumEdges(), 5)
114 self.assertEquals(dictGraph.getNumEdges(), 0)
119 self.assertEquals(dictGraph.getNumEdges(), 3)
410 self.assertEquals(graph.getNumEdges(), 3)
426 self.assertEquals(graph.getNumEdges(), 4)
451 self.assertEquals(graph.getNumEdges(), 5)
[all …]
|
| H A D | MatrixGraphTest.py | 63 self.assertEquals(graph.getNumEdges(), 2)
68 self.assertEquals(graph.getNumEdges(), 2)
508 self.assertEquals(graph.getNumEdges(), 1)
513 self.assertEquals(graph.getNumEdges(), 2)
516 self.assertEquals(graph.getNumEdges(), 3)
520 self.assertEquals(graph.getNumEdges(), 4)
526 self.assertEquals(graph.getNumEdges(), 1)
531 self.assertEquals(graph.getNumEdges(), 2)
1515 self.assertEquals(graph.getNumEdges(), graph2.getNumEdges())
1539 self.assertEquals(graph.getNumEdges(), graph2.getNumEdges())
[all …]
|
| H A D | CsArrayGraphTest.py | 41 self.assertEquals(graph.getNumEdges(), 1)
49 self.assertEquals(graph.getNumEdges(), 2)
|
| H A D | DictTreeTest.py | 108 self.assertEquals(newTree.getNumEdges(), dictTree.getNumEdges())
114 self.assertEquals(newTree.getNumEdges(), 2)
118 self.assertEquals(newTree.getNumEdges(), 0)
|
| /dports/math/polymake/polymake-4.5/apps/graph/cpperl/ |
| H A D | auto-getNumEdges.cpperl | 3 …EdgeList&>"], "func": "getNumEdges", "include": ["polymake/graph/DoublyConnectedEdgeList.h"], "kin…
|
| /dports/graphics/opensubdiv/OpenSubdiv-3_4_4/opensubdiv/vtr/ |
| H A D | triRefinement.cpp | 77 int edgeChildVertCount = _parent->getNumEdges(); in allocateParentChildIndices()
282 _child->_edgeVertIndices.resize(_child->getNumEdges() * 2); in populateEdgeVertexRelation()
327 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateEdgeVerticesFromParentEdges()
366 _child->_edgeFaceCountsAndOffsets.resize(_child->getNumEdges() * 2); in populateEdgeFaceRelation()
380 childEdgeFaceIndexSizeEstimate = _child->getNumEdgeFaces(_child->getNumEdges()-1) + in populateEdgeFaceRelation()
381 _child->getOffsetOfEdgeFaces(_child->getNumEdges()-1); in populateEdgeFaceRelation()
429 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateEdgeFacesFromParentEdges()
541 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateVertexFacesFromParentEdges()
675 …dVertEdgeIndexSizeEstimate = (int)_parent->_edgeFaceIndices.size() * 2 + _parent->getNumEdges() * 2 in populateVertexEdgeRelation()
701 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateVertexEdgesFromParentEdges()
|
| H A D | quadRefinement.cpp | 69 int edgeChildVertCount = _parent->getNumEdges(); in allocateParentChildIndices()
281 _child->_edgeVertIndices.resize(_child->getNumEdges() * 2); in populateEdgeVertexRelation()
321 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateEdgeVerticesFromParentEdges()
370 _child->_edgeFaceCountsAndOffsets.resize(_child->getNumEdges() * 2); in populateEdgeFaceRelation()
384 childEdgeFaceIndexSizeEstimate = _child->getNumEdgeFaces(_child->getNumEdges()-1) + in populateEdgeFaceRelation()
385 _child->getOffsetOfEdgeFaces(_child->getNumEdges()-1); in populateEdgeFaceRelation()
452 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateEdgeFacesFromParentEdges()
598 for (int pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateVertexFacesFromParentEdges()
722 … + (int)_parent->_edgeFaceIndices.size() + _parent->getNumEdges() * 2 in populateVertexEdgeRelation()
798 for (int pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateVertexEdgesFromParentEdges()
|
| H A D | refinement.cpp | 94 _parentEdgeTag.resize(_parent->getNumEdges()); in initializeSparseSelectionTags()
329 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in printParentToChildMapping()
432 _childEdgeTag.resize(_child->getNumEdges()); in populateEdgeParentVectors()
433 _childEdgeParentIndex.resize(_child->getNumEdges()); in populateEdgeParentVectors()
497 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge, cEdge += 2) { in populateEdgeParentFromParentEdges()
505 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateEdgeParentFromParentEdges()
573 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge, ++cVert) { in populateVertexParentFromParentEdges()
581 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateVertexParentFromParentEdges()
654 _child->_edgeTags.resize(_child->getNumEdges()); in populateEdgeTagVectors()
745 for (Index pEdge = 0; pEdge < _parent->getNumEdges(); ++pEdge) { in populateVertexTagsFromParentEdges()
[all …]
|
| /dports/math/py-apgl/apgl-0.8.1/apgl/graph/ |
| H A D | SparseMultiGraph.py | 46 def getNumEdges(self, edgeTypeIndex=-1): member in SparseMultiGraph
56 numEdges = numEdges + self.sparseGraphs[i].getNumEdges()
58 numEdges = self.sparseGraphs[edgeTypeIndex].getNumEdges()
|
| H A D | AbstractGraph.py | 23 m = self.getNumEdges()
32 def getNumEdges(self):
|
| H A D | GraphUtils.py | 44 numEdges = graph.getNumEdges()
49 logging.info("Done with " + str(cGraph.getNumEdges()) + " edges.")
50 perm = numpy.random.permutation(cGraph.getNumEdges())[0:numEdges]
|
| /dports/math/polymake/polymake-4.5/apps/topaz/src/ |
| H A D | a_coordinates.cc | 58 auto outs = Array<Polynomial<Rational, Int>>(dcel.getNumEdges()); in outitudePolynomials()
59 for (Int i = 0; i < dcel.getNumEdges(); ++i) { in outitudePolynomials()
169 auto outs = Array<Polynomial<Rational, Int>>(dcel.getNumEdges()); in dualOutitudePolynomials()
170 for (Int i = 0; i < dcel.getNumEdges(); i++){ in dualOutitudePolynomials()
188 Vector<Rational> out_vec(dcel.getNumEdges()); in outitudes_from_dcel()
189 for (Int i = 0; i < dcel.getNumEdges(); ++i) { in outitudes_from_dcel()
|
| /dports/games/libretro-scummvm/scummvm-7b1e929/engines/pegasus/neighborhood/caldoria/ |
| H A D | caldoriabomb.cpp | 750 VertexType getNumEdges(BombEdgeList edges) { in getNumEdges() function
784 VertexType numEdges = getNumEdges(edges); in getEdgeListSize()
816 VertexType numEdges = getNumEdges(edges); in makeHotVertexList()
839 VertexType numEdges = getNumEdges(edges); in setAllEdgesUsed()
864 VertexType numEdges = getNumEdges(edges); in setAllUsedEdgesUsed()
889 VertexType numEdges = getNumEdges(edges); in replaceUsedEdges()
923 VertexType numEdges = getNumEdges(edges); in setEdgeUsed()
982 VertexType numEdges = getNumEdges(edges); in allEdgesUsed()
1041 VertexType numEdges = getNumEdges(edges); in drawEdges()
|
| /dports/games/scummvm/scummvm-2.5.1/engines/pegasus/neighborhood/caldoria/ |
| H A D | caldoriabomb.cpp | 753 VertexType getNumEdges(BombEdgeList edges) { in getNumEdges() function
787 VertexType numEdges = getNumEdges(edges); in getEdgeListSize()
819 VertexType numEdges = getNumEdges(edges); in makeHotVertexList()
842 VertexType numEdges = getNumEdges(edges); in setAllEdgesUsed()
867 VertexType numEdges = getNumEdges(edges); in setAllUsedEdgesUsed()
892 VertexType numEdges = getNumEdges(edges); in replaceUsedEdges()
926 VertexType numEdges = getNumEdges(edges); in setEdgeUsed()
985 VertexType numEdges = getNumEdges(edges); in allEdgesUsed()
1044 VertexType numEdges = getNumEdges(edges); in drawEdges()
|
| /dports/math/py-apgl/apgl-0.8.1/apgl/generator/ |
| H A D | ErdosRenyiGenerator.py | 57 if requireEmpty and graph.getNumEdges()!= 0:
89 if requireEmpty and graph.getNumEdges()!= 0:
|
| /dports/cad/gmsh/gmsh-4.9.2-source/Post/ |
| H A D | shapeFunctions.h | 57 virtual int getNumEdges() = 0;
293 for(int i = 0; i < getNumEdges(); i++) { in maxEdgeLength()
314 inline int getNumEdges() { return 0; } in getNumEdges() function
359 inline int getNumEdges() { return 1; } in getNumEdges() function
444 inline int getNumEdges() { return 3; } in getNumEdges() function
588 inline int getNumEdges() { return 4; } in getNumEdges() function
720 inline int getNumEdges() { return 6; } in getNumEdges() function
889 inline int getNumEdges() { return 12; } in getNumEdges() function
1079 inline int getNumEdges() { return 9; } in getNumEdges() function
1244 inline int getNumEdges() { return 8; } in getNumEdges() function
|
| /dports/graphics/opensubdiv/OpenSubdiv-3_4_4/opensubdiv/far/ |
| H A D | topologyRefinerFactory.cpp | 112 int eCount = baseLevel.getNumEdges(); in prepareComponentTopologySizing()
140 bool completeMissingTopology = (baseLevel.getNumEdges() == 0); in prepareComponentTopologyAssignment()
251 for (Vtr::Index eIndex = 0; eIndex < baseLevel.getNumEdges(); ++eIndex) { in prepareComponentTagsAndSharpness()
|