| /dports/math/ogdf/OGDF/test/src/basic/ |
| H A D | generators.cpp | 191 for (int n = 0; n < 20; n++) { in testDeterministicGenerators() local
206 for (int n = 0; n < 20; n++) { in testDeterministicGenerators() local
219 for (int n = 1; n <= 5; n++) { in testDeterministicGenerators() local
272 for (int n = 4; n < 50; n++) { in testDeterministicGenerators() local
293 for (int n = 1; n < 50; n++) { in testDeterministicGenerators() local
329 for (int n = 3; n < 50; n++) { in testDeterministicGenerators() local
349 for (int n = 1; n < 50; n++) { in testDeterministicGenerators() local
447 for (int n = 0; n < 50; n++) { in testDeterministicGenerators() local
499 for(int n = 0; n < 100; n++) { in testRandomGenerators() local
518 for(int n = 0; n < 100; n++) { in testRandomGenerators() local
[all …]
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/XSTUFF/ |
| H A D | Xshrink.c | 56 Xnode *n; local
106 Xnode *n; local
113 void Xdumppseudograph (Xgraph *G) in Xdumppseudograph()
119 Xnode *n; local
160 Xnode *n; local
197 Xnode *n; local
206 static void destroynode (Xnode *n) in destroynode()
308 static void marknode (Xnode *n, int v) in marknode()
420 void Xrebuildcadj (Xgraph *G) in Xrebuildcadj()
426 Xnode *n; local
[all …]
|
| H A D | Xblossom.c | 273 Xnode *n; local
295 Xnode *n, *next; local
310 static void splitem (Xgraph *G, Xnode *n) in splitem()
348 static void splitedge (Xgraph *G, Xedge *e, Xnode *n) in splitedge()
421 Xnode *n; local
483 Xnode *n; local
543 static int searchtree (Xgraph *G, Xcplane **cplanelist, Xcuttree_node *n, in searchtree()
609 Xnode *n; local
645 Xnode *n; local
770 static void dumpchildren (Xgraph *G, Xcuttree_node *n) in dumpchildren()
[all …]
|
| /dports/math/ogdf/OGDF/src/ogdf/basic/graph_generators/ |
| H A D | deterministic.cpp | 51 void customGraph(Graph &G, int n, List<std::pair<int,int>> edges, Array<node> &nodes) in customGraph() argument
67 void circulantGraph(Graph &G, int n, Array<int> jumps) in circulantGraph()
92 void regularTree(Graph& G, int n, int children) in regularTree()
104 void completeGraph(Graph &G, int n) in completeGraph()
149 void completeBipartiteGraph(Graph &G, int n, int m) in completeBipartiteGraph()
155 void wheelGraph(Graph &G, int n) in wheelGraph()
177 void suspension(Graph &G, int n) in suspension()
192 void cubeGraph(Graph &G, int n) in cubeGraph()
211 void gridGraph(Graph &G, int n, int m, bool loopN, bool loopM) in gridGraph()
241 void petersenGraph(Graph &G, int n, int m) in petersenGraph()
[all …]
|
| /dports/math/concorde/concorde/CUT/ |
| H A D | shrink.c | 199 CC_SRKnode *n; in CCcut_SRK_subtour_shrink() local
228 CC_SRKnode *n; in count_ones() local
327 CC_SRKnode *n; in CCcut_SRK_defluff() local
441 CC_SRKnode *n; in CCcut_SRK_identify_ones() local
466 CC_SRKnode *n; in CCcut_SRK_crowder_padberg() local
512 CC_SRKnode *n; in CCcut_SRK_identify_pr_edges() local
762 CC_SRKnode *n; in CCcut_SRK_identify_one_triangles() local
1160 CC_SRKnode *n; in CCcut_SRK_identify_set() local
1197 void CCcut_SRK_identify_nodes (CC_SRKgraph *G, CC_SRKnode *n, CC_SRKnode *m) in CCcut_SRK_identify_nodes()
1229 static void merge_adj (CC_SRKgraph *G, CC_SRKnode *n, CC_SRKnode *m) in merge_adj()
[all …]
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/CUT/ |
| H A D | shrink.c | 108 CC_SRKnode *n; local
144 CC_SRKnode *n; local
256 CC_SRKnode *n; local
384 CC_SRKnode *n; local
424 CC_SRKnode *n; local
705 CC_SRKnode *n; local
767 void CCcut_SRK_identify_nodes (CC_SRKgraph *G, CC_SRKnode *n, CC_SRKnode *m) in CCcut_SRK_identify_nodes()
805 static void merge_adj (CC_SRKgraph *G, CC_SRKnode *n, CC_SRKnode *m) in merge_adj()
1017 CC_SRKnode *n; local
1102 CC_SRKnode *n, *m; local
[all …]
|
| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/test/ |
| H A D | graph_test.h | 96 void checkGraphOutArcList(const Graph &G, typename Graph::Node n, int cnt) in checkGraphOutArcList()
111 void checkGraphInArcList(const Graph &G, typename Graph::Node n, int cnt) in checkGraphInArcList()
140 void checkGraphIncEdgeList(const Graph &G, typename Graph::Node n, int cnt) in checkGraphIncEdgeList()
156 void checkGraphIncEdgeArcLists(const Graph &G, typename Graph::Node n, in checkGraphIncEdgeArcLists()
204 void checkNodeIds(const Graph& G) { in checkNodeIds()
217 void checkRedNodeIds(const Graph& G) { in checkRedNodeIds()
230 void checkBlueNodeIds(const Graph& G) { in checkBlueNodeIds()
243 void checkArcIds(const Graph& G) { in checkArcIds()
256 void checkEdgeIds(const Graph& G) { in checkEdgeIds()
269 void checkGraphNodeMap(const Graph& G) { in checkGraphNodeMap()
[all …]
|
| /dports/math/lemon/lemon-1.3.1/test/ |
| H A D | graph_test.h | 96 void checkGraphOutArcList(const Graph &G, typename Graph::Node n, int cnt) in checkGraphOutArcList()
111 void checkGraphInArcList(const Graph &G, typename Graph::Node n, int cnt) in checkGraphInArcList()
140 void checkGraphIncEdgeList(const Graph &G, typename Graph::Node n, int cnt) in checkGraphIncEdgeList()
156 void checkGraphIncEdgeArcLists(const Graph &G, typename Graph::Node n, in checkGraphIncEdgeArcLists()
204 void checkNodeIds(const Graph& G) { in checkNodeIds()
217 void checkRedNodeIds(const Graph& G) { in checkRedNodeIds()
230 void checkBlueNodeIds(const Graph& G) { in checkBlueNodeIds()
243 void checkArcIds(const Graph& G) { in checkArcIds()
256 void checkEdgeIds(const Graph& G) { in checkEdgeIds()
269 void checkGraphNodeMap(const Graph& G) { in checkGraphNodeMap()
[all …]
|
| /dports/science/madness/madness-ebb3fd7/src/madness/external/elemental/include/elemental/matrices/ |
| H A D | GCDMatrix.hpp | 17 MakeGCDMatrix( Matrix<T>& G ) in MakeGCDMatrix()
21 const Int n = G.Width(); in MakeGCDMatrix() local
29 MakeGCDMatrix( DistMatrix<T,U,V>& G ) in MakeGCDMatrix()
47 MakeGCDMatrix( BlockDistMatrix<T,U,V>& G ) in MakeGCDMatrix()
65 GCDMatrix( Matrix<T>& G, Int m, Int n ) in GCDMatrix()
74 GCDMatrix( DistMatrix<T,U,V>& G, Int m, Int n ) in GCDMatrix()
83 GCDMatrix( BlockDistMatrix<T,U,V>& G, Int m, Int n ) in GCDMatrix()
|
| /dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-amd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-spqr/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-btf/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-csparse/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|
| /dports/math/suitesparse-config/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/ |
| H A D | gbtest98.m | 9 n = 2^12 ; variable
10 G = GrB (n, n) ; variable
19 G = GrB (G, 'by row') ; variable
23 G = G + GrB.eye (n) ; variable
29 n = 2 * flintmax ; variable
30 G = GrB (n, n) ; variable
45 G = GrB.random (8, 8, 0.5) ; variable
47 G = full (G, 'double', 1) ; variable
|