get_largest_component

Get the indices of the vertices in the largest connected
component of a graph from its adjacency matrix.

Tools for spectral clustering of weighted directed networks using motif
adjacency matrices. Methods perform well on large and sparse networks, and
random sampling methods for generating weighted directed networks are also
provided. Based on methodology detailed in Underwood, Elliott and Cucuringu
(2020) <arXiv:2004.01293>.

William George Underwood

motifcluster

Motif-Based Spectral Clustering of Weighted Directed Networks

get_largest_component function

<dl><dt>adj_mat</dt>
<dd>An adjacency matrix of a graph.</dd></dl>

Arguments

Get largest connected component — get_largest_component

<dl>

<dt>adj_mat</dt>
<dd>An adjacency matrix of a graph.</dd>

</dl>

get_largest_component: Get largest connected component

Description

Usage

Value

Arguments

Examples