rep.igraph

*.igraph

The new graph will contain the input graph the given number
of times, as unconnected components.

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

rep.igraph function

<dl><dt>x</dt>
<dd>The input graph.</dd>
<dt>n</dt>
<dd>Number of times to replicate it.</dd>
<dt>mark</dt>
<dd>Whether to mark the vertices with a <code>which</code> attribute,
an integer number denoting which replication the vertex is coming
from.</dd>
<dt>...</dt>
<dd>Additional arguments to satisfy S3 requirements,
currently ignored.</dd></dl>

Arguments

Replicate a graph multiple times — rep.igraph

<dl>

<dt>x</dt>
<dd>The input graph.</dd>


<dt>n</dt>
<dd>Number of times to replicate it.</dd>


<dt>mark</dt>
<dd>Whether to mark the vertices with a <code>which</code> attribute,
an integer number denoting which replication the vertex is coming
from.</dd>


<dt>...</dt>
<dd>Additional arguments to satisfy S3 requirements,
currently ignored.</dd>

</dl>

rep.igraph: Replicate a graph multiple times

Description

Usage

Arguments

Examples