From 3aee2fd43e3059a699af2b63c6f2395e5a55e515 Mon Sep 17 00:00:00 2001 From: KatolaZ Date: Wed, 27 Sep 2017 15:06:31 +0100 Subject: First commit on github -- NetBunch 1.0 --- doc/largest_component.1.html | 139 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 139 insertions(+) create mode 100644 doc/largest_component.1.html (limited to 'doc/largest_component.1.html') diff --git a/doc/largest_component.1.html b/doc/largest_component.1.html new file mode 100644 index 0000000..1d0af04 --- /dev/null +++ b/doc/largest_component.1.html @@ -0,0 +1,139 @@ + + + + + + largest_component(1) - Find largest connected component of a graph + + + + + +
+ + + +
    +
  1. largest_component(1)
    2. +
  2. www.complex-networks.net
    3. +
  3. largest_component(1)
    4. +
+ +

NAME

+

+ largest_component - Find largest connected component of a graph +

+ +

SYNOPSIS

+ +

largest_component graph_in

+ +

DESCRIPTION

+ +

largest_component computes the largest connected component of +graph_in, and prints on STDOUT the corresponding edge list.

+ +

PARAMETERS

+ +
+
graph_in
undirected input graph (edge list). If it is equal to - (dash), + read the edge list from STDIN.
+
+ + +

OUTPUT

+ +

The program prints on STDOUT the edge list of the largest connected +component of graph_in, in the format:

+ +
    i_1 j_1 
+    i_2 j_2 
+    ....
+
+ +

SEE ALSO

+ +

components(1), node_components(1), strong_conn(1)

+ +

REFERENCES

+ + + + +

AUTHORS

+ +

(c) Vincenzo 'KatolaZ' Nicosia 2009-2017 <v.nicosia@qmul.ac.uk>.

+ + +
    +
  1. www.complex-networks.net
    2. +
  2. September 2017
    3. +
  3. largest_component(1)
    4. +
+ +
+ + -- cgit v1.2.3