greplicate

<code><a rd-options="" href="/link/Graph?package=mlr3pipelines&version=0.1.1" data-mini-rdoc="mlr3pipelines::Graph">Graph</a></code> 
Graph to replicate.

graph

<code>integer(1)</code>
Number of copies to create.

Create a new <code><a rd-options="" href="/link/Graph?package=mlr3pipelines&version=0.1.1" data-mini-rdoc="mlr3pipelines::Graph">Graph</a></code> containing <code>n</code> copies of the input <code>Graph</code> / <code><a rd-options="" href="/link/PipeOp?package=mlr3pipelines&version=0.1.1" data-mini-rdoc="mlr3pipelines::PipeOp">PipeOp</a></code>.
To avoid ID collisions, PipeOp IDs are suffixed with <code>_i</code>
where <code>i</code> ranges from 1 to <code>n</code>.

Dataflow programming toolkit that enriches 'mlr3' with a diverse
set of pipelining operators ('PipeOps') that can be composed into graphs.
Operations exist for data preprocessing, model fitting, and ensemble
learning. Graphs can themselves be treated as 'mlr3' 'Learners' and can
therefore be resampled, benchmarked, and tuned.

Martin Binder

mlr3pipelines

Preprocessing Operators and Pipelines for 'mlr3'

Florian Pfisterer

Bernd Bischl

Michel Lang

Susanne Dandl

greplicate function

<code><a rd-options='' href='Graph'>Graph</a></code> 
Graph to replicate.

Create a new <code><a rd-options='' href='Graph'>Graph</a></code> containing <code>n</code> copies of the input <code>Graph</code> / <code><a rd-options='' href='PipeOp'>PipeOp</a></code>.
To avoid ID collisions, PipeOp IDs are suffixed with <code>_i</code>
where <code>i</code> ranges from 1 to <code>n</code>.

greplicate: Create Disjoint Graph Union of Copies of a Graph

Description

Usage

Arguments

Value

See Also