Home
last modified time | relevance | path

Searched refs:xadj (Results 1 – 25 of 749) sorted by relevance

12345678910>>...30

/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Mumps/MUMPS/PORD/lib/
H A Dgraph.c113 xadj = G->xadj; in randomizeGraph()
138 xadj = G->xadj; in setupSubgraph()
210 xadj = G->xadj; in setupGraphFromMtx()
225 xadj[0] = 0; in setupGraphFromMtx()
228 xadj[k] = xadj[k-1] + h1; in setupGraphFromMtx()
249 xadj[k] = xadj[k-1]; in setupGraphFromMtx()
280 xadj = G->xadj; in setupGridGraph()
318 xadj = G->xadj; in setupGridGraph()
349 xadj = G->xadj; in connectedComponents()
405 xadj = G->xadj; in indNodes()
[all …]
/dports/math/coinmumps/MUMPS_4.10.0/PORD/lib/
H A Dgraph.c113 xadj = G->xadj; in randomizeGraph()
138 xadj = G->xadj; in setupSubgraph()
210 xadj = G->xadj; in setupGraphFromMtx()
225 xadj[0] = 0; in setupGraphFromMtx()
228 xadj[k] = xadj[k-1] + h1; in setupGraphFromMtx()
249 xadj[k] = xadj[k-1]; in setupGraphFromMtx()
280 xadj = G->xadj; in setupGridGraph()
318 xadj = G->xadj; in setupGridGraph()
349 xadj = G->xadj; in connectedComponents()
405 xadj = G->xadj; in indNodes()
[all …]
/dports/math/mumps4/MUMPS_4.10.0/PORD/lib/
H A Dgraph.c113 xadj = G->xadj; in randomizeGraph()
138 xadj = G->xadj; in setupSubgraph()
210 xadj = G->xadj; in setupGraphFromMtx()
225 xadj[0] = 0; in setupGraphFromMtx()
228 xadj[k] = xadj[k-1] + h1; in setupGraphFromMtx()
249 xadj[k] = xadj[k-1]; in setupGraphFromMtx()
280 xadj = G->xadj; in setupGridGraph()
318 xadj = G->xadj; in setupGridGraph()
349 xadj = G->xadj; in connectedComponents()
405 xadj = G->xadj; in indNodes()
[all …]
/dports/graphics/colmap/colmap-3.6/lib/Graclus/metisLib/
H A Ddebug.c30 xadj = graph->xadj; in ComputeRAsso()
40 for (j=xadj[i]; j<xadj[i+1]; j++) in ComputeRAsso()
48 for (j=xadj[i]; j<xadj[i+1]; j++) in ComputeRAsso()
77 xadj = graph->xadj; in ComputeNCut()
84 for (j=xadj[i]; j<xadj[i+1]; j++){ in ComputeNCut()
151 xadj = graph->xadj; in CheckBnd()
158 if (xadj[i+1]-xadj[i] == 0) in CheckBnd()
187 xadj = graph->xadj; in CheckBnd2()
222 xadj = graph->xadj; in CheckNodeBnd()
276 xadj = graph->xadj; in CheckNodePartitionParams()
[all …]
H A Dfrename.c95 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in METIS_EDGEND()
99 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend()
103 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend_()
107 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend__()
114 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in METIS_NODEND()
118 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend()
122 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend_()
126 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend__()
224 METIS_EstimateMemory(nvtxs, xadj, adjncy, numflag, optype, nbytes); in METIS_ESTIMATEMEMORY()
228 METIS_EstimateMemory(nvtxs, xadj, adjncy, numflag, optype, nbytes); in metis_estimatememory()
[all …]
H A Dcompress.c34 for (j=xadj[i]; j<xadj[i+1]; j++) in CompressGraph()
47 for (j=xadj[ii]; j<xadj[ii+1]; j++) in CompressGraph()
56 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii]) in CompressGraph()
85 graph->xadj = xadj; in CompressGraph()
97 graph->adjwgtsum[i] = xadj[i+1]-xadj[i]; in CompressGraph()
107 cnedges += xadj[ii+1]-xadj[ii]; in CompressGraph()
172 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
175 pnedges += xadj[i+1]-xadj[i]; in PruneGraph()
191 graph->xadj = xadj; in PruneGraph()
221 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
[all …]
H A Dgraph.c38 graph->xadj = xadj; in SetUpGraph()
75 for (j=xadj[i]; j<xadj[i+1]; j++) in SetUpGraph()
151 graph->xadj = xadj; in SetUpGraphKway()
181 graph->xadj = xadj; in SetUpGraph2()
224 graph->xadj = xadj; in VolSetUpGraph()
358 xadj = graph->xadj; in RandomizeGraph()
363 l = xadj[i+1]-xadj[i]; in RandomizeGraph()
383 xadj = graph->xadj; in IsConnectedSubdomain()
460 xadj = graph->xadj; in IsConnected()
498 xadj = graph->xadj; in IsConnected2()
[all …]
/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Metis/metis-4.0/Lib/
H A Dfrename.c95 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in METIS_EDGEND()
99 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend()
103 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend_()
107 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend__()
114 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in METIS_NODEND()
118 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend()
122 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend_()
126 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend__()
224 METIS_EstimateMemory(nvtxs, xadj, adjncy, numflag, optype, nbytes); in METIS_ESTIMATEMEMORY()
228 METIS_EstimateMemory(nvtxs, xadj, adjncy, numflag, optype, nbytes); in metis_estimatememory()
[all …]
H A Ddebug.c52 xadj = graph->xadj; in CheckBnd()
59 if (xadj[i+1]-xadj[i] == 0) in CheckBnd()
62 for (j=xadj[i]; j<xadj[i+1]; j++) { in CheckBnd()
88 xadj = graph->xadj; in CheckBnd2()
96 for (j=xadj[i]; j<xadj[i+1]; j++) { in CheckBnd2()
102 if (ed - id >= 0 && xadj[i] < xadj[i+1]) { in CheckBnd2()
123 xadj = graph->xadj; in CheckNodeBnd()
177 xadj = graph->xadj; in CheckNodePartitionParams()
195 for (j=xadj[i]; j<xadj[i+1]; j++) { in CheckNodePartitionParams()
223 xadj = graph->xadj; in IsSeparable()
[all …]
H A Dcompress.c34 for (j=xadj[i]; j<xadj[i+1]; j++) in CompressGraph()
47 for (j=xadj[ii]; j<xadj[ii+1]; j++) in CompressGraph()
56 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii]) in CompressGraph()
85 graph->xadj = xadj; in CompressGraph()
97 graph->adjwgtsum[i] = xadj[i+1]-xadj[i]; in CompressGraph()
107 cnedges += xadj[ii+1]-xadj[ii]; in CompressGraph()
172 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
175 pnedges += xadj[i+1]-xadj[i]; in PruneGraph()
191 graph->xadj = xadj; in PruneGraph()
221 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
[all …]
H A Dgraph.c38 graph->xadj = xadj; in SetUpGraph()
75 for (j=xadj[i]; j<xadj[i+1]; j++) in SetUpGraph()
151 graph->xadj = xadj; in SetUpGraphKway()
181 graph->xadj = xadj; in SetUpGraph2()
224 graph->xadj = xadj; in VolSetUpGraph()
358 xadj = graph->xadj; in RandomizeGraph()
363 l = xadj[i+1]-xadj[i]; in RandomizeGraph()
383 xadj = graph->xadj; in IsConnectedSubdomain()
460 xadj = graph->xadj; in IsConnected()
498 xadj = graph->xadj; in IsConnected2()
[all …]
/dports/science/siconos/siconos-4.4.0/externals/lbl/metis4/
H A Dfrename.c95 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in METIS_EDGEND()
99 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend()
103 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend_()
107 METIS_EdgeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_edgend__()
114 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in METIS_NODEND()
118 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend()
122 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend_()
126 METIS_NodeND(nvtxs, xadj, adjncy, numflag, options, perm, iperm); in metis_nodend__()
224 METIS_EstimateMemory(nvtxs, xadj, adjncy, numflag, optype, nbytes); in METIS_ESTIMATEMEMORY()
228 METIS_EstimateMemory(nvtxs, xadj, adjncy, numflag, optype, nbytes); in metis_estimatememory()
[all …]
H A Ddebug.c52 xadj = graph->xadj; in CheckBnd()
59 if (xadj[i+1]-xadj[i] == 0) in CheckBnd()
62 for (j=xadj[i]; j<xadj[i+1]; j++) { in CheckBnd()
88 xadj = graph->xadj; in CheckBnd2()
96 for (j=xadj[i]; j<xadj[i+1]; j++) { in CheckBnd2()
102 if (ed - id >= 0 && xadj[i] < xadj[i+1]) { in CheckBnd2()
123 xadj = graph->xadj; in CheckNodeBnd()
177 xadj = graph->xadj; in CheckNodePartitionParams()
195 for (j=xadj[i]; j<xadj[i+1]; j++) { in CheckNodePartitionParams()
223 xadj = graph->xadj; in IsSeparable()
[all …]
H A Dcompress.c34 for (j=xadj[i]; j<xadj[i+1]; j++) in CompressGraph()
47 for (j=xadj[ii]; j<xadj[ii+1]; j++) in CompressGraph()
56 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii]) in CompressGraph()
85 graph->xadj = xadj; in CompressGraph()
97 graph->adjwgtsum[i] = xadj[i+1]-xadj[i]; in CompressGraph()
107 cnedges += xadj[ii+1]-xadj[ii]; in CompressGraph()
172 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
175 pnedges += xadj[i+1]-xadj[i]; in PruneGraph()
191 graph->xadj = xadj; in PruneGraph()
221 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
[all …]
H A Dgraph.c38 graph->xadj = xadj; in SetUpGraph()
75 for (j=xadj[i]; j<xadj[i+1]; j++) in SetUpGraph()
151 graph->xadj = xadj; in SetUpGraphKway()
181 graph->xadj = xadj; in SetUpGraph2()
224 graph->xadj = xadj; in VolSetUpGraph()
358 xadj = graph->xadj; in RandomizeGraph()
363 l = xadj[i+1]-xadj[i]; in RandomizeGraph()
383 xadj = graph->xadj; in IsConnectedSubdomain()
460 xadj = graph->xadj; in IsConnected()
498 xadj = graph->xadj; in IsConnected2()
[all …]
/dports/math/mumps/mumps-5.1.2/PORD/lib/
H A Dgraph.c113 xadj = G->xadj; in randomizeGraph()
138 xadj = G->xadj; in setupSubgraph()
210 xadj = G->xadj; in setupGraphFromMtx()
225 xadj[0] = 0; in setupGraphFromMtx()
228 xadj[k] = xadj[k-1] + h1; in setupGraphFromMtx()
249 xadj[k] = xadj[k-1]; in setupGraphFromMtx()
280 xadj = G->xadj; in setupGridGraph()
318 xadj = G->xadj; in setupGridGraph()
349 xadj = G->xadj; in connectedComponents()
405 xadj = G->xadj; in indNodes()
[all …]
/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Metis/metis-4.0/Test/
H A Dmtest.c50 Test_ND(graph.nvtxs, graph.xadj, graph.adjncy); in main()
75 adjwgt = idxmalloc(xadj[nvtxs], "adjwgt"); in Test_PartGraph()
77 for (j=xadj[i]; j<xadj[i+1]; j++) { in Test_PartGraph()
81 for (jj=xadj[k]; jj<xadj[k+1]; jj++) { in Test_PartGraph()
524 for (j=xadj[i]; j<xadj[i+1]; j++) in VerifyPart()
573 for (j=xadj[i]; j<xadj[i+1]; j++) in VerifyWPart()
858 for (j=xadj[i]; j<xadj[i+1]; j++) { in VerifyPartV()
914 for (j=xadj[i]; j<xadj[i+1]; j++) { in VerifyWPartV()
967 for (j=xadj[i]; j<xadj[i+1]; j++) { in Test_PartGraphmC()
971 for (jj=xadj[k]; jj<xadj[k+1]; jj++) { in Test_PartGraphmC()
[all …]
/dports/math/py-PyMetis/PyMetis-2020.1/pymetis/
H A D__init__.py35 def _prepare_graph(adjacency, xadj, adjncy): argument
37 assert xadj is None
40 xadj = [0]
48 xadj.append(len(adjncy))
50 assert xadj is not None
53 return xadj, adjncy
56 def nested_dissection(adjacency=None, xadj=None, adjncy=None): argument
64 xadj, adjncy = _prepare_graph(adjacency, xadj, adjncy)
67 return edge_nd(xadj, adjncy)
105 xadj, adjncy = _prepare_graph(adjacency, xadj, adjncy)
[all …]
/dports/math/parmetis/parmetis-4.0.3/metis/libmetis/
H A Dcompress.c40 for (j=xadj[i]; j<xadj[i+1]; j++) in CompressGraph()
53 for (j=xadj[ii]; j<xadj[ii+1]; j++) in CompressGraph()
62 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii]) in CompressGraph()
66 for (jj=xadj[iii]; jj<xadj[iii+1]; jj++) { in CompressGraph()
95 cnedges += xadj[ii+1]-xadj[ii]; in CompressGraph()
116 for (jj=xadj[ii]; jj<xadj[ii+1]; jj++) { in CompressGraph()
160 factor = factor*xadj[nvtxs]/nvtxs; in PruneGraph()
164 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
167 pnedges += xadj[i+1]-xadj[i]; in PruneGraph()
191 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
[all …]
H A Ddebug.c55 xadj = graph->xadj; in ComputeVolume()
66 for (j=xadj[i]; j<xadj[i+1]; j++) { in ComputeVolume()
127 xadj = graph->xadj; in CheckBnd()
134 if (xadj[i+1]-xadj[i] == 0) in CheckBnd()
137 for (j=xadj[i]; j<xadj[i+1]; j++) { in CheckBnd()
164 xadj = graph->xadj; in CheckBnd2()
172 for (j=xadj[i]; j<xadj[i+1]; j++) { in CheckBnd2()
201 xadj = graph->xadj; in CheckNodeBnd()
262 xadj = graph->xadj; in CheckNodePartitionParams()
315 xadj = graph->xadj; in IsSeparable()
[all …]
/dports/math/py-PyMetis/PyMetis-2020.1/src/metis/libmetis/
H A Dcompress.c40 for (j=xadj[i]; j<xadj[i+1]; j++)
53 for (j=xadj[ii]; j<xadj[ii+1]; j++)
62 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii])
66 for (jj=xadj[iii]; jj<xadj[iii+1]; jj++) {
95 cnedges += xadj[ii+1]-xadj[ii];
116 for (jj=xadj[ii]; jj<xadj[ii+1]; jj++) {
160 factor = factor*xadj[nvtxs]/nvtxs;
164 if (xadj[i+1]-xadj[i] < factor) {
167 pnedges += xadj[i+1]-xadj[i];
191 if (xadj[i+1]-xadj[i] < factor) {
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/libmetis/
H A Dcompress.c40 for (j=xadj[i]; j<xadj[i+1]; j++) in CompressGraph()
53 for (j=xadj[ii]; j<xadj[ii+1]; j++) in CompressGraph()
62 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii]) in CompressGraph()
66 for (jj=xadj[iii]; jj<xadj[iii+1]; jj++) { in CompressGraph()
95 cnedges += xadj[ii+1]-xadj[ii]; in CompressGraph()
116 for (jj=xadj[ii]; jj<xadj[ii+1]; jj++) { in CompressGraph()
160 factor = factor*xadj[nvtxs]/nvtxs; in PruneGraph()
164 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
167 pnedges += xadj[i+1]-xadj[i]; in PruneGraph()
191 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/metis/libmetis/
H A Dcompress.c40 for (j=xadj[i]; j<xadj[i+1]; j++) in CompressGraph()
53 for (j=xadj[ii]; j<xadj[ii+1]; j++) in CompressGraph()
62 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii]) in CompressGraph()
66 for (jj=xadj[iii]; jj<xadj[iii+1]; jj++) { in CompressGraph()
95 cnedges += xadj[ii+1]-xadj[ii]; in CompressGraph()
116 for (jj=xadj[ii]; jj<xadj[ii+1]; jj++) { in CompressGraph()
160 factor = factor*xadj[nvtxs]/nvtxs; in PruneGraph()
164 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
167 pnedges += xadj[i+1]-xadj[i]; in PruneGraph()
191 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
[all …]
/dports/science/octopus/octopus-10.5/external_libs/metis-5.1/libmetis/
H A Dcompress.c40 for (j=xadj[i]; j<xadj[i+1]; j++) in CompressGraph()
53 for (j=xadj[ii]; j<xadj[ii+1]; j++) in CompressGraph()
62 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii]) in CompressGraph()
66 for (jj=xadj[iii]; jj<xadj[iii+1]; jj++) { in CompressGraph()
95 cnedges += xadj[ii+1]-xadj[ii]; in CompressGraph()
116 for (jj=xadj[ii]; jj<xadj[ii+1]; jj++) { in CompressGraph()
160 factor = factor*xadj[nvtxs]/nvtxs; in PruneGraph()
164 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
167 pnedges += xadj[i+1]-xadj[i]; in PruneGraph()
191 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
[all …]
/dports/math/metis/metis-5.1.0/libmetis/
H A Dcompress.c40 for (j=xadj[i]; j<xadj[i+1]; j++) in CompressGraph()
53 for (j=xadj[ii]; j<xadj[ii+1]; j++) in CompressGraph()
62 if (keys[i].key != keys[j].key || xadj[ii+1]-xadj[ii] != xadj[iii+1]-xadj[iii]) in CompressGraph()
66 for (jj=xadj[iii]; jj<xadj[iii+1]; jj++) { in CompressGraph()
95 cnedges += xadj[ii+1]-xadj[ii]; in CompressGraph()
116 for (jj=xadj[ii]; jj<xadj[ii+1]; jj++) { in CompressGraph()
160 factor = factor*xadj[nvtxs]/nvtxs; in PruneGraph()
164 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
167 pnedges += xadj[i+1]-xadj[i]; in PruneGraph()
191 if (xadj[i+1]-xadj[i] < factor) { in PruneGraph()
[all …]

12345678910>>...30