mirror of
https://github.com/boostorg/graph.git
synced 2025-05-10 07:23:58 +00:00
74 lines
2.4 KiB
C++
74 lines
2.4 KiB
C++
//=======================================================================
|
|
// Copyright 2000 University of Notre Dame.
|
|
// Authors: Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee
|
|
//
|
|
// This file is part of the Boost Graph Library
|
|
//
|
|
// You should have received a copy of the License Agreement for the
|
|
// Boost Graph Library along with the software; see the file LICENSE.
|
|
// If not, contact Office of Research, University of Notre Dame, Notre
|
|
// Dame, IN 46556.
|
|
//
|
|
// Permission to modify the code and to distribute modified code is
|
|
// granted, provided the text of this NOTICE is retained, a notice that
|
|
// the code was modified is included with the above COPYRIGHT NOTICE and
|
|
// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
|
|
// file is distributed with the modified code.
|
|
//
|
|
// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
|
|
// By way of example, but not limitation, Licensor MAKES NO
|
|
// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
|
|
// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
|
|
// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
|
|
// OR OTHER RIGHTS.
|
|
//=======================================================================
|
|
|
|
|
|
#include <boost/config.hpp>
|
|
#include <set>
|
|
#include <iostream>
|
|
#include <iterator>
|
|
#include <algorithm>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/edge_connectivity.hpp>
|
|
|
|
using namespace boost;
|
|
|
|
int
|
|
main()
|
|
{
|
|
const int N = 8;
|
|
typedef adjacency_list<vecS, vecS, undirectedS> UndirectedGraph;
|
|
UndirectedGraph g(N);
|
|
|
|
add_edge(0, 1, g);
|
|
add_edge(0, 2, g);
|
|
add_edge(0, 3, g);
|
|
add_edge(1, 2, g);
|
|
add_edge(1, 3, g);
|
|
add_edge(2, 3, g);
|
|
add_edge(3, 4, g);
|
|
add_edge(3, 7, g);
|
|
add_edge(4, 5, g);
|
|
add_edge(4, 6, g);
|
|
add_edge(4, 7, g);
|
|
add_edge(5, 6, g);
|
|
add_edge(5, 7, g);
|
|
add_edge(6, 7, g);
|
|
|
|
typedef graph_traits<UndirectedGraph>::edge_descriptor edge_descriptor;
|
|
typedef graph_traits<UndirectedGraph>::degree_size_type degree_size_type;
|
|
std::vector<edge_descriptor> disconnecting_set;
|
|
|
|
degree_size_type c = edge_connectivity(g, std::back_inserter(disconnecting_set));
|
|
|
|
std::cout << "The edge connectivity is " << c << "." << std::endl;
|
|
std::cout << "The disconnecting set is {";
|
|
|
|
std::copy(disconnecting_set.begin(), disconnecting_set.end(),
|
|
std::ostream_iterator<edge_descriptor>(std::cout, " "));
|
|
std::cout << "}." << std::endl;
|
|
|
|
return 0;
|
|
}
|