Home
last modified time | relevance | path

Searched refs:adjncy (Results 1 – 25 of 658) sorted by relevance

12345678910>>...27

/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.c27 if (where[i] != where[graph->adjncy[j]]) in ComputeCut()
53 adjncy = graph->adjncy; in CheckBnd()
63 if (where[i] != where[adjncy[j]]) { in CheckBnd()
89 adjncy = graph->adjncy; in CheckBnd2()
97 if (where[i] != where[adjncy[j]]) in CheckBnd2()
124 adjncy = graph->adjncy; in CheckNodeBnd()
179 adjncy = graph->adjncy; in CheckNodePartitionParams()
196 other = where[adjncy[j]]; in CheckNodePartitionParams()
220 idxtype *xadj, *adjncy, *where; in IsSeparable() local
224 adjncy = graph->adjncy; in IsSeparable()
[all …]
H A Dmincover.c58 if (mate[adjncy[j]] == -1) { in MinCover()
59 mate[i] = adjncy[j]; in MinCover()
60 mate[adjncy[j]] = i; in MinCover()
90 col = adjncy[j]; in MinCover()
116 MinCover_Decompose(xadj, adjncy, asize, bsize, mate, cover, csize); in MinCover()
134 row = adjncy[i]; in MinCover_Augment()
180 MinCover_ColDFS(xadj, adjncy, i, mate, where, INCOL); in MinCover_Decompose()
183 MinCover_RowDFS(xadj, adjncy, i, mate, where, INROW); in MinCover_Decompose()
221 MinCover_ColDFS(xadj, adjncy, adjncy[i], mate, where, INROW); in MinCover_ColDFS()
228 MinCover_ColDFS(xadj, adjncy, mate[root], mate, where, INCOL); in MinCover_ColDFS()
[all …]
/dports/graphics/colmap/colmap-3.6/lib/Graclus/metisLib/
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.c31 adjncy = graph->adjncy; in ComputeRAsso()
41 if (cm == where[adjncy[j]]) in ComputeRAsso()
42 rasso[where[adjncy[j]]] ++; in ComputeRAsso()
49 if (cm == where[adjncy[j]]) in ComputeRAsso()
78 adjncy = graph->adjncy; in ComputeNCut()
152 adjncy = graph->adjncy; in CheckBnd()
188 adjncy = graph->adjncy; in CheckBnd2()
223 adjncy = graph->adjncy; in CheckNodeBnd()
278 adjncy = graph->adjncy; in CheckNodePartitionParams()
323 adjncy = graph->adjncy; in IsSeparable()
[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.c27 if (where[i] != where[graph->adjncy[j]]) in ComputeCut()
53 adjncy = graph->adjncy; in CheckBnd()
63 if (where[i] != where[adjncy[j]]) { in CheckBnd()
89 adjncy = graph->adjncy; in CheckBnd2()
97 if (where[i] != where[adjncy[j]]) in CheckBnd2()
124 adjncy = graph->adjncy; in CheckNodeBnd()
179 adjncy = graph->adjncy; in CheckNodePartitionParams()
196 other = where[adjncy[j]]; in CheckNodePartitionParams()
220 idxtype *xadj, *adjncy, *where; in IsSeparable() local
224 adjncy = graph->adjncy; in IsSeparable()
[all …]
/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Mumps/MUMPS/PORD/lib/
H A Dgraph.c76 free(G->adjncy); in freeGraph()
114 adjncy = G->adjncy; in randomizeGraph()
122 swap(adjncy[i], adjncy[i+j], v); in randomizeGraph()
139 adjncy = G->adjncy; in setupSubgraph()
181 { v = adjncy[j]; in setupSubgraph()
211 adjncy = G->adjncy; in setupGraphFromMtx()
281 adjncy = G->adjncy; in setupGridGraph()
319 adjncy = G->adjncy; in setupGridGraph()
350 adjncy = G->adjncy; in connectedComponents()
406 adjncy = G->adjncy; in indNodes()
[all …]
H A Dgelim.c238 adjncy = G->adjncy; in setupElimGraph()
309 adjncy = Gelim->G->adjncy; in crunchElimGraph()
341 adjncy[idest++] = adjncy[isrc++]; in crunchElimGraph()
365 adjncy = G->adjncy; in buildElement()
445 adjncy[G->nedges++] = adjncy[p]; in buildElement()
501 adjncy = Gelim->G->adjncy; in updateAdjncy()
527 { e = adjncy[j]; in updateAdjncy()
554 { v = adjncy[j]; in updateAdjncy()
645 adjncy = Gelim->G->adjncy; in findIndNodes()
768 adjncy = Gelim->G->adjncy; in updateDegree()
[all …]
/dports/math/coinmumps/MUMPS_4.10.0/PORD/lib/
H A Dgraph.c76 free(G->adjncy); in freeGraph()
114 adjncy = G->adjncy; in randomizeGraph()
122 swap(adjncy[i], adjncy[i+j], v); in randomizeGraph()
139 adjncy = G->adjncy; in setupSubgraph()
181 { v = adjncy[j]; in setupSubgraph()
211 adjncy = G->adjncy; in setupGraphFromMtx()
281 adjncy = G->adjncy; in setupGridGraph()
319 adjncy = G->adjncy; in setupGridGraph()
350 adjncy = G->adjncy; in connectedComponents()
406 adjncy = G->adjncy; in indNodes()
[all …]
H A Dgelim.c238 adjncy = G->adjncy; in setupElimGraph()
309 adjncy = Gelim->G->adjncy; in crunchElimGraph()
341 adjncy[idest++] = adjncy[isrc++]; in crunchElimGraph()
365 adjncy = G->adjncy; in buildElement()
445 adjncy[G->nedges++] = adjncy[p]; in buildElement()
501 adjncy = Gelim->G->adjncy; in updateAdjncy()
527 { e = adjncy[j]; in updateAdjncy()
554 { v = adjncy[j]; in updateAdjncy()
645 adjncy = Gelim->G->adjncy; in findIndNodes()
768 adjncy = Gelim->G->adjncy; in updateDegree()
[all …]
/dports/math/mumps4/MUMPS_4.10.0/PORD/lib/
H A Dgraph.c76 free(G->adjncy); in freeGraph()
114 adjncy = G->adjncy; in randomizeGraph()
122 swap(adjncy[i], adjncy[i+j], v); in randomizeGraph()
139 adjncy = G->adjncy; in setupSubgraph()
181 { v = adjncy[j]; in setupSubgraph()
211 adjncy = G->adjncy; in setupGraphFromMtx()
281 adjncy = G->adjncy; in setupGridGraph()
319 adjncy = G->adjncy; in setupGridGraph()
350 adjncy = G->adjncy; in connectedComponents()
406 adjncy = G->adjncy; in indNodes()
[all …]
H A Dgelim.c238 adjncy = G->adjncy; in setupElimGraph()
309 adjncy = Gelim->G->adjncy; in crunchElimGraph()
341 adjncy[idest++] = adjncy[isrc++]; in crunchElimGraph()
365 adjncy = G->adjncy; in buildElement()
445 adjncy[G->nedges++] = adjncy[p]; in buildElement()
501 adjncy = Gelim->G->adjncy; in updateAdjncy()
527 { e = adjncy[j]; in updateAdjncy()
554 { v = adjncy[j]; in updateAdjncy()
645 adjncy = Gelim->G->adjncy; in findIndNodes()
768 adjncy = Gelim->G->adjncy; in updateDegree()
[all …]
/dports/math/mumps/mumps-5.1.2/PORD/lib/
H A Dgraph.c76 free(G->adjncy); in freeGraph()
114 adjncy = G->adjncy; in randomizeGraph()
122 swap(adjncy[i], adjncy[i+j], v); in randomizeGraph()
139 adjncy = G->adjncy; in setupSubgraph()
181 { v = adjncy[j]; in setupSubgraph()
211 adjncy = G->adjncy; in setupGraphFromMtx()
281 adjncy = G->adjncy; in setupGridGraph()
319 adjncy = G->adjncy; in setupGridGraph()
350 adjncy = G->adjncy; in connectedComponents()
406 adjncy = G->adjncy; in indNodes()
[all …]
H A Dgelim.c238 adjncy = G->adjncy; in setupElimGraph()
309 adjncy = Gelim->G->adjncy; in crunchElimGraph()
341 adjncy[idest++] = adjncy[isrc++]; in crunchElimGraph()
365 adjncy = G->adjncy; in buildElement()
445 adjncy[G->nedges++] = adjncy[p]; in buildElement()
501 adjncy = Gelim->G->adjncy; in updateAdjncy()
527 { e = adjncy[j]; in updateAdjncy()
554 { v = adjncy[j]; in updateAdjncy()
645 adjncy = Gelim->G->adjncy; in findIndNodes()
768 adjncy = Gelim->G->adjncy; in updateDegree()
[all …]
/dports/math/py-PyMetis/PyMetis-2020.1/pymetis/
H A D__init__.py35 def _prepare_graph(adjacency, xadj, adjncy): argument
38 assert adjncy is None
41 adjncy = []
47 adjncy += list(map(int, adj))
48 xadj.append(len(adjncy))
51 assert adjncy 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)
[all …]
/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Metis/metis-4.0/Test/
H A Dmtest.c44 Test_PartGraph(graph.nvtxs, graph.xadj, graph.adjncy); in main()
46 Test_PartGraphV(graph.nvtxs, graph.xadj, graph.adjncy); in main()
50 Test_ND(graph.nvtxs, graph.xadj, graph.adjncy); in main()
78 k = adjncy[j]; in Test_PartGraph()
82 if (adjncy[jj] == i) { in Test_PartGraph()
859 if (marker[part[adjncy[j]]] != i) { in VerifyPartV()
861 marker[part[adjncy[j]]] = i; in VerifyPartV()
915 if (marker[part[adjncy[j]]] != i) { in VerifyWPartV()
917 marker[part[adjncy[j]]] = i; in VerifyWPartV()
968 k = adjncy[j]; in Test_PartGraphmC()
[all …]
/dports/math/igraph/igraph-0.9.5/vendor/glpk/misc/
H A Dqmd.c6 void genqmd(int *neqns, int xadj[], int adjncy[], int perm[], in genqmd() argument
12 xassert(adjncy == adjncy); in genqmd()
27 void qmdrch(int *root, int xadj[], int adjncy[], int deg[], in qmdrch() argument
33 xassert(adjncy == adjncy); in qmdrch()
45 void qmdqt(int *root, int xadj[], int adjncy[], int marker[], in qmdqt() argument
50 xassert(adjncy == adjncy); in qmdqt()
60 void qmdupd(int xadj[], int adjncy[], int *nlist, int list[], in qmdupd() argument
65 xassert(adjncy == adjncy); in qmdupd()
79 void qmdmrg(int xadj[], int adjncy[], int deg[], int qsize[], in qmdmrg() argument
84 xassert(adjncy == adjncy); in qmdmrg()
/dports/math/glpk/glpk-5.0/src/misc/
H A Dqmd.c6 void genqmd(int *neqns, int xadj[], int adjncy[], int perm[], in genqmd() argument
12 xassert(adjncy == adjncy); in genqmd()
27 void qmdrch(int *root, int xadj[], int adjncy[], int deg[], in qmdrch() argument
33 xassert(adjncy == adjncy); in qmdrch()
45 void qmdqt(int *root, int xadj[], int adjncy[], int marker[], in qmdqt() argument
50 xassert(adjncy == adjncy); in qmdqt()
60 void qmdupd(int xadj[], int adjncy[], int *nlist, int list[], in qmdupd() argument
65 xassert(adjncy == adjncy); in qmdupd()
79 void qmdmrg(int xadj[], int adjncy[], int deg[], int qsize[], in qmdmrg() argument
84 xassert(adjncy == adjncy); in qmdmrg()
/dports/math/parmetis/parmetis-4.0.3/metis/libmetis/
H A Ddebug.c56 adjncy = graph->adjncy; in ComputeVolume()
67 k = where[adjncy[j]]; in ComputeVolume()
128 adjncy = graph->adjncy; in CheckBnd()
165 adjncy = graph->adjncy; in CheckBnd2()
202 adjncy = graph->adjncy; in CheckNodeBnd()
264 adjncy = graph->adjncy; in CheckNodePartitionParams()
316 adjncy = graph->adjncy; in IsSeparable()
326 i, where[i], adjncy[j], where[adjncy[j]], xadj[i+1]-xadj[i], in IsSeparable()
327 xadj[adjncy[j]+1]-xadj[adjncy[j]])); in IsSeparable()
351 adjncy = graph->adjncy; in CheckKWayVolPartitionParams()
[all …]
/dports/math/py-PyMetis/PyMetis-2020.1/src/metis/libmetis/
H A Ddebug.c56 adjncy = graph->adjncy;
67 k = where[adjncy[j]];
128 adjncy = graph->adjncy; in ComputeBFSOrdering()
165 adjncy = graph->adjncy;
202 adjncy = graph->adjncy;
264 adjncy = graph->adjncy;
316 adjncy = graph->adjncy;
326 i, where[i], adjncy[j], where[adjncy[j]], xadj[i+1]-xadj[i],
327 xadj[adjncy[j]+1]-xadj[adjncy[j]]));
351 adjncy = graph->adjncy; in EliminateComponents()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/libmetis/
H A Ddebug.c56 adjncy = graph->adjncy; in ComputeVolume()
67 k = where[adjncy[j]]; in ComputeVolume()
128 adjncy = graph->adjncy; in CheckBnd()
165 adjncy = graph->adjncy; in CheckBnd2()
202 adjncy = graph->adjncy; in CheckNodeBnd()
264 adjncy = graph->adjncy; in CheckNodePartitionParams()
316 adjncy = graph->adjncy; in IsSeparable()
326 i, where[i], adjncy[j], where[adjncy[j]], xadj[i+1]-xadj[i], in IsSeparable()
327 xadj[adjncy[j]+1]-xadj[adjncy[j]])); in IsSeparable()
351 adjncy = graph->adjncy; in CheckKWayVolPartitionParams()
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/metis/libmetis/
H A Ddebug.c56 adjncy = graph->adjncy; in ComputeVolume()
67 k = where[adjncy[j]]; in ComputeVolume()
128 adjncy = graph->adjncy; in CheckBnd()
165 adjncy = graph->adjncy; in CheckBnd2()
202 adjncy = graph->adjncy; in CheckNodeBnd()
264 adjncy = graph->adjncy; in CheckNodePartitionParams()
316 adjncy = graph->adjncy; in IsSeparable()
326 i, where[i], adjncy[j], where[adjncy[j]], xadj[i+1]-xadj[i], in IsSeparable()
327 xadj[adjncy[j]+1]-xadj[adjncy[j]])); in IsSeparable()
351 adjncy = graph->adjncy; in CheckKWayVolPartitionParams()
[all …]
/dports/science/octopus/octopus-10.5/external_libs/metis-5.1/libmetis/
H A Ddebug.c56 adjncy = graph->adjncy; in ComputeVolume()
67 k = where[adjncy[j]]; in ComputeVolume()
128 adjncy = graph->adjncy; in CheckBnd()
165 adjncy = graph->adjncy; in CheckBnd2()
202 adjncy = graph->adjncy; in CheckNodeBnd()
264 adjncy = graph->adjncy; in CheckNodePartitionParams()
316 adjncy = graph->adjncy; in IsSeparable()
326 i, where[i], adjncy[j], where[adjncy[j]], xadj[i+1]-xadj[i], in IsSeparable()
327 xadj[adjncy[j]+1]-xadj[adjncy[j]])); in IsSeparable()
351 adjncy = graph->adjncy; in CheckKWayVolPartitionParams()
[all …]
/dports/math/metis/metis-5.1.0/libmetis/
H A Ddebug.c56 adjncy = graph->adjncy; in ComputeVolume()
67 k = where[adjncy[j]]; in ComputeVolume()
128 adjncy = graph->adjncy; in CheckBnd()
165 adjncy = graph->adjncy; in CheckBnd2()
202 adjncy = graph->adjncy; in CheckNodeBnd()
264 adjncy = graph->adjncy; in CheckNodePartitionParams()
316 adjncy = graph->adjncy; in IsSeparable()
326 i, where[i], adjncy[j], where[adjncy[j]], xadj[i+1]-xadj[i], in IsSeparable()
327 xadj[adjncy[j]+1]-xadj[adjncy[j]])); in IsSeparable()
351 adjncy = graph->adjncy; in CheckKWayVolPartitionParams()
[all …]

12345678910>>...27