#include <iostream>
#include <vector>

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

using namespace std;
using namespace boost;

typedef adjacency_list<vecS,vecS,undirectedS> Graph;
typedef graph_traits<Graph>:: vertex_descriptor Vertex;


int main() {
    Graph g(4);
    add_edge(2,3,g);
    add_edge(1,3,g);
    add_edge(1,2,g);
    add_edge(0,1,g);

    vector<Vertex> dtm(4);
    vector<Vertex> low(4);
    vector<Vertex> p(4);
    biconnected_components(g, dummy_property_map(),
                                                discover_time_map(&dtm[0])
                                                .lowpoint_map(&low[0])
                                                . predecessor_map(&p[0]) ); 
            
    for(Vertex v=0; v<4; ++v) {
        cout << "vertex: " << v << " - discover time: " << dtm[v] << " - lowpoint: " << low[v] << " - parent: " << p[v] << "\n";
    }
    return 0;
}