remove debug messages

(bzr r1426)

2 files changed, 11 insertions, 16 deletions

diff --git a/src/graphlayout/graphlayout.cpp b/src/graphlayout/graphlayout.cpp
index 1b77b5afa..dc9dc3ea9 100644
--- a/src/graphlayout/graphlayout.cpp
+++ b/src/graphlayout/graphlayout.cpp
@@ -136,7 +136,7 @@ void graphlayout(GSList const *const items) {
 			map<string,unsigned>::iterator v_pair=nodelookup.find(iv->id);
 			if(v_pair!=nodelookup.end()) {
 				unsigned v=v_pair->second;
-				cout << "Edge: (" << u <<","<<v<<")"<<endl;
+				//cout << "Edge: (" << u <<","<<v<<")"<<endl;
 				es.push_back(make_pair(u,v));
 				if(conn->style->marker[SP_MARKER_LOC_END].set) {
 					if(directed && strcmp(conn->style->marker[SP_MARKER_LOC_END].value,"none")) {
@@ -157,13 +157,7 @@ void graphlayout(GSList const *const items) {
     connectedComponents(rs,es,scx,scy,cs);
     for(unsigned i=0;i<cs.size();i++) {
         Component* c=cs[i];
-		printf("Component %d:\n",i);
-		for(unsigned j=0;j<c->edges.size();j++) {
-			Edge& e=c->edges[j];
-			printf("(%d,%d) ",e.first,e.second);
-		}
         if(c->edges.size()<2) continue;
-		cout << endl;
         ConstrainedMajorizationLayout alg(c->rects,c->edges,eweights,ideal_connector_length);
         alg.setupConstraints(NULL,NULL,avoid_overlaps,
                 NULL,NULL,&c->scx,&c->scy,NULL,NULL);
diff --git a/src/libcola/connected_components.cpp b/src/libcola/connected_components.cpp
index f626649cd..7e72d46a7 100644
--- a/src/libcola/connected_components.cpp
+++ b/src/libcola/connected_components.cpp
@@ -26,7 +26,6 @@ namespace cola {
             urx=max(urx,rects[i]->getMaxX());
             ury=max(ury,rects[i]->getMaxY());
         }
-        printf("Bounding Box=(%f,%f,%f,%f)\n",llx,urx,lly,ury);
         return new Rectangle(llx,urx,lly,ury);
     }
 
@@ -74,9 +73,11 @@ namespace cola {
             vs[i].r=rs[i];
             remaining.insert(&vs[i]);
         }
-        for(vector<Edge>::const_iterator e=es.begin();e!=es.end();e++) {
-            vs[e->first].neighbours.push_back(&vs[e->second]);
-            vs[e->second].neighbours.push_back(&vs[e->first]);
+        vector<Edge>::const_iterator ei;
+        SimpleConstraints::const_iterator ci;
+        for(ei=es.begin();ei!=es.end();ei++) {
+            vs[ei->first].neighbours.push_back(&vs[ei->second]);
+            vs[ei->second].neighbours.push_back(&vs[ei->first]);
         }
         map<unsigned,pair<Component*,unsigned> > cmap;
         while(!remaining.empty()) {
@@ -85,13 +86,13 @@ namespace cola {
             dfs(v,remaining,component,cmap);
             components.push_back(component);
         }
-        for(vector<Edge>::const_iterator e=es.begin();e!=es.end();e++) {
-            pair<Component*,unsigned> u=cmap[e->first],
-                                      v=cmap[e->second];
+        for(ei=es.begin();ei!=es.end();ei++) {
+            pair<Component*,unsigned> u=cmap[ei->first],
+                                      v=cmap[ei->second];
             assert(u.first==v.first);
             u.first->edges.push_back(make_pair(u.second,v.second));
         }
-        for(SimpleConstraints::const_iterator ci=scx.begin();ci!=scx.end();ci++) {
+        for(ci=scx.begin();ci!=scx.end();ci++) {
             SimpleConstraint *c=*ci;
             pair<Component*,unsigned> u=cmap[c->left],
                                       v=cmap[c->right];
@@ -99,7 +100,7 @@ namespace cola {
             u.first->scx.push_back(
                     new SimpleConstraint(u.second,v.second,c->gap));
         }
-        for(SimpleConstraints::const_iterator ci=scy.begin();ci!=scy.end();ci++) {
+        for(ci=scy.begin();ci!=scy.end();ci++) {
             SimpleConstraint *c=*ci;
             pair<Component*,unsigned> u=cmap[c->left],
                                       v=cmap[c->right];