Home
last modified time | relevance | path

Searched refs:edgeCount (Results 1 – 25 of 346) sorted by relevance

12345678910>>...14

/dports/science/py-avogadrolibs/avogadrolibs-1.94.0/tests/core/
H A Dgraphtest.cpp107 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(0)); in TEST()
110 EXPECT_EQ(graph.edgeCount(), 1); in TEST()
114 EXPECT_EQ(graph.edgeCount(), 2); in TEST()
125 TEST(GraphTest, edgeCount) in TEST() argument
128 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(0)); in TEST()
131 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(1)); in TEST()
134 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(2)); in TEST()
137 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(3)); in TEST()
140 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(2)); in TEST()
143 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(0)); in TEST()
/dports/science/avogadrolibs/avogadrolibs-1.94.0/tests/core/
H A Dgraphtest.cpp107 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(0)); in TEST()
110 EXPECT_EQ(graph.edgeCount(), 1); in TEST()
114 EXPECT_EQ(graph.edgeCount(), 2); in TEST()
125 TEST(GraphTest, edgeCount) in TEST() argument
128 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(0)); in TEST()
131 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(1)); in TEST()
134 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(2)); in TEST()
137 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(3)); in TEST()
140 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(2)); in TEST()
143 EXPECT_EQ(graph.edgeCount(), static_cast<size_t>(0)); in TEST()
/dports/graphics/opensubdiv/OpenSubdiv-3_4_4/opensubdiv/sdc/
H A Dcrease.cpp138 Crease::SubdivideEdgeSharpnessesAroundVertex(int edgeCount, in SubdivideEdgeSharpnessesAroundVertex() argument
142 if (IsUniform() || (edgeCount < 2)) { in SubdivideEdgeSharpnessesAroundVertex()
143 for (int i = 0; i < edgeCount; ++i) { in SubdivideEdgeSharpnessesAroundVertex()
159 for (int i = 0; i < edgeCount; ++i) { in SubdivideEdgeSharpnessesAroundVertex()
170 for (int i = 0; i < edgeCount; ++i) { in SubdivideEdgeSharpnessesAroundVertex()
174 for (int i = 0; i < edgeCount; ++i) { in SubdivideEdgeSharpnessesAroundVertex()
/dports/science/rdkit/rdkit-Release_2021_03_5/External/RingFamilies/RingDecomposerLib/src/Test/
H A DTestDemo.c28 unsigned URFcount, idx, count, obIdx, edgeCount; in RDL_demo_output() local
101 edgeCount = RDL_getEdgeArray(URFdata, &bondArray); in RDL_demo_output()
103 for(idx=0; idx<edgeCount; ++idx) in RDL_demo_output()
108 for(idx=0; idx<edgeCount; ++idx) in RDL_demo_output()
118 for(obIdx=0; obIdx<edgeCount; ++obIdx) in RDL_demo_output()
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/NonEmpty/
H A DGraph.hs129 edgeCount (vertex x) == 0
142 edgeCount (edge x y) == 1
161 edgeCount (overlay x y) >= edgeCount x
164 edgeCount (overlay x y) <= edgeCount x + edgeCount y
173 edgeCount (overlay 1 2 :: G) == 0
194 edgeCount (connect x y) >= edgeCount x
197 edgeCount (connect x y) >= edgeCount y
203 edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
343 edgeCount (vertex x) == 0
346 edgeCount (edge x y) == 1
[all …]
H A DAdjacencyMap.hs134 edgeCount (vertex x) == 0
144 edgeCount (edge x y) == 1
163 edgeCount (overlay x y) >= edgeCount x
166 edgeCount (overlay x y) <= edgeCount x + edgeCount y
172 edgeCount (overlay 1 2 :: G) == 0
185 edgeCount (connect x y) >= edgeCount x
188 edgeCount (connect x y) >= edgeCount y
194 edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
200 edgeCount (connect 1 2 :: G) == 1
289 edgeCount (vertex x) == 0
[all …]
/dports/graphics/processing/processing-1.5.1/modes/java/examples/Books/Visualizing Data/ch08-graphlayout/step_06c_variable_size_nodes/
H A Dstep_06c_variable_size_nodes.pde9 int edgeCount;
23 println(edgeCount);
64 for (int i = 0; i < edgeCount; i++) {
73 if (edgeCount == edges.length) {
76 edges[edgeCount++] = e;
120 for (int i = 0 ; i < edgeCount ; i++) {
129 for (int i = 0 ; i < edgeCount ; i++) {
/dports/graphics/processing/processing-1.5.1/modes/java/examples/Books/Visualizing Data/ch08-graphlayout/step_07c_save_pdf/
H A Dstep_07c_save_pdf.pde9 int edgeCount;
23 println(edgeCount);
62 for (int i = 0; i < edgeCount; i++) {
71 if (edgeCount == edges.length) {
74 edges[edgeCount++] = e;
120 for (int i = 0 ; i < edgeCount ; i++) {
129 for (int i = 0 ; i < edgeCount ; i++) {
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/
H A DToGraph.hs137 edgeCount :: Ord (ToVertex t) => t -> Int
138 edgeCount = AM.edgeCount . toAdjacencyMap function
349 edgeCount = AM.edgeCount function
381 edgeCount = AIM.edgeCount function
425 edgeCount = LAM.edgeCount function
447 edgeCount = NAM.edgeCount function
479 edgeCount = R.edgeCount function
502 edgeCount = SR.edgeCount function
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/Relation/
H A DSymmetricRelation.hs54 ((*2) . edgeCount . toSymmetric) x >= R.edgeCount x
64 (R.edgeCount . fromSymmetric) x <= ((*2) . edgeCount) x
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/rpo/
H A Drpo.c132 int Rpo_computeMinEdgeCost(Rpo_LCI_Edge_t** edges, int edgeCount, int* vertexDegree) { in Rpo_computeMinEdgeCost() argument
140 for (i = 0; i < edgeCount; ++i) { in Rpo_computeMinEdgeCost()
235 int edgeCount = 0; in Rpo_Recursion() local
311 edges[edgeCount++] = edge; in Rpo_Recursion()
323 edges[edgeCount++] = edge; in Rpo_Recursion()
328 Abc_Print(-2, "%d edges created.\n", edgeCount); in Rpo_Recursion()
334 edgeIndex = Rpo_computeMinEdgeCost(edges, edgeCount, vertexDegree); in Rpo_Recursion()
375 for (i = 0; i < edgeCount; ++i) { in Rpo_Recursion()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BASE/
H A DUndiGraphTestSuite.h171 gum::Size edgeCount = graph.sizeEdges(); in testAddDelNodes_2() local
176 TS_ASSERT_EQUALS(edgeCount, graph.sizeEdges() + 2) in testAddDelNodes_2()
188 gum::Size edgeCount = graph.sizeEdges(); in testRemoveNodesFunky_1() local
191 TS_ASSERT_EQUALS(edgeCount, (gum::Size)6) in testRemoveNodesFunky_1()
199 TS_ASSERT_EQUALS(edgeCount, graph.sizeEdges() + 3) in testRemoveNodesFunky_1()
214 gum::Size edgeCount = graph.sizeEdges(); in testAddDelEdges_1() local
219 TS_ASSERT_EQUALS(edgeCount, graph.sizeEdges() + 1) in testAddDelEdges_1()
232 gum::Size edgeCount = graph.sizeEdges(); in testAddDelEdges_2() local
237 TS_ASSERT_EQUALS(edgeCount, graph.sizeEdges() + 1) in testAddDelEdges_2()
262 gum::Size edgeCount = graph.sizeEdges(); in testGetEdges()
[all …]
H A DMixedGraphTestSuite.h227 gum::Size edgeCount = graph.sizeEdges(); in testAddDelNodes_2() local
233 TS_ASSERT_EQUALS(edgeCount, graph.sizeEdges() + 1) in testAddDelNodes_2()
246 gum::Size edgeCount = graph.sizeEdges(); in testRemoveNodesFunky_1() local
250 TS_ASSERT_EQUALS(edgeCount, (gum::Size)3) in testRemoveNodesFunky_1()
259 TS_ASSERT_EQUALS(edgeCount, graph.sizeEdges() + 1) in testRemoveNodesFunky_1()
275 gum::Size edgeCount = graph.sizeEdges(); in testAddDelEdges_1() local
280 TS_ASSERT_EQUALS(edgeCount, graph.sizeEdges() + 1) in testAddDelEdges_1()
293 gum::Size edgeCount = graph.sizeEdges(); in testAddDelEdges_2() local
298 TS_ASSERT_EQUALS(edgeCount, graph.sizeEdges() + 1) in testAddDelEdges_2()
356 gum::Size edgeCount = graph.sizeEdges(); in testGetEdges()
[all …]
/dports/graphics/processing/processing-1.5.1/modes/java/examples/Books/Visualizing Data/ch08-graphlayout/step_08c_graphviz/
H A Dstep_08c_graphviz.pde9 int edgeCount;
31 for (int i = 0; i < edgeCount; i++) {
76 for (int i = 0; i < edgeCount; i++) {
85 if (edgeCount == edges.length) {
88 edges[edgeCount++] = e;
134 for (int i = 0 ; i < edgeCount ; i++) {
143 for (int i = 0 ; i < edgeCount ; i++) {
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/
H A DUndirected.hs52 ((*2) . edgeCount . toUndirected) x >= G.edgeCount x
65 (G.edgeCount . fromUndirected) x <= ((*2) . edgeCount) x
/dports/math/latte-integrale/latte-version_1_7_6/code/latte/buildPolytopes/
H A DGraphMaker.cpp310 void GraphMaker::makeRandomDisconnectedGraph(const int size, const int edgeCount) in makeRandomDisconnectedGraph() argument
331 edgeG1 = (int)((edgeCount + 1 )/2); //round up. in makeRandomDisconnectedGraph()
332 edgeG2 = edgeCount / 2; in makeRandomDisconnectedGraph()
370 void GraphMaker::makeRandomConnectedGraph(const int size, const int edgeCount) in makeRandomConnectedGraph() argument
374 if ( size <= 2 || size > edgeCount+1 || edgeCount > size*(size -1)/2) in makeRandomConnectedGraph()
393 while ( currentEdgeCount < edgeCount) in makeRandomConnectedGraph()
/dports/www/firefox-esr/firefox-91.8.0/netwerk/streamconv/
H A DnsStreamConverterService.cpp229 int32_t edgeCount = data2->Length(); in FindConverter() local
231 for (int32_t i = 0; i < edgeCount; i++) { in FindConverter()
402 int32_t edgeCount = int32_t(converterChain->Length()); in Convert() local
403 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in Convert()
410 for (int32_t i = edgeCount - 1; i >= 0; i--) { in Convert()
490 int32_t edgeCount = int32_t(converterChain->Length()); in AsyncConvertData() local
491 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in AsyncConvertData()
492 for (int i = 0; i < edgeCount; i++) { in AsyncConvertData()
/dports/www/firefox/firefox-99.0/netwerk/streamconv/
H A DnsStreamConverterService.cpp229 int32_t edgeCount = data2->Length(); in FindConverter() local
231 for (int32_t i = 0; i < edgeCount; i++) { in FindConverter()
402 int32_t edgeCount = int32_t(converterChain->Length()); in Convert() local
403 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in Convert()
410 for (int32_t i = edgeCount - 1; i >= 0; i--) { in Convert()
490 int32_t edgeCount = int32_t(converterChain->Length()); in AsyncConvertData() local
491 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in AsyncConvertData()
492 for (int i = 0; i < edgeCount; i++) { in AsyncConvertData()
/dports/lang/spidermonkey60/firefox-60.9.0/netwerk/streamconv/
H A DnsStreamConverterService.cpp238 int32_t edgeCount = data2->Length(); in FindConverter() local
240 for (int32_t i = 0; i < edgeCount; i++) { in FindConverter()
390 int32_t edgeCount = int32_t(converterChain->Length()); in Convert() local
391 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in Convert()
398 for (int32_t i = edgeCount - 1; i >= 0; i--) { in Convert()
477 int32_t edgeCount = int32_t(converterChain->Length()); in AsyncConvertData() local
478 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in AsyncConvertData()
479 for (int i = 0; i < edgeCount; i++) { in AsyncConvertData()
/dports/www/firefox-legacy/firefox-52.8.0esr/netwerk/streamconv/
H A DnsStreamConverterService.cpp257 int32_t edgeCount = data2->Count(); in FindConverter() local
259 for (int32_t i = 0; i < edgeCount; i++) { in FindConverter()
412 int32_t edgeCount = int32_t(converterChain->Length()); in Convert() local
413 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in Convert()
421 for (int32_t i = edgeCount-1; i >= 0; i--) { in Convert()
499 int32_t edgeCount = int32_t(converterChain->Length()); in AsyncConvertData() local
500 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in AsyncConvertData()
501 for (int i = 0; i < edgeCount; i++) { in AsyncConvertData()
/dports/mail/thunderbird/thunderbird-91.8.0/netwerk/streamconv/
H A DnsStreamConverterService.cpp229 int32_t edgeCount = data2->Length(); in FindConverter() local
231 for (int32_t i = 0; i < edgeCount; i++) { in FindConverter()
402 int32_t edgeCount = int32_t(converterChain->Length()); in Convert() local
403 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in Convert()
410 for (int32_t i = edgeCount - 1; i >= 0; i--) { in Convert()
490 int32_t edgeCount = int32_t(converterChain->Length()); in AsyncConvertData() local
491 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in AsyncConvertData()
492 for (int i = 0; i < edgeCount; i++) { in AsyncConvertData()
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/Bipartite/Undirected/
H A DAdjacencyMap.hs68 edgeCount :: BAII -> Int
69 edgeCount = B.edgeCount function
261 edgeCount (overlay x y) >= edgeCount x
263 edgeCount (overlay x y) <= edgeCount x + edgeCount y
285 edgeCount (connect x y) >= edgeCount x
289 …edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVer…
313 (edgeCount . edges) es == (length . nubOrd) es
481 edgeCount empty == 0
483 edgeCount (vertex x) == 0
485 edgeCount (edge x y) == 1
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/netwerk/streamconv/
H A DnsStreamConverterService.cpp239 int32_t edgeCount = data2->Length(); in FindConverter() local
241 for (int32_t i = 0; i < edgeCount; i++) { in FindConverter()
411 int32_t edgeCount = int32_t(converterChain->Length()); in Convert() local
412 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in Convert()
419 for (int32_t i = edgeCount - 1; i >= 0; i--) { in Convert()
498 int32_t edgeCount = int32_t(converterChain->Length()); in AsyncConvertData() local
499 NS_ASSERTION(edgeCount > 0, "findConverter should have failed"); in AsyncConvertData()
500 for (int i = 0; i < edgeCount; i++) { in AsyncConvertData()
/dports/databases/pg_citus/citus-10.2.3/src/backend/distributed/transaction/
H A Ddistributed_deadlock_detection.c125 int edgeCount = waitGraph->edgeCount; in CheckForDistributedDeadlocks() local
140 int maxStackDepth = edgeCount + 1; in CheckForDistributedDeadlocks()
446 int edgeCount = waitGraph->edgeCount; in BuildAdjacencyListsForWaitGraph() local
459 for (int edgeIndex = 0; edgeIndex < edgeCount; edgeIndex++) in BuildAdjacencyListsForWaitGraph()
/dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2-ui/interface/
H A DLandTool.cpp111 uint32_t edgeCount = itemIndex; in ShowEdgeStyleDropdown() local
112 auto itemsPerRow = DropdownGetAppropriateImageDropdownItemsPerRow(edgeCount); in ShowEdgeStyleDropdown()
115 … widget->left, w->windowPos.y + widget->top, widget->height(), w->colours[2], 0, edgeCount, 47, 36, in ShowEdgeStyleDropdown()

12345678910>>...14