diff --git a/CCOLAMD/Source/ccolamd.c b/CCOLAMD/Source/ccolamd.c index 9a08e3ea8..2088149dd 100644 --- a/CCOLAMD/Source/ccolamd.c +++ b/CCOLAMD/Source/ccolamd.c @@ -671,9 +671,9 @@ typedef struct CColamd_Col_struct } shared1 ; union { - Int score ; + Int score ; Int order ; - } shared2 ; + } shared2 ; union { Int headhash ; /* head of a hash bucket, if col is at the head of */ @@ -728,9 +728,9 @@ typedef struct CColamd_Row_struct #define MIN(a,b) (((a) < (b)) ? (a) : (b)) /* Routines are either PUBLIC (user-callable) or PRIVATE (not user-callable) */ -#define GLOBAL +#define GLOBAL #define PUBLIC -#define PRIVATE static +#define PRIVATE static #define DENSE_DEGREE(alpha,n) \ ((Int) MAX (16.0, (alpha) * sqrt ((double) (n)))) @@ -808,9 +808,9 @@ PRIVATE Int ccolamd_debug ; #endif PRIVATE void ccolamd_get_debug -( +( char *method -) ; +) ; PRIVATE void debug_mark ( @@ -1560,7 +1560,6 @@ PUBLIC Int CCOLAMD_2 /* returns TRUE if successful, FALSE otherwise */ Int *dead_cols ; Int set1 ; Int set2 ; - Int cs ; int ok ; @@ -1909,7 +1908,6 @@ PUBLIC Int CCOLAMD_2 /* returns TRUE if successful, FALSE otherwise */ p [k] = col ; ASSERT (A [col] == EMPTY) ; - cs = CMEMBER (col) ; ASSERT (k >= cset_start [cs] && k < cset_start [cs+1]) ; A [col] = k ; @@ -1926,7 +1924,6 @@ PUBLIC Int CCOLAMD_2 /* returns TRUE if successful, FALSE otherwise */ if (A [col] == EMPTY) { k = Col [col].shared2.order ; - cs = CMEMBER (col) ; #ifndef NDEBUG dead_cols [cs]-- ; #endif @@ -3902,7 +3899,7 @@ GLOBAL void CCOLAMD_apply_order /* === CCOLAMD_fsize ======================================================== */ /* ========================================================================== */ -/* Determine the largest frontal matrix size for each subtree. +/* Determine the largest frontal matrix size for each subtree. * Only required to sort the children of each * node prior to postordering the column elimination tree. */ @@ -4014,7 +4011,7 @@ GLOBAL void CCOLAMD_postorder if (CMEMBER (Front_cols[parent]) == CMEMBER (Front_cols[j])) { Child [parent] = j ; - } + } } } }