get_edgelist_from_overlaps

Obtain edge list from cluster intersections

Topological data analysis (TDA) is a method of data analysis that
uses techniques from topology to analyze high-dimensional data. Here we
implement Mapper, an algorithm from this area developed by Singh, Mémoli and
Carlsson (2007) which generalizes the concept of a
Reeb graph <https://en.wikipedia.org/wiki/Reeb_graph>.

George Clare Kennedy

mappeR

Construct and Visualize TDA Mapper Graphs

get_edgelist_from_overlaps function

<dl><dt>overlaps</dt>
<dd>A named list of edges, whose elements contain the names of clusters in the overlap represented by that edge; output of <code>get_overlaps()</code>.</dd>
<dt>num_vertices</dt>
<dd>The number of vertices in the graph.</dd></dl>

Arguments

Obtain edge list from cluster intersections — get_edgelist_from_overlaps

<dl>

<dt>overlaps</dt>
<dd>A named list of edges, whose elements contain the names of clusters in the overlap represented by that edge; output of <code>get_overlaps()</code>.</dd>


<dt>num_vertices</dt>
<dd>The number of vertices in the graph.</dd>

</dl>

get_edgelist_from_overlaps: Obtain edge list from cluster intersections

Description

Usage

Value

Arguments