|
pulsatrix 1.1.0
|
ComputeH0()'s result. More...
#include <h0.hpp>

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. | |
ComputeH0()'s result.
| 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.
| 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.