summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: ca5afde)
raw | patch | inline | side by side (parent: ca5afde)
author | tgdwyer <tgdwyer@users.sourceforge.net> | |
Mon, 13 Feb 2006 05:17:03 +0000 (05:17 +0000) | ||
committer | tgdwyer <tgdwyer@users.sourceforge.net> | |
Mon, 13 Feb 2006 05:17:03 +0000 (05:17 +0000) |
src/graphlayout/graphlayout.cpp | patch | blob | history |
index 7ece03600b62fc6e9f1d91a346d4f0a1294d4e02..e6b0173f87aa2350cebbd334c90f9d0e03635736 100644 (file)
#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/simple_point.hpp>
#include <boost/graph/graphviz.hpp>
#include <map>
#include <vector>
#include <float.h>
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<double> > PositionVec;
+typedef std::vector<simple_point> PositionVec;
typedef iterator_property_map<PositionVec::iterator, property_map<Graph, vertex_index_t>::type> PositionMap;
bool isConnector(SPItem *i) {