1 //=======================================================================
2 // Copyright 2000 University of Notre Dame.
3 // Authors: Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee
5 // Distributed under the Boost Software License, Version 1.0. (See
6 // accompanying file LICENSE_1_0.txt or copy at
7 // http://www.boost.org/LICENSE_1_0.txt)
8 //=======================================================================
13 This example uses interfaces that have been deprecated and removed from
14 Boost.Grpah. Someone needs to update it, as it does NOT compile.
17 #include <boost/config.hpp>
22 #include <boost/graph/adjacency_list.hpp>
23 #include <boost/graph/edge_connectivity.hpp>
25 using namespace boost
;
30 typedef adjacency_list
< vecS
, vecS
, undirectedS
> UndirectedGraph
;
48 typedef graph_traits
< UndirectedGraph
>::edge_descriptor edge_descriptor
;
49 typedef graph_traits
< UndirectedGraph
>::degree_size_type degree_size_type
;
50 std::vector
< edge_descriptor
> disconnecting_set
;
53 = edge_connectivity(g
, std::back_inserter(disconnecting_set
));
55 std::cout
<< "The edge connectivity is " << c
<< "." << std::endl
;
56 std::cout
<< "The disconnecting set is {";
58 std::copy(disconnecting_set
.begin(), disconnecting_set
.end(),
59 std::ostream_iterator
< edge_descriptor
>(std::cout
, " "));
60 std::cout
<< "}." << std::endl
;