sfdpgen: remove unused 'maximal_independent_edge_set_heavest_edge_pernode'

diff --git a/lib/sfdpgen/Multilevel.c b/lib/sfdpgen/Multilevel.c
index 860df8b0da9a1f4b45ad48ea6054bf68d43b5e01..d6702ed87402ee057d63d5c01a448cdb8cac17ce 100644 (file)
--- a/lib/sfdpgen/Multilevel.c
+++ b/lib/sfdpgen/Multilevel.c
@@ -193,55 +193,6 @@ static void maximal_independent_edge_set(SparseMatrix A, int **matching, int *nm
   free(p);
 }
 
-static void maximal_independent_edge_set_heavest_edge_pernode(SparseMatrix A, int **matching, int *nmatch){
-  int i, ii, j, *ia, *ja, m, n, *p = NULL;
-  double *a, amax = 0;
-  int first = TRUE, jamax = 0;
-
-  assert(A);
-  assert(SparseMatrix_known_strucural_symmetric(A));
-  ia = A->ia;
-  ja = A->ja;
-  m = A->m;
-  n = A->n;
-  assert(n == m);
-  *matching = gv_calloc(m, sizeof(int));
-  for (i = 0; i < m; i++) (*matching)[i] = i;
-  *nmatch = n;
-
-  assert(SparseMatrix_is_symmetric(A, false));
-  assert(A->type == MATRIX_TYPE_REAL);
-
-  a = A->a;
-  p = random_permutation(m);
-  for (ii = 0; ii < m; ii++){
-    i = p[ii];
-    if ((*matching)[i] != i) continue;
-    first = TRUE;
-    for (j = ia[i]; j < ia[i+1]; j++){
-      if (i == ja[j]) continue;
-      if ((*matching)[ja[j]] == ja[j] && (*matching)[i] == i){
-        if (first) {
-          amax = a[j];
-          jamax = ja[j];
-          first = FALSE;
-        } else {
-          if (a[j] > amax){
-            amax = a[j];
-            jamax = ja[j];
-          }
-        }
-      }
-    }
-    if (!first){
-      (*matching)[jamax] = i;
-      (*matching)[i] = jamax;
-      (*nmatch)--;
-    }
-  }
-  free(p);
-}
-
 static void maximal_independent_edge_set_heavest_edge_pernode_supernodes_first(SparseMatrix A, int **cluster, int **clusterp, int *ncluster){
   int i, ii, j, *ia, *ja, m, n, *p = NULL;
   (void)n;