/* * 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;igetCentreX()-rs[3]->getCentreX())<0.001); cout<getCentreX()<<","<getCentreX()<