Package edu.emory.mathcs.csparsej.tfloat.Scs_common

Examples of edu.emory.mathcs.csparsej.tfloat.Scs_common.Scsd


    public static boolean demo2(Sproblem Prob) {
        Scs A, C;
        float b[], x[], resid[], t, tol;
        int k, m, n, order, nb, ns, r[], s[], rr[], sprank;
        boolean ok;
        Scsd D;
        if (Prob == null)
            return (false);
        A = Prob.A;
        C = Prob.C;
        b = Prob.b;
View Full Code Here


     */
    public static Scsd cs_dmperm(Scs A, int seed) {
        int m, n, i, j, k, cnz, nc, jmatch[], imatch[], wi[], wj[], pinv[], Cp[], Ci[], ps[], rs[], nb1, nb2, p[], q[], cc[], rr[], r[], s[];
        boolean ok;
        Scs C;
        Scsd S, scc;
        /* --- Maximum matching ------------------------------------------------- */
        if (!Scs_util.CS_CSC(A))
            return (null); /* check inputs */
        m = A.m;
        n = A.n;
View Full Code Here

     * @param n
     *            number of columns of the matrix A to be analyzed
     * @return Sulmage-Mendelsohn decomposition
     */
    public static Scsd cs_dalloc(int m, int n) {
        Scsd S;
        S = new Scsd();
        S.p = new int[m];
        S.r = new int[m + 6];
        S.q = new int[n];
        S.s = new int[n + 6];
        S.cc = new int[5];
View Full Code Here

     * @return strongly connected components, null on error
     */
    public static Scsd cs_scc(Scs A) {
        int n, i, k, b, nb = 0, top, xi[], pstack[], p[], r[], Ap[], ATp[], rcopy[], Blk[];
        Scs AT;
        Scsd S;
        if (!Scs_util.CS_CSC(A))
            return (null); /* check inputs */
        n = A.n;
        Ap = A.p;
        S = Scs_util.cs_dalloc(n, 0); /* allocate result */
 
View Full Code Here

TOP

Related Classes of edu.emory.mathcs.csparsej.tfloat.Scs_common.Scsd

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.