-
Notifications
You must be signed in to change notification settings - Fork 214
/
Copy pathbron_kerbosch_print_cliques.cpp
71 lines (57 loc) · 2 KB
/
bron_kerbosch_print_cliques.cpp
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
// (C) Copyright Andrew Sutton 2007
//
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0 (See accompanying file
// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
//[code_bron_kerbosch_print_cliques
#include <iostream>
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/bron_kerbosch_all_cliques.hpp>
#include "helper.hpp"
using namespace std;
using namespace boost;
// The clique_printer is a visitor that will print the vertices that comprise
// a clique. Note that the vertices are not given in any specific order.
template < typename OutputStream > struct clique_printer
{
clique_printer(OutputStream& stream) : os(stream) {}
template < typename Clique, typename Graph >
void clique(const Clique& c, const Graph& g)
{
// Iterate over the clique and print each vertex within it.
typename Clique::const_iterator i, end = c.end();
for (i = c.begin(); i != end; ++i)
{
os << g[*i].name << " ";
}
os << endl;
}
OutputStream& os;
};
// The Actor type stores the name of each vertex in the graph.
struct Actor
{
string name;
};
// Declare the graph type and its vertex and edge types.
typedef undirected_graph< Actor > Graph;
typedef graph_traits< Graph >::vertex_descriptor Vertex;
typedef graph_traits< Graph >::edge_descriptor Edge;
// The name map provides an abstract accessor for the names of
// each vertex. This is used during graph creation.
typedef property_map< Graph, string Actor::* >::type NameMap;
int main(int argc, char* argv[])
{
// Create the graph and and its name map accessor.
Graph g;
NameMap nm(get(&Actor::name, g));
// Read the graph from standard input.
read_graph(g, nm, cin);
// Instantiate the visitor for printing cliques
clique_printer< ostream > vis(cout);
// Use the Bron-Kerbosch algorithm to find all cliques, printing them
// as they are found.
bron_kerbosch_all_cliques(g, vis);
return 0;
}
//]