Home
last modified time | relevance | path

Searched refs:ncluster (Results 1 – 25 of 51) sorted by relevance

123

/dports/math/SCIP/scip-7.0.3/applications/CycleClustering/src/
H A Dheur_cycgreedy.c62 for( c = 0; c < ncluster; ++c ) in getObjective()
64 c2 = ( c + 1 ) % ncluster; in getObjective()
88 for( k = 0; k < ncluster; ++k ) in computeIrrevMat()
90 for( l = 0; l < ncluster; ++l ) in computeIrrevMat()
225 for( c = 0; c < ncluster; ++c ) in assignNextBin()
333 for( c1 = 0; c1 < ncluster; ++c1 ) in assignNextBin()
468 assert(nbins > 0 && ncluster > 0); in SCIP_DECL_HEUREXEC()
478 if( i < ncluster ) in SCIP_DECL_HEUREXEC()
485 for( j = 0; j < ncluster; ++j ) in SCIP_DECL_HEUREXEC()
497 for( j = 0; j < ncluster; ++j ) in SCIP_DECL_HEUREXEC()
[all …]
H A Dheur_cyckerlin.c101 int ncluster; in getSolutionValues() local
111 assert(nbins > 0 && ncluster > 0 && nbins > ncluster); in getSolutionValues()
195 for( k = 0; k < ncluster; ++k ) in computeIrrevMat()
228 for( c = 0; c < ncluster; ++c ) in getObjective()
230 c2 = ( c + 1 ) % ncluster; in getObjective()
300 indkmin = ncluster - 1; in switchNext()
426 for( c = 0; c < ncluster; ++c ) in createSwitchSolution()
572 for( t = 0; t < ncluster; ++t ) in permuteStartSolution()
596 for( t = 0; t < ncluster; ++t ) in permuteStartSolution()
640 int ncluster; in runCyckerlin() local
[all …]
H A Dbranch_multinode.c55 int ncluster; in getBranchCands() local
60 ncluster = SCIPcycGetNCluster(scip); in getBranchCands()
66 for( k = 0; k < ncluster; ++k ) in getBranchCands()
99 int ncluster; in branchOnBin() local
102 ncluster = SCIPcycGetNCluster(scip); in branchOnBin()
108 for( k = 0; k < ncluster; ++k ) in branchOnBin()
135 if( ncands > 0 && ncands < ncluster ) in branchOnBin()
138 for( k = 0; k < ncluster; ++k ) in branchOnBin()
163 int ncluster; in SCIP_DECL_BRANCHEXECLP() local
176 ncluster = SCIPcycGetNCluster(scip); in SCIP_DECL_BRANCHEXECLP()
[all …]
H A Dprobdata_cyc.c178 assert(ncluster > 0); in phi()
210 int ncluster = probdata->ncluster; in createVariables() local
281 int ncluster = probdata->ncluster; in createProbSimplifiedTest() local
420 int ncluster = probdata->ncluster; in createProbSimplified() local
642 int ncluster = probdata->ncluster; in createProbQP() local
932 int ncluster = sourcedata->ncluster; in SCIP_DECL_PROBTRANS() local
942 (*targetdata)->ncluster = sourcedata->ncluster; in SCIP_DECL_PROBTRANS()
1153 int ncluster; in SCIP_DECL_PROBCOPY() local
1168 ncluster = sourcedata->ncluster; in SCIP_DECL_PROBCOPY()
1172 (*targetdata)->ncluster = ncluster; in SCIP_DECL_PROBCOPY()
[all …]
H A Dheur_fuzzyround.c56 int ncluster; in SCIP_DECL_HEUREXEC() local
77 ncluster = SCIPcycGetNCluster(scip); in SCIP_DECL_HEUREXEC()
79 assert(ncluster > 0 && ncluster <= nbins); in SCIP_DECL_HEUREXEC()
86 SCIP_CALL( SCIPallocClearBufferArray(scip, &binsincluster, ncluster) ); in SCIP_DECL_HEUREXEC()
90 SCIP_CALL( SCIPallocClearBufferArray(scip, &clustering[i], ncluster) ); /*lint !e866*/ in SCIP_DECL_HEUREXEC()
101 for (k = 0; k < ncluster; ++k) in SCIP_DECL_HEUREXEC()
124 assert(isPartition(scip, clustering, nbins, ncluster)); in SCIP_DECL_HEUREXEC()
127 SCIP_CALL( assignVars(scip, sol, clustering, nbins, ncluster) ); in SCIP_DECL_HEUREXEC()
H A Dprobdata_cyc.h112 int ncluster, /**< number of cluster */
119 int ncluster /**< the number of clusters*/
125 int ncluster /**< the number of clusters*/
134 int ncluster /**< the number of cluster */
142 int ncluster /**< the number of clusters */
H A Dheur_redsize.c65 int ncluster; in SCIPcycAddIncompleteSol() local
70 ncluster = SCIPcycGetNCluster(scip); in SCIPcycAddIncompleteSol()
79 SCIP_CALL( SCIPallocBlockMemoryArray(scip, &solclustering[i], ncluster) ); in SCIPcycAddIncompleteSol()
81 for( t = 0; t < ncluster; ++t ) in SCIPcycAddIncompleteSol()
87 SCIP_CALL( assignVars(scip, newsol, solclustering, nbins, ncluster) ); in SCIPcycAddIncompleteSol()
96 SCIPfreeBlockMemoryArray(scip, &solclustering[i], ncluster); in SCIPcycAddIncompleteSol()
188 int ncluster; in SCIPapplyRedSize() local
202 ncluster = SCIPcycGetNCluster(scip); in SCIPapplyRedSize()
206 assert(nbins > 0 && ncluster > 0 && nbins >= ncluster); in SCIPapplyRedSize()
240 SCIP_CALL( SCIPcreateProbCyc(subscip, "subscip", nbins, ncluster, cmatrix_red) ); in SCIPapplyRedSize()
H A Dreader_cyc.c80 int ncluster; /* number of clusters */ in readCyc() local
113 ncluster = (int) getNextNumber(&char_p); in readCyc()
121 if( ncluster <= 0 || nbins <= ncluster ) in readCyc()
157 SCIP_CALL( SCIPcreateProbCyc(scip, filename, nbins, ncluster, cmatrix) ); in readCyc()
H A Dsepa_subtour.c695 int ncluster; in SCIP_DECL_SEPAEXECLP() local
707 ncluster = SCIPcycGetNCluster(scip); in SCIP_DECL_SEPAEXECLP()
720 assert(ncluster > 0 && ncluster < nstates); in SCIP_DECL_SEPAEXECLP()
725 SCIP_CALL( SCIPallocBlockMemoryArray(scip, &adjacencymatrix, ncluster) ); in SCIP_DECL_SEPAEXECLP()
727 for( k = 0; k < ncluster; ++k ) in SCIP_DECL_SEPAEXECLP()
814 while( cyclelength < ncluster ) in SCIP_DECL_SEPAEXECLP()
829 if( cyclelength == ncluster - 1 ) in SCIP_DECL_SEPAEXECLP()
852 for( i = 0; i < ncluster; ++i ) in SCIP_DECL_SEPAEXECLP()
860 SCIPfreeBlockMemoryArray(scip, &adjacencymatrix, ncluster); in SCIP_DECL_SEPAEXECLP()
/dports/graphics/graphviz/graphviz-2.44.1/lib/sfdpgen/
H A DMultilevel.c349 *ncluster = 0; in maximal_independent_edge_set_heavest_edge_pernode_leaves_first()
370 (*clusterp)[++(*ncluster)] = nz; in maximal_independent_edge_set_heavest_edge_pernode_leaves_first()
417 (*clusterp)[++(*ncluster)] = nz; in maximal_independent_edge_set_heavest_edge_pernode_leaves_first()
527 *ncluster = 0; in maximal_independent_edge_set_heavest_edge_pernode_supernodes_first()
669 *ncluster = 0; in maximal_independent_edge_set_heavest_cluster_pernode_leaves_first()
835 irn = N_GNEW(ncluster,int*); in DistanceMatrix_restrict_cluster()
836 jcn = N_GNEW(ncluster,int*); in DistanceMatrix_restrict_cluster()
837 val = N_GNEW(ncluster,real*); in DistanceMatrix_restrict_cluster()
839 nz = N_GNEW(ncluster,int); in DistanceMatrix_restrict_cluster()
1024 assert(ncluster <= n); in Multilevel_coarsen_internal()
[all …]
/dports/graphics/graphviz/graphviz-2.44.1/lib/sparse/
H A Dmq.c76 int ncluster = 0; in get_mq() local
95 if (counts[assignment[i]] == 0) ncluster++; in get_mq()
98 k = ncluster; in get_mq()
99 assert(ncluster <= n); in get_mq()
102 assert(assignment[i] < ncluster); in get_mq()
109 assert(assignment[jj] < ncluster); in get_mq()
182 int n = A->n, ncluster; in Multilevel_MQ_Clustering_init() local
197 fprintf(stderr,"ncluster = %d, mq = %f\n", ncluster, mq); in Multilevel_MQ_Clustering_init()
202 grid->ncluster = ncluster; in Multilevel_MQ_Clustering_init()
340 {int ncluster; in Multilevel_MQ_Clustering_establish() local
[all …]
/dports/math/ploticus-nox11/pl240src/prefabs/
H A Dchron.pl--194 #set ncluster = 1
196 #set ncluster = 4
198 #set ncluster = 3
200 #set ncluster = 2
202 #if @ncluster > 1 && @stack != yes
203 cluster: 1 / @ncluster
236 cluster: 2 / @ncluster
266 cluster: 3 / @ncluster
296 cluster: 4 / @ncluster
H A Dchron.pl-195 #set ncluster = 1
197 #set ncluster = 4
199 #set ncluster = 3
201 #set ncluster = 2
203 #if @ncluster > 1 && @stack != yes
204 cluster: 1 / @ncluster
240 cluster: 2 / @ncluster
270 cluster: 3 / @ncluster
300 cluster: 4 / @ncluster
H A Dchron.pl216 cluster: 1 / @ncluster
254 cluster: 2 / @ncluster
284 cluster: 3 / @ncluster
314 cluster: 4 / @ncluster
/dports/math/ploticus/pl240src/prefabs/
H A Dchron.pl-195 #set ncluster = 1
197 #set ncluster = 4
199 #set ncluster = 3
201 #set ncluster = 2
203 #if @ncluster > 1 && @stack != yes
204 cluster: 1 / @ncluster
240 cluster: 2 / @ncluster
270 cluster: 3 / @ncluster
300 cluster: 4 / @ncluster
H A Dchron.pl--194 #set ncluster = 1
196 #set ncluster = 4
198 #set ncluster = 3
200 #set ncluster = 2
202 #if @ncluster > 1 && @stack != yes
203 cluster: 1 / @ncluster
236 cluster: 2 / @ncluster
266 cluster: 3 / @ncluster
296 cluster: 4 / @ncluster
H A Dchron.pl216 cluster: 1 / @ncluster
254 cluster: 2 / @ncluster
284 cluster: 3 / @ncluster
314 cluster: 4 / @ncluster
/dports/science/lammps/lammps-stable_29Sep2021/src/
H A Dcompute_fragment_atom.cpp101 int nstack,ncluster,done,alldone; in compute_peratom() local
185 ncluster = nstack = 0; in compute_peratom()
190 clist[ncluster++] = j; in compute_peratom()
208 else clist[ncluster++] = k; in compute_peratom()
215 for (m = 0; m < ncluster; m++) { in compute_peratom()
223 for (m = 0; m < ncluster; m++) { in compute_peratom()
/dports/science/gromacs/gromacs-2021.4/src/gromacs/pbcutil/
H A Dpbcmethods.cpp60 int ncluster, nadded; in calc_pbc_cluster() local
117 ncluster = 0; in calc_pbc_cluster()
165 cluster[ncluster++] = i; in calc_pbc_cluster()
170 if (ncluster <= 0) in calc_pbc_cluster()
185 while (nadded < ncluster) in calc_pbc_cluster()
196 for (j = 0; j < ncluster; j++) in calc_pbc_cluster()
227 fprintf(stdout, "\rClustering iteration %d of %d...", nadded, ncluster); in calc_pbc_cluster()
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/
H A Ddistribution_methods.F1048 ALLOCATE (cluster_cost(ncluster))
1049 ALLOCATE (cluster_to_row(ncluster))
1050 ALLOCATE (cluster_to_col(ncluster))
1051 ALLOCATE (sorted_cost(ncluster))
1052 ALLOCATE (piv_cost(ncluster))
1059 CALL sort(sorted_cost, INT(ncluster), piv_cost)
1077 ALLOCATE (cluster_center(3, ncluster))
1078 ALLOCATE (cluster_low(3, ncluster))
1079 ALLOCATE (cluster_high(3, ncluster))
1080 ALLOCATE (cluster_count(ncluster))
[all …]
/dports/science/cp2k-data/cp2k-7.1.0/src/
H A Ddistribution_methods.F1051 ALLOCATE (cluster_cost(ncluster))
1052 ALLOCATE (cluster_to_row(ncluster))
1053 ALLOCATE (cluster_to_col(ncluster))
1054 ALLOCATE (sorted_cost(ncluster))
1055 ALLOCATE (piv_cost(ncluster))
1062 CALL sort(sorted_cost, INT(ncluster), piv_cost)
1080 ALLOCATE (cluster_center(3, ncluster))
1081 ALLOCATE (cluster_low(3, ncluster))
1082 ALLOCATE (cluster_high(3, ncluster))
1083 ALLOCATE (cluster_count(ncluster))
[all …]
/dports/math/ploticus-nox11/pl240src/src/
H A Dproc_bars.c55 int nstackf, ncluster, clusterpos, labelfld, lwl, reverse, stopfld; in PLP_bars() local
91 ncluster = 1; in PLP_bars()
126 nt = sscanf( lineval, "%d %s %d", &clusterpos, buf, &ncluster ); in PLP_bars()
127 if( nt == 2 ) sscanf( lineval, "%d %d", &clusterpos, &ncluster ); in PLP_bars()
256 if( ncluster <= 1 ) halfw = ( Ea( X, 1.0 ) - Ea( X, 0.0 ) ) * 0.4; in PLP_bars()
257 else if( ncluster > 1 ) halfw = (( Ea( X, 1.0 ) - Ea( X, 0.0 ) ) * 0.4)/ (double)ncluster; in PLP_bars()
365 if( ncluster > 1 ) { /* clustering - move sideways a little.. */ in PLP_bars()
366 xleft = Ea( X, x ) - ((halfw+clustsep) * (double)(ncluster)); in PLP_bars()
368 if( baseax == Y ) xleft += ((halfw+clustsep) * (ncluster-clusterpos)*2.0); in PLP_bars()
637 if( ncluster > 1 ) { /* if clusters, move sideways a little bit.. */ in PLP_bars()
[all …]
/dports/math/ploticus/pl240src/src/
H A Dproc_bars.c55 int nstackf, ncluster, clusterpos, labelfld, lwl, reverse, stopfld; in PLP_bars() local
91 ncluster = 1; in PLP_bars()
126 nt = sscanf( lineval, "%d %s %d", &clusterpos, buf, &ncluster ); in PLP_bars()
127 if( nt == 2 ) sscanf( lineval, "%d %d", &clusterpos, &ncluster ); in PLP_bars()
256 if( ncluster <= 1 ) halfw = ( Ea( X, 1.0 ) - Ea( X, 0.0 ) ) * 0.4; in PLP_bars()
257 else if( ncluster > 1 ) halfw = (( Ea( X, 1.0 ) - Ea( X, 0.0 ) ) * 0.4)/ (double)ncluster; in PLP_bars()
365 if( ncluster > 1 ) { /* clustering - move sideways a little.. */ in PLP_bars()
366 xleft = Ea( X, x ) - ((halfw+clustsep) * (double)(ncluster)); in PLP_bars()
368 if( baseax == Y ) xleft += ((halfw+clustsep) * (ncluster-clusterpos)*2.0); in PLP_bars()
637 if( ncluster > 1 ) { /* if clusters, move sideways a little bit.. */ in PLP_bars()
[all …]
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dheur_multistart.c614 int* ncluster, /**< pointer to store the total number of cluster */ in clusterPointsGreedy() argument
625 assert(ncluster != NULL); in clusterPointsGreedy()
633 *ncluster = 0; in clusterPointsGreedy()
635 for( i = 0; i < npoints && (*ncluster < maxncluster); ++i ) in clusterPointsGreedy()
644 clusteridx[i] = *ncluster; in clusterPointsGreedy()
649 clusteridx[j] = *ncluster; in clusterPointsGreedy()
652 ++(*ncluster); in clusterPointsGreedy()
659 assert(clusteridx[i] < *ncluster || clusteridx[i] == INT_MAX); in clusterPointsGreedy()
811 int ncluster; in applyHeur() local
895 assert(ncluster >= 0 && ncluster <= heurdata->maxncluster); in applyHeur()
[all …]
/dports/biology/bcftools/bcftools-1.14/
H A Dhclust.c356 int ncluster = 0; in hclust_create_list() local
361 cluster = append_cluster(stack[0], cluster, &ncluster, tmp); in hclust_create_list()
372 cluster = append_cluster(node, cluster, &ncluster, tmp); in hclust_create_list()
377 cluster = append_cluster(akid, cluster, &ncluster, tmp); in hclust_create_list()
382 cluster = append_cluster(bkid, cluster, &ncluster, tmp); in hclust_create_list()
390 *nclust = ncluster; in hclust_create_list()

123