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
119
120
121
122
123
124
125
126
127
128
129
130
131
|
// Copyright (C) 2012, Michele Caini.
// 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)
// Two Graphs Common Spanning Trees Algorithm
// Based on academic article of Mint, Read and Tarjan
// Efficient Algorithm for Common Spanning Tree Problem
// Electron. Lett., 28 April 1983, Volume 19, Issue 9, p.346-347
#include <boost/type_traits.hpp>
#include <boost/concept/requires.hpp>
#include <boost/assign/std/vector.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/compressed_pair.hpp>
#include <boost/core/lightweight_test.hpp>
#include <boost/graph/two_graphs_common_spanning_trees.hpp>
#include <vector>
using namespace boost::assign;
namespace boost
{
typedef boost::adjacency_list< boost::vecS, // OutEdgeList
boost::vecS, // VertexList
boost::undirectedS, // Directed
boost::no_property, // VertexProperties
boost::no_property, // EdgeProperties
boost::no_property, // GraphProperties
boost::listS // EdgeList
>
Graph;
typedef boost::graph_traits< Graph >::vertex_descriptor vertex_descriptor;
typedef boost::graph_traits< Graph >::edge_descriptor edge_descriptor;
typedef boost::graph_traits< Graph >::vertex_iterator vertex_iterator;
typedef boost::graph_traits< Graph >::edge_iterator edge_iterator;
template < typename Coll, typename Seq > struct check_edge
{
public:
BOOST_CONCEPT_ASSERT((RandomAccessContainer< Coll >));
BOOST_CONCEPT_ASSERT((RandomAccessContainer< Seq >));
typedef typename Coll::value_type coll_value_type;
typedef typename Seq::value_type seq_value_type;
BOOST_STATIC_ASSERT((is_same< coll_value_type, Seq >::value));
BOOST_STATIC_ASSERT((is_same< seq_value_type, bool >::value));
void operator()(Coll& coll, Seq& seq)
{
bool found = false;
for (typename Coll::iterator iterator = coll.begin();
!found && iterator != coll.end(); ++iterator)
{
Seq& coll_seq = *iterator;
BOOST_TEST(coll_seq.size() == seq.size());
found = true;
for (typename Seq::size_type pos = 0; found && pos < seq.size();
++pos)
{
found &= coll_seq[pos] == seq[pos];
}
}
BOOST_TEST(found);
}
};
void two_graphs_common_spanning_trees_test()
{
Graph iG, vG;
std::vector< edge_descriptor > iG_o;
std::vector< edge_descriptor > vG_o;
iG_o.push_back(boost::add_edge(0, 1, iG).first);
iG_o.push_back(boost::add_edge(1, 3, iG).first);
iG_o.push_back(boost::add_edge(3, 2, iG).first);
iG_o.push_back(boost::add_edge(1, 5, iG).first);
iG_o.push_back(boost::add_edge(5, 4, iG).first);
iG_o.push_back(boost::add_edge(5, 6, iG).first);
iG_o.push_back(boost::add_edge(5, 3, iG).first);
iG_o.push_back(boost::add_edge(3, 1, iG).first);
iG_o.push_back(boost::add_edge(1, 3, iG).first);
vG_o.push_back(boost::add_edge(0, 2, vG).first);
vG_o.push_back(boost::add_edge(0, 4, vG).first);
vG_o.push_back(boost::add_edge(0, 5, vG).first);
vG_o.push_back(boost::add_edge(5, 1, vG).first);
vG_o.push_back(boost::add_edge(5, 3, vG).first);
vG_o.push_back(boost::add_edge(5, 6, vG).first);
vG_o.push_back(boost::add_edge(5, 4, vG).first);
vG_o.push_back(boost::add_edge(5, 2, vG).first);
vG_o.push_back(boost::add_edge(2, 6, vG).first);
std::vector< std::vector< bool > > coll;
boost::tree_collector< std::vector< std::vector< bool > >,
std::vector< bool > >
collector(coll);
std::vector< bool > inL(iG_o.size(), false);
boost::two_graphs_common_spanning_trees(iG, iG_o, vG, vG_o, collector, inL);
check_edge< std::vector< std::vector< bool > >, std::vector< bool > >
checker;
std::vector< bool > check;
check.clear();
check += true, true, true, true, true, true, false, false, false;
checker(coll, check);
check.clear();
check += true, true, true, true, true, true, false, false, false;
checker(coll, check);
}
}
int main(int argc, char** argv)
{
boost::two_graphs_common_spanning_trees_test();
return boost::report_errors();
}
|
