#include <vector>
#include <utility>
#include <boost/variant.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/johnson_all_pairs_shortest.hpp>
using std::vector;

int main()
{
	typedef boost::variant<int, char> vic;
	vic q(3);
	int i = boost::get<int>(q);

	typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> Graph;
	typedef std::pair < int, int > Edge;
	vector<Edge> edges;
	const unsigned int N = 0;
	for(unsigned int j = 1; j < N; j++)
		edges.push_back(Edge(j, 0));
	Graph g(edges.begin(), edges.end(), N);
	int dists[N][N];
	boost::johnson_all_pairs_shortest_paths(g, dists);

	return 0;
}