#include <boost/graph/adjacency_list.hpp>

#include <cassert>
#include <iostream>

int main()
{
  
  typedef boost::adjacency_list < boost::vecS, // edges
    boost::vecS, // nodes
    boost::undirectedS > tGraph;
  
  typedef boost::graph_traits < tGraph >::vertex_descriptor	tNode;
  typedef boost::graph_traits < tGraph >::edge_descriptor	tEdge;
      
  tGraph  myGraph;
  
  tNode vertex1 = boost::add_vertex(myGraph);
  tNode vertex2 = boost::add_vertex(myGraph);
  
  bool bSuccess;
  
  std::cerr << "Adding edges.\n";
  
  tEdge edge1;
  
  boost::tie(edge1, bSuccess) = boost::add_edge(vertex1, vertex2, myGraph);
  
  assert(bSuccess);

  boost::print_graph(myGraph);

  std::cerr << "Removing edges.\n";
  
  boost::remove_edge(edge1, myGraph);
  
  boost::print_graph(myGraph);
}