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

using namespace boost;

int main(int argc, char** argv) {
    adjacency_list<listS,listS,undirectedS> g;
    typedef graph_traits<adjacency_list<listS,listS,undirectedS> >::vertex_descriptor Vertex;
    typedef graph_traits<adjacency_list<listS,listS,undirectedS> >::adjacency_iterator Adjacency_iter;

    Vertex verticesArr[4];
    for(int i = 0; i < 4; i++) {
        verticesArr[i] = add_vertex(g);
    }

    add_edge(verticesArr[0],verticesArr[1],g);
    add_edge(verticesArr[0],verticesArr[2],g); 
    add_edge(verticesArr[0],verticesArr[3],g);
    add_edge(verticesArr[1],verticesArr[2],g);
    
    Vertex v = verticesArr[0];
    Adjacency_iter ai, ai_end;
    tie(ai, ai_end) = adjacent_vertices(v, g);
    clear_vertex(v,g);
    remove_vertex(v,g);
    for (;ai != ai_end; ++ai) {
        out_degree(*ai,g); /* segfault */
    }
    
    return 0;
}