| /dports/graphics/netpbm/netpbm-10.91.01/analyzer/ |
| H A D | pgmminkowski.c | 42 int maxtiles, maxedgex, maxedgey, maxvertex; in main() local
180 maxvertex= (rows+1) * (cols+1); in main()
195 eulerchi = maxtiles - maxedgex - maxedgey + maxvertex; in main()
198 maxtiles, maxedgex, maxedgey, maxvertex, in main()
206 maxvertex-= countVertex[i]; in main()
214 maxtiles, maxedgex, maxedgey, maxvertex ); in main()
|
| /dports/math/igraph/igraph-0.9.5/src/cliques/cliquer/ |
| H A D | reorder.c | 244 int maxdegree,maxvertex=0; in reorder_by_unweighted_greedy_coloring() local
270 maxvertex=i; in reorder_by_unweighted_greedy_coloring()
276 order[v]=maxvertex; in reorder_by_unweighted_greedy_coloring()
277 degree[maxvertex]=-1; in reorder_by_unweighted_greedy_coloring()
283 if (GRAPH_IS_EDGE(g,maxvertex,i)) { in reorder_by_unweighted_greedy_coloring()
365 int maxdegree,maxvertex=0; in reorder_by_degree() local
382 maxvertex=i; in reorder_by_degree()
386 order[v]=maxvertex; in reorder_by_degree()
387 degree[maxvertex]=-1; /* used */ in reorder_by_degree()
|
| /dports/math/R-cran-igraph/igraph/src/cliquer/ |
| H A D | reorder.c | 244 int maxdegree,maxvertex=0; in reorder_by_unweighted_greedy_coloring() local
270 maxvertex=i; in reorder_by_unweighted_greedy_coloring()
276 order[v]=maxvertex; in reorder_by_unweighted_greedy_coloring()
277 degree[maxvertex]=-1; in reorder_by_unweighted_greedy_coloring()
283 if (GRAPH_IS_EDGE(g,maxvertex,i)) { in reorder_by_unweighted_greedy_coloring()
365 int maxdegree,maxvertex=0; in reorder_by_degree() local
382 maxvertex=i; in reorder_by_degree()
386 order[v]=maxvertex; in reorder_by_degree()
387 degree[maxvertex]=-1; /* used */ in reorder_by_degree()
|
| /dports/math/cliquer/autocliquer-1.22/lib/ |
| H A D | reorder.c | 244 int maxdegree,maxvertex=0; in reorder_by_unweighted_greedy_coloring() local
270 maxvertex=i; in reorder_by_unweighted_greedy_coloring()
276 order[v]=maxvertex; in reorder_by_unweighted_greedy_coloring()
277 degree[maxvertex]=-1; in reorder_by_unweighted_greedy_coloring()
283 if (GRAPH_IS_EDGE(g,maxvertex,i)) { in reorder_by_unweighted_greedy_coloring()
365 int maxdegree,maxvertex=0; in reorder_by_degree() local
382 maxvertex=i; in reorder_by_degree()
386 order[v]=maxvertex; in reorder_by_degree()
387 degree[maxvertex]=-1; /* used */ in reorder_by_degree()
|
| /dports/graphics/libGLU/glu-9.0.2/src/libnurbs/internals/ |
| H A D | intersect.cc | 177 int maxvertex = jarc->pwlArc->npts; in arc_split() local
220 TrimVertex *newjunk = trimvertexpool.get(maxvertex -i+1 /*-j*/); in arc_split()
222 for(k=0; k<maxvertex-i; k++) in arc_split()
228 TrimVertex *vcopy = trimvertexpool.get(maxvertex); in arc_split()
229 for(k=0; k<maxvertex; k++) in arc_split()
248 new(pwlarcpool) PwlArc(maxvertex-i+1 , newjunk ) ); in arc_split()
274 if (maxvertex == 2) { in arc_split()
287 } else if (maxvertex - j == 2) { in arc_split()
290 jarc->pwlArc->npts = maxvertex-1; in arc_split()
304 new(pwlarcpool) PwlArc( maxvertex-1, &jarc->pwlArc->pts[1] ) ); in arc_split()
[all …]
|
| /dports/math/dsdp/DSDP5.8/examples/ |
| H A D | color.c | 203 int i,j,nodek,nn,info,flag,coloring=0,maxvertex; in RandomizedColor() local
223 maxvertex=First(color,nnodes); in RandomizedColor()
224 maxvertex=HighDegree(node1,node2,tnedges,degree,nnodes); in RandomizedColor()
226 cgroup[0]=maxvertex;ngsize=1; in RandomizedColor()
228 info=GetXRow(xptr,xrow,maxvertex,nnodes); in RandomizedColor()
|
| /dports/math/qhull8/qhull-8.0.2/src/libqhull/ |
| H A D | geom2.c | 732 vertexT *maxvertex= NULL, *vertex; in qh_furthestnewvertex() local
741 maxvertex= vertex; in qh_furthestnewvertex()
746 getid_(maxvertex), maxdist, facet->id)); in qh_furthestnewvertex()
748 return maxvertex; in qh_furthestnewvertex()
765 vertexT *maxvertex= NULL, *vertex, **vertexp; in qh_furthestvertex() local
776 if (!maxvertex) { in qh_furthestvertex()
779 maxvertex= vertex; in qh_furthestvertex()
782 maxvertex= vertex; in qh_furthestvertex()
787 if (!maxvertex) { in qh_furthestvertex()
793 maxvertex->id, maxdist, mindist, facetA->id, facetB->id)); in qh_furthestvertex()
[all …]
|
| H A D | merge.c | 5035 vertexT *maxvertex= NULL, *maxvertex2= NULL; in qh_test_nonsimplicial_merge() local
5095 maxvertex= qh_furthestvertex(facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5096 if (!maxvertex) { in qh_test_nonsimplicial_merge()
5102 maxvertex= qh_furthestvertex(facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5103 if (maxvertex) { in qh_test_nonsimplicial_merge()
5148 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh furth… in qh_test_nonsimplicial_merge()
5156 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh furth… in qh_test_nonsimplicial_merge()
5162 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh furth… in qh_test_nonsimplicial_merge()
5168 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh furth… in qh_test_nonsimplicial_merge()
|
| /dports/math/qhull/qhull-7.3.2/src/libqhull/ |
| H A D | geom2.c | 731 vertexT *maxvertex= NULL, *vertex; in qh_furthestnewvertex() local
740 maxvertex= vertex; in qh_furthestnewvertex()
745 getid_(maxvertex), maxdist, facet->id)); in qh_furthestnewvertex()
747 return maxvertex; in qh_furthestnewvertex()
764 vertexT *maxvertex= NULL, *vertex, **vertexp; in qh_furthestvertex() local
775 if (!maxvertex) { in qh_furthestvertex()
778 maxvertex= vertex; in qh_furthestvertex()
781 maxvertex= vertex; in qh_furthestvertex()
786 if (!maxvertex) { in qh_furthestvertex()
792 maxvertex->id, maxdist, mindist, facetA->id, facetB->id)); in qh_furthestvertex()
[all …]
|
| H A D | merge.c | 5035 vertexT *maxvertex= NULL, *maxvertex2= NULL; in qh_test_nonsimplicial_merge() local
5095 maxvertex= qh_furthestvertex(facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5096 if (!maxvertex) { in qh_test_nonsimplicial_merge()
5102 maxvertex= qh_furthestvertex(facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5103 if (maxvertex) { in qh_test_nonsimplicial_merge()
5148 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh furth… in qh_test_nonsimplicial_merge()
5156 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh furth… in qh_test_nonsimplicial_merge()
5162 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh furth… in qh_test_nonsimplicial_merge()
5168 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh furth… in qh_test_nonsimplicial_merge()
|
| /dports/math/nauty/nauty27r3/ |
| H A D | nautycliquer.c | 2404 int maxdegree,maxvertex=0; in reorder_by_unweighted_greedy_coloring() local
2430 maxvertex=i; in reorder_by_unweighted_greedy_coloring()
2436 order[v]=maxvertex; in reorder_by_unweighted_greedy_coloring()
2437 degree[maxvertex]=-1; in reorder_by_unweighted_greedy_coloring()
2443 if (GRAPH_IS_EDGE(g,maxvertex,i)) { in reorder_by_unweighted_greedy_coloring()
2525 int maxdegree,maxvertex=0; in reorder_by_degree() local
2542 maxvertex=i; in reorder_by_degree()
2546 order[v]=maxvertex; in reorder_by_degree()
2547 degree[maxvertex]=-1; /* used */ in reorder_by_degree()
|
| /dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/ |
| H A D | nautycliquer.c | 2404 int maxdegree,maxvertex=0; in reorder_by_unweighted_greedy_coloring() local
2430 maxvertex=i; in reorder_by_unweighted_greedy_coloring()
2436 order[v]=maxvertex; in reorder_by_unweighted_greedy_coloring()
2437 degree[maxvertex]=-1; in reorder_by_unweighted_greedy_coloring()
2443 if (GRAPH_IS_EDGE(g,maxvertex,i)) { in reorder_by_unweighted_greedy_coloring()
2525 int maxdegree,maxvertex=0; in reorder_by_degree() local
2542 maxvertex=i; in reorder_by_degree()
2546 order[v]=maxvertex; in reorder_by_degree()
2547 degree[maxvertex]=-1; /* used */ in reorder_by_degree()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/spatial/qhull_src/src/ |
| H A D | geom2_r.c | 731 vertexT *maxvertex= NULL, *vertex; in qh_furthestnewvertex() local
740 maxvertex= vertex; in qh_furthestnewvertex()
745 getid_(maxvertex), maxdist, facet->id)); in qh_furthestnewvertex()
747 return maxvertex; in qh_furthestnewvertex()
764 vertexT *maxvertex= NULL, *vertex, **vertexp; in qh_furthestvertex() local
775 if (!maxvertex) { in qh_furthestvertex()
778 maxvertex= vertex; in qh_furthestvertex()
781 maxvertex= vertex; in qh_furthestvertex()
786 if (!maxvertex) { in qh_furthestvertex()
792 maxvertex->id, maxdist, mindist, facetA->id, facetB->id)); in qh_furthestvertex()
[all …]
|
| H A D | merge_r.c | 5035 vertexT *maxvertex= NULL, *maxvertex2= NULL; in qh_test_nonsimplicial_merge() local
5095 maxvertex= qh_furthestvertex(qh, facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5096 if (!maxvertex) { in qh_test_nonsimplicial_merge()
5102 maxvertex= qh_furthestvertex(qh, facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5103 if (maxvertex) { in qh_test_nonsimplicial_merge()
5148 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5156 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5162 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5168 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
|
| /dports/math/qhull8/qhull-8.0.2/src/libqhull_r/ |
| H A D | geom2_r.c | 732 vertexT *maxvertex= NULL, *vertex; in qh_furthestnewvertex() local
741 maxvertex= vertex; in qh_furthestnewvertex()
746 getid_(maxvertex), maxdist, facet->id)); in qh_furthestnewvertex()
748 return maxvertex; in qh_furthestnewvertex()
765 vertexT *maxvertex= NULL, *vertex, **vertexp; in qh_furthestvertex() local
776 if (!maxvertex) { in qh_furthestvertex()
779 maxvertex= vertex; in qh_furthestvertex()
782 maxvertex= vertex; in qh_furthestvertex()
787 if (!maxvertex) { in qh_furthestvertex()
793 maxvertex->id, maxdist, mindist, facetA->id, facetB->id)); in qh_furthestvertex()
[all …]
|
| H A D | merge_r.c | 5035 vertexT *maxvertex= NULL, *maxvertex2= NULL; in qh_test_nonsimplicial_merge() local
5095 maxvertex= qh_furthestvertex(qh, facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5096 if (!maxvertex) { in qh_test_nonsimplicial_merge()
5102 maxvertex= qh_furthestvertex(qh, facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5103 if (maxvertex) { in qh_test_nonsimplicial_merge()
5148 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5156 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5162 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5168 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
|
| /dports/math/qhull/qhull-7.3.2/src/libqhull_r/ |
| H A D | geom2_r.c | 731 vertexT *maxvertex= NULL, *vertex; in qh_furthestnewvertex() local
740 maxvertex= vertex; in qh_furthestnewvertex()
745 getid_(maxvertex), maxdist, facet->id)); in qh_furthestnewvertex()
747 return maxvertex; in qh_furthestnewvertex()
764 vertexT *maxvertex= NULL, *vertex, **vertexp; in qh_furthestvertex() local
775 if (!maxvertex) { in qh_furthestvertex()
778 maxvertex= vertex; in qh_furthestvertex()
781 maxvertex= vertex; in qh_furthestvertex()
786 if (!maxvertex) { in qh_furthestvertex()
792 maxvertex->id, maxdist, mindist, facetA->id, facetB->id)); in qh_furthestvertex()
[all …]
|
| H A D | merge_r.c | 5035 vertexT *maxvertex= NULL, *maxvertex2= NULL; in qh_test_nonsimplicial_merge() local
5095 maxvertex= qh_furthestvertex(qh, facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5096 if (!maxvertex) { in qh_test_nonsimplicial_merge()
5102 maxvertex= qh_furthestvertex(qh, facet, neighbor, &maxdist, &mindist); in qh_test_nonsimplicial_merge()
5103 if (maxvertex) { in qh_test_nonsimplicial_merge()
5148 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5156 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5162 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
5168 …facet->id, getid_(maxvertex), neighbor->id, getid_(maxvertex2), maxdist, maxdist2, angle, qh->furt… in qh_test_nonsimplicial_merge()
|
| /dports/math/gap/gap-4.11.0/pkg/simpcomp/lib/ |
| H A D | bistellar.gi | 330 local element, i, j, A, linkface, maxface, maxvertex, ball_boundary_faces;
333 maxvertex:=MaximumList(faces[1])+1;
334 maxvertex:=maxvertex[1];
336 maxvertex:=randomelement[2][1];
344 # ...where M=faces[max], A=randomelement[1], B=new vertex "[maxvertex]"
356 A:=[maxvertex];
|
| H A D | generate.gi | 1410 local maxvertex, newComplex, maptable, i, idx, tmp, sc, dim, facets, facets1, facets2, name, pure;
1444 maxvertex:=Maximum(SCVerticesEx(complex));
1445 if maxvertex=fail then
1457 facets2:=SCIntFunc.DeepCopy(SCFacetsEx(complex)+i*maxvertex);
|