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
132
133
134
135
136
|
//=======================================================================
// Copyright 2007 Aaron Windsor
//
// 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/graph/adjacency_list.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/make_maximal_planar.hpp>
#include <boost/graph/boyer_myrvold_planar_test.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/property_map/vector_property_map.hpp>
#include <boost/core/lightweight_test.hpp>
using namespace boost;
template < typename Graph > void reset_edge_index(Graph& g)
{
typename property_map< Graph, edge_index_t >::type index
= get(edge_index, g);
typename graph_traits< Graph >::edge_iterator ei, ei_end;
typename graph_traits< Graph >::edges_size_type cnt = 0;
for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
put(index, *ei, cnt++);
}
template < typename Graph > void make_cycle(Graph& g, int size)
{
typedef typename graph_traits< Graph >::vertex_descriptor vertex_t;
vertex_t first_vertex = add_vertex(g);
vertex_t prev_vertex = first_vertex;
for (int i = 1; i < size; ++i)
{
vertex_t curr_vertex = add_vertex(g);
add_edge(curr_vertex, prev_vertex, g);
prev_vertex = curr_vertex;
}
add_edge(first_vertex, prev_vertex, g);
}
struct UpdateVertexIndex
{
template < typename Graph > void update(Graph& g)
{
typename property_map< Graph, vertex_index_t >::type index
= get(vertex_index, g);
typename graph_traits< Graph >::vertex_iterator vi, vi_end;
typename graph_traits< Graph >::vertices_size_type cnt = 0;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
put(index, *vi, cnt++);
}
};
struct NoVertexIndexUpdater
{
template < typename Graph > void update(Graph&) {}
};
template < typename Graph, typename VertexIndexUpdater >
void test_cycle(VertexIndexUpdater vertex_index_updater, int size)
{
Graph g;
make_cycle(g, size);
vertex_index_updater.update(g);
reset_edge_index(g);
typedef std::vector< typename graph_traits< Graph >::edge_descriptor >
edge_vector_t;
typedef std::vector< edge_vector_t > embedding_storage_t;
typedef iterator_property_map< typename embedding_storage_t::iterator,
typename property_map< Graph, vertex_index_t >::type >
embedding_t;
embedding_storage_t embedding_storage(num_vertices(g));
embedding_t embedding(embedding_storage.begin(), get(vertex_index, g));
typename graph_traits< Graph >::vertex_iterator vi, vi_end;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
std::copy(out_edges(*vi, g).first, out_edges(*vi, g).second,
std::back_inserter(embedding[*vi]));
BOOST_TEST(boyer_myrvold_planarity_test(g));
make_maximal_planar(g, embedding);
reset_edge_index(g);
// A graph is maximal planar exactly when it's both
// planar and has 3 * num_vertices(g) - 6 edges.
BOOST_TEST(num_edges(g) == 3 * num_vertices(g) - 6);
BOOST_TEST(boyer_myrvold_planarity_test(g));
}
int main(int, char*[])
{
typedef adjacency_list< vecS, vecS, undirectedS,
property< vertex_index_t, int >, property< edge_index_t, int > >
VVgraph_t;
typedef adjacency_list< vecS, listS, undirectedS,
property< vertex_index_t, int >, property< edge_index_t, int > >
VLgraph_t;
typedef adjacency_list< listS, vecS, undirectedS,
property< vertex_index_t, int >, property< edge_index_t, int > >
LVgraph_t;
typedef adjacency_list< listS, listS, undirectedS,
property< vertex_index_t, int >, property< edge_index_t, int > >
LLgraph_t;
typedef adjacency_list< setS, setS, undirectedS,
property< vertex_index_t, int >, property< edge_index_t, int > >
SSgraph_t;
test_cycle< VVgraph_t >(NoVertexIndexUpdater(), 10);
test_cycle< VVgraph_t >(NoVertexIndexUpdater(), 50);
test_cycle< VLgraph_t >(UpdateVertexIndex(), 3);
test_cycle< VLgraph_t >(UpdateVertexIndex(), 30);
test_cycle< LVgraph_t >(NoVertexIndexUpdater(), 15);
test_cycle< LVgraph_t >(NoVertexIndexUpdater(), 45);
test_cycle< LLgraph_t >(UpdateVertexIndex(), 8);
test_cycle< LLgraph_t >(UpdateVertexIndex(), 19);
test_cycle< SSgraph_t >(UpdateVertexIndex(), 13);
test_cycle< SSgraph_t >(UpdateVertexIndex(), 20);
return boost::report_errors();
}
|
