From ab5f8ff5869021958f4ae8b838c3d707a2e85eaa Mon Sep 17 00:00:00 2001 From: Marc Jeanmougin Date: Sun, 29 Apr 2018 16:25:32 +0200 Subject: Put adaptagrams into its own folder --- src/libcola/tests/unsatisfiable.cpp | 85 ------------------------------------- 1 file changed, 85 deletions(-) delete mode 100644 src/libcola/tests/unsatisfiable.cpp (limited to 'src/libcola/tests/unsatisfiable.cpp') diff --git a/src/libcola/tests/unsatisfiable.cpp b/src/libcola/tests/unsatisfiable.cpp deleted file mode 100644 index 4e768f7db..000000000 --- a/src/libcola/tests/unsatisfiable.cpp +++ /dev/null @@ -1,85 +0,0 @@ -/* - * 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 - * Interface between Inkscape code (SPItem) and graphlayout functions. - * - * Authors: - * Tim Dwyer - */ -#include - -#include -#include -#include -#include -#include -#include -#include "graphlayouttest.h" - -using namespace std; -using namespace cola; -int main() { - - const unsigned V = 2; - typedef pair < unsigned, unsigned >Edge; - Edge edge_array[] = { Edge(0, 1) }; - unsigned E = sizeof(edge_array) / sizeof(Edge); - vector es(edge_array,edge_array+E); - double width=100; - double height=100; - vector rs; - for(unsigned i=0;i::iterator i=e.path.begin(); - i!=e.path.end();i++) { - cout << **i << endl; - } - exit(1); - } - //assert(fabs(rs[0]->getCentreX()-rs[3]->getCentreX())<0.001); - cout<getCentreX()<<","<getCentreX()<