From: John Ellson <ellson@research.att.com>
Date: Wed, 6 Jan 2016 19:52:56 +0000 (-0500)
Subject: janitor - 1 -Wunused_function
X-Git-Tag: TRAVIS_CI_BUILD_EXPERIMENTAL~64
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=be239e517fc53dd4dcef7fa185c8d331781cc097;p=graphviz

janitor - 1 -Wunused_function
---

diff --git a/lib/mingle/agglomerative_bundling.c b/lib/mingle/agglomerative_bundling.c
index d01754367..27aa9f20f 100644
--- a/lib/mingle/agglomerative_bundling.c
+++ b/lib/mingle/agglomerative_bundling.c
@@ -296,7 +296,7 @@ static Agglomerative_Ink_Bundling Agglomerative_Ink_Bundling_establish(Agglomera
 }
 
 
-
+#ifndef  NOTUSED
 static Agglomerative_Ink_Bundling Agglomerative_Ink_Bundling_aggressive_establish(Agglomerative_Ink_Bundling grid, int *pick, real angle_param, real angle){
   /* this does a true single-linkage clustering: find the edge that gives the best saving, merge, find again. 
      As oppose to: find the edge of node i that gives the best ink saving, merge, then do the same for node i+1, etc etc.
@@ -541,6 +541,7 @@ static Agglomerative_Ink_Bundling Agglomerative_Ink_Bundling_aggressive_establis
   FREE(mask);
   return grid;
 }
+#endif
 
 static Agglomerative_Ink_Bundling Agglomerative_Ink_Bundling_new(SparseMatrix A0, pedge *edges, real angle_param, real angle){
   /* give a link of edges and their nearest neighbor graph, return a multilevel of edge bundling based on ink saving */