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
|
.\" generated with Ronn/v0.7.3
.\" http://github.com/rtomayko/ronn/tree/0.7.3
.
.TH "LARGEST_COMPONENT" "1" "September 2017" "www.complex-networks.net" "www.complex-networks.net"
.
.SH "NAME"
\fBlargest_component\fR \- Find largest connected component of a graph
.
.SH "SYNOPSIS"
\fBlargest_component\fR \fIgraph_in\fR
.
.SH "DESCRIPTION"
\fBlargest_component\fR computes the largest connected component of \fIgraph_in\fR, and prints on STDOUT the corresponding edge list\.
.
.SH "PARAMETERS"
.
.TP
\fIgraph_in\fR
undirected input graph (edge list)\. If it is equal to \fB\-\fR (dash), read the edge list from STDIN\.
.
.SH "OUTPUT"
The program prints on STDOUT the edge list of the largest connected component of \fIgraph_in\fR, in the format:
.
.IP "" 4
.
.nf
i_1 j_1
i_2 j_2
\.\.\.\.
.
.fi
.
.IP "" 0
.
.SH "SEE ALSO"
components(1), node_components(1), strong_conn(1)
.
.SH "REFERENCES"
.
.IP "\(bu" 4
V\. Latora, V\. Nicosia, G\. Russo, "Complex Networks: Principles, Methods and Applications", Chapter 6, Cambridge University Press (2017)
.
.IP "\(bu" 4
V\. Latora, V\. Nicosia, G\. Russo, "Complex Networks: Principles, Methods and Applications", Appendix 8, Cambridge University Press (2017)
.
.IP "" 0
.
.SH "AUTHORS"
(c) Vincenzo \'KatolaZ\' Nicosia 2009\-2017 \fB<v\.nicosia@qmul\.ac\.uk>\fR\.
|
