forked from boostorg/graph
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathclustering_coefficient.cpp
More file actions
68 lines (56 loc) · 2.16 KB
/
clustering_coefficient.cpp
File metadata and controls
68 lines (56 loc) · 2.16 KB
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
// (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_clustering_coefficient
#include <iostream>
#include <iomanip>
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/exterior_property.hpp>
#include <boost/graph/clustering_coefficient.hpp>
#include "helper.hpp"
using namespace std;
using namespace boost;
// 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.
using Graph = undirected_graph< Actor >;
using Vertex = graph_traits< Graph >::vertex_descriptor;
using Edge = graph_traits< Graph >::edge_descriptor;
// The name map provides an abstract accessor for the names of
// each vertex. This is used during graph creation.
using NameMap = property_map< Graph, string Actor::* >::type;
// The clustering property, container, and map define the containment
// and abstract accessor for the clustering coefficients of vertices.
using ClusteringProperty = exterior_vertex_property< Graph, float >;
using ClusteringContainer = ClusteringProperty::container_type;
using ClusteringMap = ClusteringProperty::map_type;
int main(int argc, char* argv[])
{
// Create the graph and a name map that provides access to
// then actor names.
Graph g;
NameMap nm(get(&Actor::name, g));
// Read the graph from standard input.
read_graph(g, nm, cin);
// Compute the clustering coefficients of each vertex in the graph
// and the mean clustering coefficient which is returned from the
// computation.
ClusteringContainer coefs(num_vertices(g));
ClusteringMap cm(coefs, g);
auto cc = all_clustering_coefficients(g, cm);
// Print the clustering coefficient of each vertex.
graph_traits< Graph >::vertex_iterator i, end;
for (boost::tie(i, end) = vertices(g); i != end; ++i)
{
cout << setw(12) << setiosflags(ios::left) << g[*i].name << get(cm, *i)
<< endl;
}
cout << "mean clustering coefficient: " << cc << endl;
return 0;
}
//]