From: Matthew Fernandez <matthew.fernandez@gmail.com>
Date: Fri, 3 Dec 2021 02:51:34 +0000 (-0800)
Subject: topfish: remove disabled code
X-Git-Tag: 3.0.0~148^2~2
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=0678916593ac86472bcffb36f3eaded07a317125;p=graphviz

topfish: remove disabled code
---

diff --git a/lib/topfish/hierarchy.c b/lib/topfish/hierarchy.c
index e5375790b..896b2ae0c 100644
--- a/lib/topfish/hierarchy.c
+++ b/lib/topfish/hierarchy.c
@@ -212,17 +212,6 @@ maxmatch(v_data * graph,	/* array of vtx data for graph */
 	*(jptr++) = -1;
     }
 
-    // Option 1: random permutation
-#if 0
-    int temp;
-    for (i=0; i<nvtxs-1; i++) {
-          // use long_rand() (not rand()), as n may be greater than RAND_MAX
-	j=i+long_rand()%(nvtxs-i); 
-	temp=order[i];
-	order[i]=order[j];
-	order[j]=temp;
-    }
-#endif
     // Option 2: sort the nodes beginning with the ones highly approriate for matching
 
 #ifdef DEBUG
@@ -1102,23 +1091,6 @@ find_closest_active_node(Hierarchy * hierarchy, double x, double y,
     return min_dist;
 }
 
-#if 0
-int find_random_descendant(Hierarchy * hierarchy, int node, int level,
-			   int cur_level)
-{
-    int inc;
-    while (level > cur_level) {
-	if (hierarchy->cv2v[level][2 * node + 1] >= 0) {
-	    inc = rand() % 2;
-	} else {
-	    inc = 0;
-	}
-	node = hierarchy->cv2v[level--][2 * node + inc];
-    }
-    return node;
-}
-#endif
-
 int
 init_ex_graph(v_data * graph1, v_data * graph2, int n,
 	      double *x_coords, double *y_coords, ex_vtx_data ** gp)