* @brief returns the number of simplices of a given dimension in the complex. */

* Returns number of all cubes in the complex. **/

* @brief Called before the edge contraction process starts. */

* @brief Called when the algorithm stops. */

Create a .dot file that can be compiled with neato to produce a .pdf file. \brief Creates a .dot file called SC.dot for neato (part of the graphviz pa

This function plots the persistence bar code from persistence values list, a np.array of shape (N x 2) (representing a diagram in a single homolog

\brief Generates a uniform random orthogonal matrix using the "subgroup algorithm" by * Diaconis & Shashahani. * \details Taken from https://en.wiki

Reads a file containing persistence intervals. Each line might contain 2, 3 or 4 values: [[field] dimension] birth death The return value is a

* @brief Removes the birth from the ordering. * When the row at index @p birth is removed from the homology matrix, we do not need * to main

* Remove the vertex v from the simplex: */

Creates the cover C from a file containing the cover elements of each point (the order has to be the same as in the input file!). :pa

Set cover from file. \brief Creates the cover C from a file containing the cover elements of each point (the order has to be the same * as in the in

\brief Reads and stores the distance matrices from vector stored in memory. * * @param[in] distance_matrix input vector representing the distanc

\brief Sets the mask, which is a threshold integer such that nodes in the complex that contain a number of data * points which is less than or equa

\brief Reads and stores the input point cloud from vector stored in memory. * * @param[in] point_cloud input vector representing the point cloud

\brief Returns the mean color corresponding to a specific node of the created complex. * * @param[in] c ID of the node.

Returns a range over all top-dimensional cells. */

Add dummy points to each persistence diagram so that they all have the same cardinality. All points are given an additional coordinate indica

Compute all sliced Wasserstein kernel values between the persistence diagrams that were stored after calling the fit() method, and a given li

This function returns a list of pairs of vertices corresponding to the persistence birth and death cells of the filtration. The cells are repr

This function returns a list of pairs of vertices corresponding to the persistence birth and death cells of the filtration. The cells are repr

Compute the Wasserstein distance between persistence diagram using Python Optimal Transport backend. Diagrams can contain points with infinit

Create a .txt file that can be compiled with KeplerMapper. \brief Creates a .txt file called SC.txt describing the 1-skeleton, which can then be plott

Args: points (Sequence[Sequence[float]]): A list of points in d-Dimension. weights (Optional[Sequence[float]]): A list of

Compute and returns sample range from the persistence diagrams if one of the sample_range values is numpy.nan. Parameters: sample_ra

:param X: (n x 2) numpy.array encoding the (points of the) first diagram. :param Y: (m x 2) numpy.array encoding the second diagram. :par

Compute the file checksum using sha256. Parameters ---------- file_path: string Full path of the created file including file