#include <boost/config.hpp>

#include <iostream>

#include <iterator>

#include <vector>

#include <list>

#include <boost/pending/queue.hpp>

#include <boost/graph/adjacency_list.hpp>

#include <boost/graph/visitors.hpp>

#include <boost/graph/breadth_first_search.hpp>

#include <boost/graph/dijkstra_shortest_paths.hpp>

#include <boost/graph/graph_utility.hpp>

using namespace std;

using namespace boost;

typedef property<vertex_color_t, default_color_type,

property<vertex_distance_t,int> > VProperty;

typedef int weight_t;

typedef property<edge_weight_t,weight_t> EProperty;

typedef adjacency_list<vecS, vecS, directedS, VProperty, EProperty > Graph;

template <class Tag>

struct endl_printer

};

template <class Tag>

endl_printer<Tag> print_endl(std::ostream& os, Tag) {

return endl_printer<Tag>(os);

}

template <class PA, class Tag>

struct edge_printer

};

template <class PA, class Tag>

edge_printer<PA, Tag>

print_edge(PA pa, std::ostream& os, Tag) {

return edge_printer<PA, Tag>(pa, os);

}

template <class NewGraph, class Tag>

struct graph_copier

};

template <class NewGraph, class Tag>

inline graph_copier<NewGraph, Tag>

copy_graph(NewGraph& g, Tag) {

return graph_copier<NewGraph, Tag>(g);

}

template <class Graph, class Name>

void print(Graph& G, Name name)

}

int

main(int , char* [])

}