1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// 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 <boost/config.hpp>
#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_utility.hpp>
/*
Sample output:
original graph:
0 --> 3 2 3
1 --> 3
2 --> 0
3 --> 2
removing edges (0,3)
0 --> 2
1 --> 3
2 --> 0
3 --> 2
removing edge (0,2) and (3, 2)
0 -->
1 --> 3
2 --> 0
3 -->
*/
using namespace boost;
typedef adjacency_list< vecS, vecS, directedS > Graph;
int main()
{
typedef std::pair< std::size_t, std::size_t > Edge;
Edge edges[6] = { Edge(0, 3), Edge(0, 2), Edge(0, 3), Edge(1, 3),
Edge(2, 0), Edge(3, 2) };
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
// VC++ can't handle iterator constructor
Graph g(4);
for (std::size_t j = 0; j < 6; ++j)
add_edge(edges[j].first, edges[j].second, g);
#else
Graph g(edges, edges + 6, 4);
#endif
std::cout << "original graph:" << std::endl;
print_graph(g, get(vertex_index, g));
std::cout << std::endl;
std::cout << "removing edges (0,3)" << std::endl;
remove_out_edge_if(vertex(0, g), incident_to(vertex(3, g), g), g);
print_graph(g, get(vertex_index, g));
std::cout << "removing edge (0,2) and (3, 2)" << std::endl;
remove_edge_if(incident_to(vertex(2, g), g), g);
print_graph(g, get(vertex_index, g));
return 0;
}
|
