blob: 445e705fc8ac6c88c8ddd0d99946a24700971a07 (
plain)
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
|
modularity(1) -- Compute the modularity of a partition of a graph
======
## SYNOPSIS
`modularity` <graph_in> <partition>
## DESCRIPTION
`modularity` computes the value of the modularity function associated
to a partition of the nodes of the graph given as input.
## PARAMETERS
* <graph_in>:
undirected input graph (edge list). If is equal to `-` (dash), read
the edge list from STDIN.
* <partition>:
The name of the file containing the association of nodes to
communities (the partition of which one wants to compute the
modularity). See [INPUT FORMAT][] for details.
## INPUT FORMAT
<graph_in> is an edge-list. The file <partition> is in the format:
node_0 community_0
node_1 community_1
....
where 'node_0' is the label of the first node and 'community_0' is the
community to which 'node_0' belongs, and so on.
## OUTPUT
`modularity` prints on STDOUT the value of the modularity function
associated to the partition of the graph provided as input. The
program also prints on STDERR one line in the format:
## nc: NUM_COMMUNITIES
where 'NUM_COMMUNITIES' is the number of communities in the partition
provided as input.
## REFERENCES
* M\. E. J. Newman and M. Girvan. "Finding and evaluating community
structure in networks". Phys. Rev. E 69, (2004), 026113.
* V\. Latora, V. Nicosia, G. Russo, "Complex Networks: Principles,
Methods and Applications", Chapter 9, Cambridge University Press
(2017)
## AUTHORS
(c) Vincenzo 'KatolaZ' Nicosia 2009-2017 `<v.nicosia@qmul.ac.uk>`.
|
