#include <cstdlib>
#include <boost/graph/adjacency_list.hpp>

struct edge_t
{
  unsigned long first;
  unsigned long second;
};

int main()
{
  typedef boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> > undirected_graph;
  typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type;
  typedef boost::property_traits<weight_map_type>::value_type weight_type;
  
  typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor;
  typedef boost::graph_traits<undirected_graph>::edge_descriptor edge_descriptor;
  
  edge_t edges[] = {{1, 5}, {4, 5}, {5, 6}};
  weight_type ws[] = {2, 3, 1};
  undirected_graph g(edges, edges + 3, ws, 8, 3);
  
  add_edge(5, 5, g);
  clear_vertex(5, g);

  return EXIT_SUCCESS;
}