summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 0e39cdf)
raw | patch | inline | side by side (parent: 0e39cdf)
author | tgdwyer <tgdwyer@users.sourceforge.net> | |
Mon, 13 Feb 2006 03:33:48 +0000 (03:33 +0000) | ||
committer | tgdwyer <tgdwyer@users.sourceforge.net> | |
Mon, 13 Feb 2006 03:33:48 +0000 (03:33 +0000) |
src/graphlayout/graphlayout.cpp | patch | blob | history |
index 9828e22fe6f0d3a2dd22946b2f06f4ae5a00016c..a99fdd720f6e9fdfeb09d8d3facdf6389c319fe5 100644 (file)
#include <config.h>
#ifdef HAVE_BOOST_GRAPH_LIB
+#include "sp-path.h"
#include "sp-item.h"
#include "sp-item-transform.h"
#include "sp-conn-end-pair.h"
Graph g;
- std::cout<<"Building graph with "<<n<<" nodes"<<std::endl;
double minX=DBL_MAX, minY=DBL_MAX, maxX=-DBL_MAX, maxY=-DBL_MAX;
std::map<std::string,Vertex> nodelookup;
{
SPItem *u=*it;
std::cout<<"id:"<<u->id<<std::endl;
- if(strncmp(u->id,"path",4)) {
+ SPPath *path = NULL;
+ if(SP_IS_PATH(u)) {
+ path = SP_PATH(u);
+ }
+ bool isConn = path && path->connEndPair.isAutoRoutingConn();
+ if(!isConn) {
+ std::cout<<" is a node."<<std::endl;
nodelookup[u->id]=add_vertex(g);
}
}