#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/simple_point.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/circle_layout.hpp>
#include <boost/graph/fruchterman_reingold.hpp>
#include <boost/graph/kamada_kawai_spring_layout.hpp>
#include <iostream>

//typedef boost::square_topology<>::point_difference_type Point;
typedef boost::square_topology<>::point_type Point;

struct VertexProperties
{
	std::size_t index;
	Point point;
};

struct EdgeProperty
{
	EdgeProperty(const std::size_t &w):weight(w) {}
	double weight;
};


typedef boost::adjacency_list<boost::listS,
boost::listS, boost::undirectedS,
VertexProperties, EdgeProperty > Graph;

typedef boost::property_map<Graph, std::size_t VertexProperties::*>::type VertexIndexPropertyMap;
typedef boost::property_map<Graph, Point VertexProperties::*>::type PositionMap;
typedef boost::property_map<Graph, double EdgeProperty::*>::type WeightPropertyMap;

typedef boost::graph_traits<Graph>::vertex_descriptor VirtexDescriptor;

int main()
{
	Graph graph;

	VertexIndexPropertyMap vertexIdPropertyMap = boost::get(&VertexProperties::index, graph);

	for (int i = 0; i < 3; ++i) {
		VirtexDescriptor vd = boost::add_vertex(graph);
		vertexIdPropertyMap[vd] = i + 2;
	}

	boost::add_edge(boost::vertex(1, graph), boost::vertex(0, graph), EdgeProperty(5), graph);
	boost::add_edge(boost::vertex(2, graph), boost::vertex(0, graph), EdgeProperty(5), graph);
// 	boost::add_edge(boost::vertex(3, graph), boost::vertex(0, graph), EdgeProperty(5), graph);
// 	boost::add_edge(boost::vertex(4, graph), boost::vertex(0, graph), EdgeProperty(5), graph);
// 	boost::add_edge(boost::vertex(5, graph), boost::vertex(0, graph), EdgeProperty(5), graph);

	std::cout << "Vertices\n";
	boost::print_vertices(graph, vertexIdPropertyMap);

	std::cout << "Edges\n";
	boost::print_edges(graph, vertexIdPropertyMap);

	PositionMap positionMap = boost::get(&VertexProperties::point, graph);
	WeightPropertyMap weightPropertyMap = boost::get(&EdgeProperty::weight, graph);

	//boost::circle_graph_layout(graph, positionMap, 100);
	boost::fruchterman_reingold_force_directed_layout(graph, positionMap, boost::square_topology<>());

	/*
	boost::kamada_kawai_spring_layout(graph, positionMap, weightPropertyMap,
		boost::square_topology<>(), boost::side_length<double>(10), boost::layout_tolerance<>(),
		1, vertexIdPropertyMap);
	*/

	std::cout << "Coordinates\n";
	boost::graph_traits<Graph>::vertex_iterator i, end;
	for (boost::tie(i, end) = boost::vertices(graph); i != end; ++i) {
		std::cout << "ID: (" << vertexIdPropertyMap[*i] << ") x: " << positionMap[*i][0] << " y: " << positionMap[*i][1] << "\n";
	}

	return 0;
}


/*
 
1>------ Build started: Project: GraphTest, Configuration: Debug Win32 ------
1>Compiling...
1>GraphTest.cpp
1>d:\sourcen\boost_1_42_0\boost\property_map\property_map.hpp(355) : error C2678: binary '+' : no operator found which takes a left-hand operand of type 'const std::_Vector_iterator<_Ty,_Alloc>' (or there is no acceptable conversion)
1>        with
1>        [
1>            _Ty=PointDiff,
1>            _Alloc=std::allocator<PointDiff>
1>        ]
1>        d:\sourcen\boost_1_42_0\boost\graph\topology.hpp(56): could be 'boost::convex_topology<Dims>::point_difference boost::operator +(const boost::convex_topology<Dims>::point_difference &,const boost::convex_topology<Dims>::point_difference &)' [found using argument-dependent lookup]
1>        with
1>        [
1>            Dims=2
1>        ]
1>        c:\program files\microsoft visual studio 8\vc\include\vector(366): or 'std::_Vector_iterator<_Ty,_Alloc> std::_Vector_iterator<_Ty,_Alloc>::operator +(__w64 int) const'
1>        with
1>        [
1>            _Ty=PointDiff,
1>            _Alloc=std::allocator<PointDiff>
1>        ]
1>        while trying to match the argument list '(const std::_Vector_iterator<_Ty,_Alloc>, const boost::detail::error_property_not_found)'
1>        with
1>        [
1>            _Ty=PointDiff,
1>            _Alloc=std::allocator<PointDiff>
1>        ]
1>        d:\sourcen\boost_1_42_0\boost\property_map\property_map.hpp(355) : while compiling class template member function 'boost::convex_topology<Dims>::point_difference boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>::operator [](void *) const'
1>        with
1>        [
1>            Dims=2,
1>            RandomAccessIterator=std::_Vector_iterator<PointDiff,std::allocator<PointDiff>>,
1>            IndexMap=boost::adj_list_vertex_property_map<Graph,boost::detail::error_property_not_found,const boost::detail::error_property_not_found &,boost::vertex_index_t>,
1>            T=boost::convex_topology<2>::point_difference,
1>            R=boost::convex_topology<2>::point_difference &
1>        ]
1>        d:\sourcen\boost_1_42_0\boost\graph\fruchterman_reingold.hpp(392) : see reference to class template instantiation 'boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>' being compiled
1>        with
1>        [
1>            RandomAccessIterator=std::_Vector_iterator<PointDiff,std::allocator<PointDiff>>,
1>            IndexMap=boost::adj_list_vertex_property_map<Graph,boost::detail::error_property_not_found,const boost::detail::error_property_not_found &,boost::vertex_index_t>,
1>            T=boost::convex_topology<2>::point_difference,
1>            R=boost::convex_topology<2>::point_difference &
1>        ]
1>        d:\sourcen\boost_1_42_0\boost\graph\fruchterman_reingold.hpp(421) : see reference to function template instantiation 'void boost::detail::fr_force_directed_layout<boost::detail::error_property_not_found>::run<Topology,Graph,PositionMap,boost::square_distance_attractive_force,boost::square_distance_repulsive_force,boost::grid_force_pairs<Topology,PositionMap>,boost::linear_cooling<T>,boost::square_distance_attractive_force,boost::attractive_force_t,boost::no_property>(const Graph &,PositionMap,const Topology &,AttractiveForce,RepulsiveForce,ForcePairs,Cooling,boost::detail::error_property_not_found,const boost::bgl_named_params<boost::square_distance_attractive_force,Tag,Base> &)' being compiled
1>        with
1>        [
1>            Topology=boost::square_topology<>,
1>            Graph=Graph,
1>            PositionMap=PositionMap,
1>            T=double,
1>            AttractiveForce=boost::square_distance_attractive_force,
1>            RepulsiveForce=boost::square_distance_repulsive_force,
1>            ForcePairs=boost::grid_force_pairs<boost::square_topology<>,PositionMap>,
1>            Cooling=boost::linear_cooling<double>,
1>            Tag=boost::attractive_force_t,
1>            Base=boost::no_property
1>        ]
1>        d:\sourcen\boost_1_42_0\boost\graph\fruchterman_reingold.hpp(433) : see reference to function template instantiation 'void boost::fruchterman_reingold_force_directed_layout<Topology,Graph,PositionMap,boost::square_distance_attractive_force,boost::attractive_force_t,boost::no_property>(const Graph &,PositionMap,const Topology &,const boost::bgl_named_params<T,Tag,Base> &)' being compiled
1>        with
1>        [
1>            Topology=boost::square_topology<>,
1>            Graph=Graph,
1>            PositionMap=PositionMap,
1>            T=boost::square_distance_attractive_force,
1>            Tag=boost::attractive_force_t,
1>            Base=boost::no_property
1>        ]
1>        d:\sourcen\test\c++\graphtest\graphtest.cpp(64) : see reference to function template instantiation 'void boost::fruchterman_reingold_force_directed_layout<boost::square_topology<>,Graph,PositionMap>(const Graph &,PositionMap,const Topology &)' being compiled
1>        with
1>        [
1>            Graph=Graph,
1>            PositionMap=PositionMap,
1>            Topology=boost::square_topology<>
1>        ]
1>Build Time 0:04
1>Build log was saved at "file://d:\Sourcen\Test\C++\GraphTest\Debug\BuildLog.htm"
1>GraphTest - 1 error(s), 0 warning(s)
========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========
 
 
*/