igraph_to_edgelist

This function is just used internally for testing the package

Evaluates the stability and significance of clusters on 'igraph' graphs.
Supports weighted and unweighted graphs. Implements the cluster evaluation methods
defined by Arratia A, Renedo M (2021) <doi:10.7717/peerj-cs.600>. Also includes an
implementation of the Reduced Mutual Information introduced by Newman et al. (2020)
<doi:10.1103/PhysRevE.101.042304>.

Martc3<ad> Mirambell

clustAnalytics

Cluster Evaluation on Graphs

igraph_to_edgelist function

<dl><dt>g</dt>
<dd>igraph graph with weighted edges</dd>
<dt>sort</dt>
<dd>sorts the edge list lexicographically before returning</dd></dl>

Arguments

Returns edgelist with weights from a weighted igraph graph — igraph_to_edgelist

<dl>

<dt>g</dt>
<dd>igraph graph with weighted edges</dd>


<dt>sort</dt>
<dd>sorts the edge list lexicographically before returning</dd>

</dl>

igraph_to_edgelist: Returns edgelist with weights from a weighted igraph graph

Description

Usage

Value

Arguments