#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/graph_utility.hpp>

using namespace boost;
using std::vector;

struct bbox {
 int m_i;
 bbox(int i = 0) : m_i(i) {}
};

typedef adjacency_list<vecS, vecS, undirectedS, bbox> Graph;
Graph G;

int main()
{
	vector<bbox> A(10);
	std::generate(A.begin(), A.end(), rand);
	for (int i=0; i<A.size(); i++)
	{
     		add_vertex(A[i], G);
     	}

	for(size_t i = 0; i < A.size(); ++i)
	{

        	for( size_t j = i + 1 ; j < A.size(); ++j)
		{

                      add_edge(i, j, G);
		}
	}
	boost::print_graph(G);
	graph_traits<Graph>::vertex_iterator vi, vie;
	for (tie(vi, vie) = boost::vertices(G); vi != vie; ++vi)
	{
	     std::cout << "Vertex descriptor: " << *vi << " has associated bbox " 
	     	<< boost::get(boost::vertex_bundle, G, *vi).m_i; 
		std::cout << ", or equivalently " << boost::get(&bbox::m_i, G, *vi) << std::endl;
	}
	print_graph(G, boost::get(&bbox::m_i, G));
	return 0;
 }