{

using namespace boost;

using namespace std;

typedef adjacency_list<vecS, listS, undirectedS,

VertexProperties, EdgeProperties> Graph;

const int V = 5;

Graph g(V);

property_map<Graph, std::size_t VertexProperties::*>::type

id = get(&VertexProperties::index, g);

property_map<Graph, std::string EdgeProperties::*>::type

name = get(&EdgeProperties::name, g);

boost::graph_traits<Graph>::vertex_iterator vi, viend;

int vnum = 0;

for (boost::tie(vi,viend) = vertices(g); vi != viend; ++vi)

id[*vi] = vnum++;

add_edge(vertex(0, g), vertex(1, g), EdgeProperties("joe"), g);

add_edge(vertex(1, g), vertex(2, g), EdgeProperties("curly"), g);

add_edge(vertex(1, g), vertex(3, g), EdgeProperties("dick"), g);

add_edge(vertex(2, g), vertex(4, g), EdgeProperties("tom"), g);

add_edge(vertex(3, g), vertex(4, g), EdgeProperties("harry"), g);

graph_traits<Graph>::vertex_iterator i, end;

graph_traits<Graph>::out_edge_iterator ei, edge_end;

for (boost::tie(i,end) = vertices(g); i != end; ++i) {

cout << id[*i] << " ";

for (boost::tie(ei,edge_end) = out_edges(*i, g); ei != edge_end; ++ei)

cout << " --" << name[*ei] << "--> " << id[target(*ei, g)] << " ";

cout << endl;

}

print_edges(g, id);

cout << endl << "removing edge (1,3): " << endl;

remove_edge(vertex(1, g), vertex(3, g), g);

ei = out_edges(vertex(1, g), g).first;

cout << "removing edge (" << id[source(*ei, g)]

<< "," << id[target(*ei, g)] << ")" << endl;

remove_edge(ei, g);

for(boost::tie(i,end) = vertices(g); i != end; ++i) {

cout << id[*i] << " ";

for (boost::tie(ei,edge_end) = out_edges(*i, g); ei != edge_end; ++ei)

cout << " --" << name[*ei] << "--> " << id[target(*ei, g)] << " ";

cout << endl;

}

print_edges(g, id);

return 0;