layout_gephi_fr

Force-directed layout that replicates Gephi's Fruchterman-Reingold algorithm.
This is a strict port of the Java implementation from Gephi's source code.

internal

Provides tools for the analysis, visualization, and manipulation
of dynamical, social (Saqr et al. (2024) <doi:10.1007/978-3-031-54464-4_10>) and
complex networks (Saqr et al. (2025) <doi:10.1145/3706468.3706513>). The package
supports multiple network formats and offers flexible tools for heterogeneous,
multi-layer, and hierarchical network analysis with simple syntax and
extensive toolset.

Sonsoles López-Pernas

cograph

Modern Network Visualization

Mohammed Saqr

Santtu Tikka

layout_gephi_fr function

<dl><dt>g</dt>
<dd>An igraph graph object.</dd>
<dt>area</dt>
<dd>Area parameter controlling node spread. Default 10000.</dd>
<dt>gravity</dt>
<dd>Gravity force pulling nodes toward center. Default 10.0.</dd>
<dt>speed</dt>
<dd>Speed/cooling parameter. Default 1.0.</dd>
<dt>niter</dt>
<dd>Number of iterations. Default 100.</dd></dl>

Arguments

Gephi Fruchterman-Reingold Layout — layout_gephi_fr

<dl>

<dt>g</dt>
<dd>An igraph graph object.</dd>


<dt>area</dt>
<dd>Area parameter controlling node spread. Default 10000.</dd>


<dt>gravity</dt>
<dd>Gravity force pulling nodes toward center. Default 10.0.</dd>


<dt>speed</dt>
<dd>Speed/cooling parameter. Default 1.0.</dd>


<dt>niter</dt>
<dd>Number of iterations. Default 100.</dd>

</dl>

layout_gephi_fr: Gephi Fruchterman-Reingold Layout

Description

Usage

Value

Arguments

Details