mirror of https://github.com/KatolaZ/NetBunch
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
50 lines
1.3 KiB
50 lines
1.3 KiB
.\" 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\.
|
|
|