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
|
//=======================================================================
// Copyright 2001 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, Indiana University,
// Bloomington, IN 47405.
//
// Permission to modify the code and to distribute the code is
// granted, provided the text of this NOTICE is retained, a notice if
// 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 <vector>
#include <algorithm>
#include <utility>
#include <boost/graph/adjacency_list.hpp>
#include <boost/pending/disjoint_sets.hpp>
#include <boost/graph/incremental_components.hpp>
int
main(int, char *[])
{
using namespace boost;
// Create a graph
typedef adjacency_list < vecS, vecS, undirectedS > Graph;
typedef graph_traits < Graph >::vertex_descriptor Vertex;
const int N = 6;
Graph G(N);
add_edge(0, 1, G);
add_edge(1, 4, G);
// create the disjoint-sets object, which requires rank and parent vertex properties
std::vector < Vertex > rank(num_vertices(G));
std::vector < Vertex > parent(num_vertices(G));
typedef graph_traits<Graph>::vertices_size_type* Rank;
typedef Vertex* Parent;
disjoint_sets < Rank, Parent > ds(&rank[0], &parent[0]);
// determine the connected components, storing the results in the disjoint-sets object
initialize_incremental_components(G, ds);
incremental_components(G, ds);
// Add a couple more edges and update the disjoint-sets
graph_traits < Graph >::edge_descriptor e;
bool flag;
tie(e, flag) = add_edge(4, 0, G);
ds.union_set(4, 0);
tie(e, flag) = add_edge(2, 5, G);
ds.union_set(2, 5);
graph_traits < Graph >::vertex_iterator iter, end;
for (tie(iter, end) = vertices(G); iter != end; ++iter)
std::cout << "representative[" << *iter << "] = " <<
ds.find_set(*iter) << std::endl;;
std::cout << std::endl;
typedef component_index < unsigned int >Components;
Components components(parent.begin(), parent.end());
for (Components::size_type i = 0; i < components.size(); ++i) {
std::cout << "component " << i << " contains: ";
for (Components::value_type::iterator j = components[i].begin();
j != components[i].end(); ++j)
std::cout << *j << " ";
std::cout << std::endl;
}
return EXIT_SUCCESS;
}
|
