Home
last modified time | relevance | path

Searched defs:bestcut (Results 1 – 23 of 23) sorted by relevance

/dports/math/parmetis/parmetis-4.0.3/metis/libmetis/
H A Dinitpart.c118 bestcut=0, icut, mincut, inbfs; in RandomBisection() local
194 from, me, bestcut=0, icut, mincut, inbfs; in GrowBisection() local
328 idx_t i, ii, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs, qnum; in McRandomBisection() local
388 idx_t i, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs; in McGrowBisection() local
437 onemaxpwgt, from, me, bestcut=0, icut, mincut, inbfs; in GrowBisectionNode() local
573 idx_t i, j, k, nvtxs, bestcut=0, mincut, inbfs; in GrowBisectionNode2() local
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/libmetis/
H A Dinitpart.c118 bestcut=0, icut, mincut, inbfs; in RandomBisection() local
194 from, me, bestcut=0, icut, mincut, inbfs; in GrowBisection() local
328 idx_t i, ii, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs, qnum; in McRandomBisection() local
388 idx_t i, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs; in McGrowBisection() local
437 onemaxpwgt, from, me, bestcut=0, icut, mincut, inbfs; in GrowBisectionNode() local
573 idx_t i, j, k, nvtxs, bestcut=0, mincut, inbfs; in GrowBisectionNode2() local
/dports/math/libmesh/libmesh-1.6.2/contrib/metis/libmetis/
H A Dinitpart.c118 bestcut=0, icut, mincut, inbfs; in RandomBisection() local
194 from, me, bestcut=0, icut, mincut, inbfs; in GrowBisection() local
328 idx_t i, ii, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs, qnum; in McRandomBisection() local
388 idx_t i, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs; in McGrowBisection() local
437 onemaxpwgt, from, me, bestcut=0, icut, mincut, inbfs; in GrowBisectionNode() local
573 idx_t i, j, k, nvtxs, bestcut=0, mincut, inbfs; in GrowBisectionNode2() local
/dports/science/octopus/octopus-10.5/external_libs/metis-5.1/libmetis/
H A Dinitpart.c118 bestcut=0, icut, mincut, inbfs; in RandomBisection() local
194 from, me, bestcut=0, icut, mincut, inbfs; in GrowBisection() local
328 idx_t i, ii, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs, qnum; in McRandomBisection() local
388 idx_t i, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs; in McGrowBisection() local
437 onemaxpwgt, from, me, bestcut=0, icut, mincut, inbfs; in GrowBisectionNode() local
573 idx_t i, j, k, nvtxs, bestcut=0, mincut, inbfs; in GrowBisectionNode2() local
/dports/math/metis/metis-5.1.0/libmetis/
H A Dinitpart.c118 bestcut=0, icut, mincut, inbfs; in RandomBisection() local
194 from, me, bestcut=0, icut, mincut, inbfs; in GrowBisection() local
328 idx_t i, ii, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs, qnum; in McRandomBisection() local
388 idx_t i, j, k, nvtxs, ncon, from, bestcut=0, mincut, inbfs; in McGrowBisection() local
437 onemaxpwgt, from, me, bestcut=0, icut, mincut, inbfs; in GrowBisectionNode() local
573 idx_t i, j, k, nvtxs, bestcut=0, mincut, inbfs; in GrowBisectionNode2() local
/dports/net-p2p/bitcoin-utils/bitcoin-22.0/src/qt/
H A Daddresstablemodel.cpp118 break; in InitSeparator()
194 QVariant AddressTableModel::data(const QModelIndex &index, int role) const
328 return createIndex(row, column, priv->index(row));
389 strAddress = EncodeDestination(dest);
437 int AddressTableModel::lookupAddress(const QString &address) const
/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Metis/metis-4.0/Lib/
H A Dinitpart.c84 …int i, j, k, nvtxs, drain, nleft, first, last, pwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, ic… in GrowBisection() local
212 …, nleft, first, last, pwgts[2], tpwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me… in GrowBisectionNode() local
348 …int i, ii, j, k, nvtxs, pwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me, pass, n… in RandomBisection() local
H A Dminitpart.c59 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisection() local
107 int i, ii, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs, qnum; in MocRandomBisection() local
H A Dminitpart2.c59 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisection2() local
110 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisectionNew2() local
/dports/graphics/colmap/colmap-3.6/lib/Graclus/metisLib/
H A Dinitpart.c84 …int i, j, k, nvtxs, drain, nleft, first, last, pwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, ic… in GrowBisection() local
212 …, nleft, first, last, pwgts[2], tpwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me… in GrowBisectionNode() local
348 …int i, ii, j, k, nvtxs, pwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me, pass, n… in RandomBisection() local
H A Dminitpart.c59 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisection() local
107 int i, ii, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs, qnum; in MocRandomBisection() local
H A Dminitpart2.c59 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisection2() local
110 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisectionNew2() local
/dports/science/siconos/siconos-4.4.0/externals/lbl/metis4/
H A Dinitpart.c84 …int i, j, k, nvtxs, drain, nleft, first, last, pwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, ic… in GrowBisection() local
212 …, nleft, first, last, pwgts[2], tpwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me… in GrowBisectionNode() local
348 …int i, ii, j, k, nvtxs, pwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me, pass, n… in RandomBisection() local
H A Dminitpart.c59 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisection() local
107 int i, ii, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs, qnum; in MocRandomBisection() local
H A Dminitpart2.c59 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisection2() local
110 int i, j, k, nvtxs, ncon, from, bestcut, mincut, nbfs; in MocGrowBisectionNew2() local
/dports/biology/fasta3/fasta-36.3.8/src/
H A Dres_stats.c71 int bestcut=1; /* cut off for getting into MAX_BEST */ variable
/dports/biology/fasta/fasta/
H A Dres_stats.c38 int bestcut=1; /* cut off for getting into MAXBEST */ variable
H A Dprss.c71 int bestcut; /* cut off for getting into MAXBEST */ variable
H A Dprdf.c112 int bestcut; /* cut off for getting into MAXBEST */ variable
H A Dssearch.c159 int bestcut=1; /* cut off for getting into MAXBEST */ variable
H A Dfffasta.c306 int bestcut=1; /* cut off for getting into MAXBEST */ variable
/dports/math/igraph/igraph-0.9.5/src/flow/
H A Dflow.c1504 igraph_vector_t bestpartition, bestpartition2, bestcut; in igraph_i_mincut_directed() local
/dports/math/R-cran-igraph/igraph/src/
H A Dflow.c1491 igraph_vector_t bestpartition, bestpartition2, bestcut; in igraph_i_mincut_directed() local