pulsatrix 1.1.0
Loading...
Searching...
No Matches
pulsatrix::H0Result Struct Reference

ComputeH0()'s result. More...

#include <h0.hpp>

Collaboration diagram for pulsatrix::H0Result:

Public Attributes

PersistenceDiagram diagram
 The H0 diagram: one pair (0, length) for each tree edge of positive length, and one essential pair (0, infinity) for the component that never dies. Its error_bound is the distances' error bound.
 
std::vector< MstEdge > edges
 The n - 1 edges of a minimum spanning tree, by increasing length (ties by a, then b). Edge k is the k-th merge of single-linkage clustering.
 

Detailed Description

ComputeH0()'s result.

Member Data Documentation

◆ diagram

PersistenceDiagram pulsatrix::H0Result::diagram

The H0 diagram: one pair (0, length) for each tree edge of positive length, and one essential pair (0, infinity) for the component that never dies. Its error_bound is the distances' error bound.

◆ edges

std::vector<MstEdge> pulsatrix::H0Result::edges

The n - 1 edges of a minimum spanning tree, by increasing length (ties by a, then b). Edge k is the k-th merge of single-linkage clustering.


The documentation for this struct was generated from the following file: