//=======================================================================
// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include 
#include 
#include 
#include 
#include 
#include 
#include 

namespace boost
{
struct edge_component_t
{
    enum
    {
        num = 555
    };
    using kind = edge_property_tag;
} edge_component;
}

int main()
{
    using namespace boost;
    using graph_t = adjacency_list< vecS, vecS, undirectedS, no_property,
        property< edge_component_t, std::size_t > >;
    using vertex_t = graph_traits< graph_t >::vertex_descriptor;
    graph_t g(9);
    add_edge(0, 5, g);
    add_edge(0, 1, g);
    add_edge(0, 6, g);
    add_edge(1, 2, g);
    add_edge(1, 3, g);
    add_edge(1, 4, g);
    add_edge(2, 3, g);
    add_edge(4, 5, g);
    add_edge(6, 8, g);
    add_edge(6, 7, g);
    add_edge(7, 8, g);

    auto component = get(edge_component, g);

    auto num_comps = biconnected_components(g, component);
    std::cerr