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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// 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 <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
1(0,3) 2(0,2) 3(0,3) 4(1,3) 5(2,0) 6(3,2)
removing edges connecting 0 to 3
0 --> 2
1 --> 3
2 --> 0
3 --> 2
2(0,2) 4(1,3) 5(2,0) 6(3,2)
removing edges with weight greater than 3
0 --> 2
1 -->
2 -->
3 -->
2(0,2)
*/
using namespace boost;
typedef adjacency_list<vecS, vecS, bidirectionalS,
no_property, property<edge_weight_t, int> > Graph;
struct has_weight_greater_than {
has_weight_greater_than(int w_, Graph& g_) : w(w_), g(g_) { }
bool operator()(graph_traits<Graph>::edge_descriptor e) {
#ifdef BOOST_MSVC
property_map<Graph, edge_weight_t>::type weight = get(edge_weight, g);
return get(weight, e) > w;
#else
// This version of get() breaks VC++
return get(edge_weight, g, e) > w;
#endif
}
int w;
Graph& g;
};
int
main()
{
typedef std::pair<std::size_t,std::size_t> Edge;
Edge edge_array[6] = { Edge(0,3), Edge(0,2), Edge(0, 3),
Edge(1,3),
Edge(2, 0),
Edge(3, 2) };
#ifdef BOOST_MSVC
Graph g(4);
for (std::size_t j = 0; j < 6; ++j)
add_edge(edge_array[j].first, edge_array[j].second, g);
#else
Graph g(edge_array, edge_array + 6, 4);
#endif
property_map<Graph, edge_weight_t>::type
weight = get(edge_weight, g);
int w = 0;
graph_traits<Graph>::edge_iterator ei, ei_end;
for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
weight[*ei] = ++w;
property_map<Graph, vertex_index_t>::type indexmap = get(vertex_index, g);
std::cout << "original graph:" << std::endl;
print_graph(g, indexmap);
print_edges2(g, indexmap, weight);
std::cout << std::endl;
std::cout << "removing edges connecting 0 to 3" << std::endl;
remove_out_edge_if(vertex(0,g), incident_to(vertex(3,g), g), g);
print_graph(g, indexmap);
print_edges2(g, indexmap, weight);
std::cout << "removing edges with weight greater than 3" << std::endl;
remove_edge_if(has_weight_greater_than(3, g), g);
print_graph(g, indexmap);
print_edges2(g, indexmap, weight);
return 0;
}
|
