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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
#include "cs_mex.h"
/* find an augmenting path starting at column j and extend the match if found */
static
CS_INT augment (CS_INT k, cs_dl *A, CS_INT *jmatch, CS_INT *cheap, CS_INT *w,
CS_INT j)
{
CS_INT found = 0, p, i = -1, *Ap = A->p, *Ai = A->i ;
/* --- Start depth-first-search at node j ------------------------------- */
w [j] = k ; /* mark j as visited for kth path */
for (p = cheap [j] ; p < Ap [j+1] && !found ; p++)
{
i = Ai [p] ; /* try a cheap assignment (i,j) */
found = (jmatch [i] == -1) ;
}
cheap [j] = p ; /* start here next time for j */
/* --- Depth-first-search of neighbors of j ----------------------------- */
for (p = Ap [j] ; p < Ap [j+1] && !found ; p++)
{
i = Ai [p] ; /* consider row i */
if (w [jmatch [i]] == k) continue ; /* skip col jmatch [i] if marked */
found = augment (k, A, jmatch, cheap, w, jmatch [i]) ;
}
if (found) jmatch [i] = j ; /* augment jmatch if path found */
return (found) ;
}
/* find a maximum transveral */
static
CS_INT *maxtrans (cs_dl *A) /* returns jmatch [0..m-1] */
{
CS_INT i, j, k, n, m, *Ap, *jmatch, *w, *cheap ;
if (!A) return (NULL) ; /* check inputs */
n = A->n ; m = A->m ; Ap = A->p ;
jmatch = cs_dl_malloc (m, sizeof (CS_INT)) ; /* allocate result */
w = cs_dl_malloc (2*n, sizeof (CS_INT)) ; /* allocate workspace */
if (!w || !jmatch) return (cs_dl_idone (jmatch, NULL, w, 0)) ;
cheap = w + n ;
for (j = 0 ; j < n ; j++) cheap [j] = Ap [j] ; /* for cheap assignment */
for (j = 0 ; j < n ; j++) w [j] = -1 ; /* all columns unflagged */
for (i = 0 ; i < m ; i++) jmatch [i] = -1 ; /* no rows matched yet */
for (k = 0 ; k < n ; k++) augment (k, A, jmatch, cheap, w, k) ;
return (cs_dl_idone (jmatch, NULL, w, 1)) ;
}
/* invert a maximum matching */
static CS_INT *invmatch (CS_INT *jmatch, CS_INT m, CS_INT n)
{
CS_INT i, j, *imatch ;
if (!jmatch) return (NULL) ;
imatch = cs_dl_malloc (n, sizeof (CS_INT)) ;
if (!imatch) return (NULL) ;
for (j = 0 ; j < n ; j++) imatch [j] = -1 ;
for (i = 0 ; i < m ; i++) if (jmatch [i] >= 0) imatch [jmatch [i]] = i ;
return (imatch) ;
}
void mexFunction
(
int nargout,
mxArray *pargout [ ],
int nargin,
const mxArray *pargin [ ]
)
{
cs_dl *A, Amatrix ;
double *x ;
CS_INT i, m, n, *imatch, *jmatch ;
if (nargout > 1 || nargin != 1)
{
mexErrMsgTxt ("Usage: p = cr_maxtransr(A)") ;
}
/* get inputs */
A = cs_dl_mex_get_sparse (&Amatrix, 0, 0, pargin [0]) ;
m = A->m ;
n = A->n ;
jmatch = maxtrans (A) ;
imatch = invmatch (jmatch, m, n) ; /* imatch = inverse of jmatch */
pargout [0] = mxCreateDoubleMatrix (1, n, mxREAL) ;
x = mxGetPr (pargout [0]) ;
for (i = 0 ; i < n ; i++) x [i] = imatch [i] + 1 ;
cs_free (jmatch) ;
cs_free (imatch) ;
}
|
