1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
// CXSparse/MATLAB/CSparse/cs_dmperm_mex: Dulmage-Mendelsohn permutation
// CXSparse, Copyright (c) 2006-2022, Timothy A. Davis. All Rights Reserved.
// SPDX-License-Identifier: LGPL-2.1+
#include "cs_mex.h"
/* cs_dmperm: maximum matching or Dulmage-Mendelsohn permutation. */
void mexFunction
(
int nargout,
mxArray *pargout [ ],
int nargin,
const mxArray *pargin [ ]
)
{
double seed ;
cs_dl *A, Amatrix ;
cs_dld *D ;
int64_t m, n, *jmatch, iseed ;
if (nargin < 1 || nargin > 2 || nargout > 6)
{
mexErrMsgTxt ("Usage: [p,q,r,s,cc,rr] = cs_dmperm (A,seed)") ;
}
seed = (nargin > 1) ? mxGetScalar (pargin [1]) : 0 ; /* get seed */
iseed = (seed > 0 && seed < 1) ? (seed * RAND_MAX) : seed ;
A = cs_dl_mex_get_sparse (&Amatrix, 0, 0, pargin [0]) ; /* get A */
n = A->n ;
m = A->m ;
if (nargout <= 1)
{
jmatch = cs_dl_maxtrans (A, iseed) ; /* max. matching */
pargout [0] = cs_dl_mex_put_int (jmatch+m, n, 1, 0) ; /* return imatch */
cs_dl_free (jmatch) ;
}
else
{
D = cs_dl_dmperm (A, iseed) ; /* Dulmage-Mendelsohn decomposition */
pargout [0] = cs_dl_mex_put_int (D->p, m, 1, 0) ;
pargout [1] = cs_dl_mex_put_int (D->q, n, 1, 0) ;
pargout [2] = cs_dl_mex_put_int (D->r, D->nb+1, 1, 0) ;
pargout [3] = cs_dl_mex_put_int (D->s, D->nb+1, 1, 0) ;
pargout [4] = cs_dl_mex_put_int (D->cc, 5, 1, 0) ;
pargout [5] = cs_dl_mex_put_int (D->rr, 5, 1, 0) ;
cs_dl_dfree (D) ;
}
}
|
