20 register sm_row *prow, *prow1;
21 register sm_col *pcol, *least_col;
28 for(prow = A->first_row; prow != 0; prow = prow->
next_row) {
32 for(p = prow->
first_col->next_col; p != 0; p = p->next_col) {
40 for(p = least_col->
first_row; p != 0; p = pnext) {
54 return rowcnt - A->nrows;
63 register sm_col *pcol, *pcol1;
72 for(pcol = A->first_col; pcol != 0; pcol = next_col) {
77 for(p = pcol->
first_row->next_row; p != 0; p = p->next_row) {
85 for(p = least_row->
first_col; p != 0; p = p->next_col) {
100 return colcnt - A->ncols;
int sm_col_dominance(sm_matrix *A, int *weight)
int sm_row_contains(sm_row *p1, sm_row *p2)
void sm_delrow(sm_matrix *A, int i)
#define sm_get_row(A, rownum)
#define ABC_NAMESPACE_IMPL_END
#define sm_get_col(A, colnum)
ABC_NAMESPACE_IMPL_START int sm_row_dominance(sm_matrix *A)
int sm_col_contains(sm_col *p1, sm_col *p2)
#define ABC_NAMESPACE_IMPL_START
typedefABC_NAMESPACE_HEADER_START struct sm_element_struct sm_element
void sm_delcol(sm_matrix *A, int i)