1 files changed, 177 insertions, 0 deletions
diff --git a/src/3rdparty/adaptagrams/libcola/tests/topology.cpp b/src/3rdparty/adaptagrams/libcola/tests/topology.cpp
new file mode 100644
index 0000000..4c94ef7
--- /dev/null
+++ b/src/3rdparty/adaptagrams/libcola/tests/topology.cpp
@@ -0,0 +1,177 @@
+/*
+ * vim: ts=4 sw=4 et tw=0 wm=0
+ *
+ * libcola - A library providing force-directed network layout using the 
+ *           stress-majorization method subject to separation constraints.
+ *
+ * Copyright (C) 2006-2008  Monash University
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ *
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library in the file LICENSE; if not, 
+ * write to the Free Software Foundation, Inc., 59 Temple Place, 
+ * Suite 330, Boston, MA  02111-1307  USA
+ *
+*/
+
+/** \file topology.cpp
+ *
+ * tests topology preserving layout.  graph is a triangle.
+ * We have a fourth disconnected node starting inside the triangle.
+ * We give the disconnected node a desired position outside the triangle
+ * and begin layout.  Layout should converge to near zero stress as all
+ * edges should be able to reach their desired lengths, and disconnected
+ * node should still be inside the triangle at the end.
+ *
+ *
+ * Authors:
+ *   Tim Dwyer <tgdwyer@gmail.com>
+ */
+#include <iostream>
+#include <iomanip>
+#include <fstream>
+
+#include <vector>
+#include <valarray>
+#include <algorithm>
+#include <float.h>
+#include <libcola/cola.h>
+#include <libtopology/topology_graph.h>
+#include "graphlayouttest.h"
+using namespace std;
+using namespace cola;
+
+topology::Node* addNode(
+        topology::Nodes& vs, vpsc::Rectangle* r) {
+    topology::Node *v = new topology::Node(vs.size(), r);
+    vs.push_back(v);
+    return v;
+}
+void addToPath(topology::EdgePoints& ps, topology::Node *v, topology::EdgePoint::RectIntersect i) {
+    ps.push_back(new topology::EdgePoint(v,i));
+}
+struct SetDesiredPos : public PreIteration {
+    SetDesiredPos(Locks& locks) : PreIteration(locks) {}
+    bool operator()() { 
+        return true; 
+    }
+};
+void writeFile(const topology::Nodes& vs, const topology::Edges& es, const char *outputFileName) {
+    const unsigned n=vs.size();
+    vector<cola::Edge> cedges;
+
+    for(unsigned i=0;i<es.size();i++) {
+        cedges.push_back(make_pair(1,2));
+    }
+
+    vector<straightener::Route*> routes;
+    for(topology::Edges::const_iterator e=es.begin();e!=es.end();++e) {
+        routes.push_back((*e)->getRoute());
+    }
+
+    vector<string> labels(n);
+    for(unsigned i=0;i<n;++i) {
+        stringstream ss;
+        ss << i;
+        labels[i]=ss.str();
+    }
+
+    vector<vpsc::Rectangle*> rs;
+    for(topology::Nodes::const_iterator i=vs.begin();i!=vs.end();++i) {
+	    rs.push_back((*i)->rect);
+    }
+    OutputFile of(rs,cedges,nullptr,outputFileName,true,false);
+    of.setLabels(labels);
+    of.routes=&routes;
+    of.generate();
+
+    for_each(routes.begin(),routes.end(),delete_object());
+}
+struct Test : TestConvergence {
+    Test(const double d,const unsigned i,topology::Nodes& vs, topology::Edges& es) : TestConvergence(d,i), vs(vs), es(es) {}
+    bool operator()(const double new_stress, valarray<double> & X, valarray<double> & Y) {
+        cout << "stress="<<new_stress<<" iteration="<<iterations<<endl;
+        stringstream ss;
+        ss << "topology-" << setfill('0') << setw(3) << ++iterations << ".svg";
+        writeFile(vs,es,ss.str().c_str());
+        if(iterations<100) {
+            return false;
+        }
+        return true;
+        return TestConvergence::operator()(new_stress,X,Y);
+    }
+    double lastStress;
+    topology::Nodes& vs;
+    topology::Edges& es;
+};
+void randomMove(int i) {
+    printf("We have a triangle of three connected nodes and a fourth disconnected node.  We set the fourth node's desired position at a point some random direction outside the triangle.\n");
+    printf("Using srand=%d\n",i);
+    srand(i);
+    const unsigned V = 4;
+    Edge edge_array[] = { Edge(0, 1), Edge(1, 2), Edge(2, 0) };
+    const std::size_t E = sizeof(edge_array) / sizeof(Edge);
+    vector<Edge> es(edge_array,edge_array+E);
+    vector<vpsc::Rectangle*> rs;
+    double x[]={200,250,300,250},y[]={200,250,200,225},size=10;
+    for(unsigned i=0;i<V;++i) {
+        rs.push_back(new vpsc::Rectangle(x[i],x[i]+size,y[i],y[i]+size));
+    }
+    double idealLength=60;
+    // set up topology graph
+    topology::Nodes vs;
+    for(vector<Rectangle*>::iterator i = rs.begin(); i!=rs.end();++i) {
+        addNode(vs,*i);
+    }
+    topology::Edges tes;
+    unsigned eID=0;
+    for(vector<Edge>::iterator e=es.begin();e!=es.end();++e, ++eID) {
+        topology::EdgePoints ps;
+        addToPath(ps,vs[e->first],topology::EdgePoint::CENTRE);
+        addToPath(ps,vs[e->second],topology::EdgePoint::CENTRE);
+        tes.push_back(new topology::Edge(eID, idealLength, ps));
+    }
+    writeFile(vs,tes,"topology-000.svg");
+    Locks locks;
+    // we move the 4th node somewhere outside the triangle.  The triangle should be
+    // dragged along!
+    const double PI = 2.0*acos(0.0);
+    double angle = getRand(2.0*PI);
+    double dx=150*cos(angle), dy=150*sin(angle);
+    
+    double lx=rs[3]->getCentreX()+dx,
+           ly=rs[3]->getCentreY()+dy;
+    //double lx=353.886210, ly=342.789705;
+    locks.push_back(Lock(3,lx,ly));
+    printf(" Lock: %f,%f\n",lx,ly);
+    SetDesiredPos preIteration(locks);
+    Test test(0.00001,100,vs,tes);
+    ConstrainedFDLayout alg(rs,es,idealLength,nullptr,test,&preIteration);
+
+    alg.setTopology(&vs,&tes);
+    alg.run(true,true);
+    double finalStress=alg.computeStress();
+    printf("finalStress=%f\n",finalStress);
+
+    //assert(finalStress<1e-5);
+    for_each(rs.begin(),rs.end(),delete_object());
+    for_each(tes.begin(),tes.end(),delete_object());
+    for_each(vs.begin(),vs.end(),delete_object());
+}
+int main() {
+    unsigned i=0;
+    for(;i<1;i++) {
+        randomMove(i);
+    }
+    return 0;
+}
+// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=4:softtabstop=4:textwidth=80 :