summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 5316077)
raw | patch | inline | side by side (parent: 5316077)
author | tgdwyer <tgdwyer@users.sourceforge.net> | |
Mon, 13 Feb 2006 05:32:36 +0000 (05:32 +0000) | ||
committer | tgdwyer <tgdwyer@users.sourceforge.net> | |
Mon, 13 Feb 2006 05:32:36 +0000 (05:32 +0000) |
src/graphlayout/graphlayout.cpp | patch | blob | history |
index e6b0173f87aa2350cebbd334c90f9d0e03635736..77452aff2323506d60934a4a2a221e86cb8c79ae 100644 (file)
#include "sp-conn-end-pair.h"
#include "conn-avoid-ref.h"
#include "libavoid/connector.h"
+#include "libavoid/geomtypes.h"
#include <boost/graph/kamada_kawai_spring_layout.hpp>
#include <boost/graph/circle_layout.hpp>
#include <boost/graph/adjacency_list.hpp>
-//#include <boost/graph/simple_point.hpp>
#include <boost/graph/graphviz.hpp>
#include <map>
#include <vector>
using namespace boost;
-struct simple_point {
- double x;
- double y;
-};
// create a typedef for the Graph type
typedef adjacency_list<vecS, vecS, undirectedS, no_property,
property<edge_weight_t, double> > Graph;
typedef property_map<Graph, edge_weight_t>::type WeightMap;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
-typedef std::vector<simple_point> PositionVec;
+typedef std::vector<Avoid::Point> PositionVec;
typedef iterator_property_map<PositionVec::iterator, property_map<Graph, vertex_index_t>::type> PositionMap;
bool isConnector(SPItem *i) {