- if(sum_repeated) A = SparseMatrix_sum_repeat_entries(A, sum_repeated);
+ if(sum_repeated) A = SparseMatrix_sum_repeat_entries(A);
return A;
}
return D;
}
-SparseMatrix SparseMatrix_sum_repeat_entries(SparseMatrix A, int what_to_sum){
+SparseMatrix SparseMatrix_sum_repeat_entries(SparseMatrix A){
/* sum repeated entries in the same row, i.e., {1,1}->1, {1,1}->2 becomes {1,1}->3 */
int *ia = A->ia, *ja = A->ja, type = A->type, n = A->n;
int *mask = NULL, nz = 0, i, j, sta;
- if (what_to_sum == SUM_REPEATED_NONE) return A;
-
mask = MALLOC(sizeof(int)*((size_t)n));
for (i = 0; i < n; i++) mask[i] = -1;
SparseMatrix SparseMatrix_multiply3(SparseMatrix A, SparseMatrix B, SparseMatrix C);
enum {SUM_REPEATED_NONE = 0, SUM_REPEATED_ALL, };
-SparseMatrix SparseMatrix_sum_repeat_entries(SparseMatrix A, int what_to_sum);
+SparseMatrix SparseMatrix_sum_repeat_entries(SparseMatrix A);
SparseMatrix SparseMatrix_coordinate_form_add_entry(SparseMatrix A, int irn,
int jcn, void *val);
int SparseMatrix_is_symmetric(SparseMatrix A, bool test_pattern_symmetry_only);