print.igraphHRGConsensus

Consensus dendrograms (<code>igraphHRGConsensus</code> objects) are printed
simply by listing the children of each internal node of the
dendrogram:<pre><code>HRG consensus tree:
g1 -&gt; 11 12 13 14 15 16 17 18 19 20
g2 -&gt; 1 2 3 4 5 6 7 8 9 10 
g3 -&gt; g1 g2</code></pre>The root of the dendrogram is <code>g3</code> (because it has no incoming
edges), and it has two subgroups, <code>g1</code> and <code>g2</code>.

Routines for simple graphs and network analysis. It can
handle large graphs very well and provides functions for generating random
and regular graphs, graph visualization, centrality methods and much more.

Tam<c3><a1>s Nepusz

igraph

Network Analysis and Visualization

print.igraphHRGConsensus function

<dl><dt>x</dt>
<dd><code>igraphHRGConsensus</code> object to print.</dd>
<dt>...</dt>
<dd>Ignored.</dd></dl>

Arguments

Print a hierarchical random graph consensus tree to the screen — print.igraphHRGConsensus

<dl>

<dt>x</dt>
<dd><code>igraphHRGConsensus</code> object to print.</dd>


<dt>...</dt>
<dd>Ignored.</dd>

</dl>

print.igraphHRGConsensus: Print a hierarchical random graph consensus tree to the screen

Description

Usage

Value

Arguments

See Also