Apply GaussianPerslayPhi on a ragged tensor containing a list of persistence diagrams. Parameters: diagrams (n x None x

Apply TentPerslayPhi on a ragged tensor containing a list of persistence diagrams. Parameters: diagrams (n x None x 2):

Apply FlatPerslayPhi on a ragged tensor containing a list of persistence diagrams. Parameters: diagrams (n x None x 2):

Apply Perslay on a ragged tensor containing a list of persistence diagrams. Parameters: diagrams (n x None x 2): ragged

Careful -> children_ can be NULL*/

\brief Returns the key of the representative simplex of * the set of simplices having this column as annotation vector * in the compressed annot

Delete the data home cache directory and all its content. Parameters ---------- data_home : string, default is None. The pat

\brief Clears the filtration cache produced by initialize_filtration(). * * Useful when initialize_filtration() has already been called and we p

\brief Returns the codomain dimension. */

\brief Returns the codomain dimension. */

\brief Returns the codomain dimension. */

\brief Returns the codomain dimension. Same as the codimension of the sphere. */

\brief Returns the codomain dimension. */

\brief Returns the codomain dimension. */

\brief Returns the codomain dimension. */

\brief Returns the codomain dimension. */

\brief Returns the codomain dimension. Same as the codimension of the sphere. */

\brief Returns the codomain dimension. */

\brief Returns the codomain dimension. Same as the codimension of the sphere. */

This function computes the top-dimensional cofaces associated to the positive and negative simplices of a cubical complex. The output format is a vect

* @brief Collect edges. * * Iterates over all edges of the simplicial complex and * 1) inserts them in the priority queue sorted according to

Open neighborhood At some point it helped gcc to add __attribute__((noinline)) here, otherwise we had +50% on the running time on one example. It look

landscapes * @private * This method provides a comparison of points that is used in construction of persistence landscapes. The ordering is * lexico

* @brief returns true iff the graph of the 1-skeleton of the complex is complete. */

* A function to compute averaged persistence landscape on a grid, based on vector of persistence landscapes on grid. * This function is required by

* A function to compute averaged persistence landscape, based on vector of persistence landscapes. * This function is required by Topological_data_

\brief Computes the confidence level of a specific bottleneck distance threshold. * * @param[in] d Bottleneck distance. * */

\brief Computes the bottleneck distance threshold corresponding to a specific confidence level. * * @param[in] alpha Confidence level. * *

* This procedure compute incidence numbers between cubes. For a cube \f$A\f$ of * dimension n and a cube \f$B \subset A\f$ of dimension n-1, an inci

* compute the blockers of the link if is_alpha_blocker is false. * Otherwise, alpha is a blocker, and the link is computed in the complex where

* @brief compute vertices of the link. * If the boolean only_superior_vertices is true, then only the vertices * are greater than vertices of a

* Computations of a \f$L^i\f$ norm of landscape, where i is the input parameter. **/

TODO: move to the constructors?

\brief Inserts a Node with label @p v in the set of siblings sib, and percolate the * expansion on the subtree rooted at sib. Sibling sib must not

* A function to compute scalar product of persistence landscape on a grid. * The parameter of this function is a Persistence_landscape_on_grid.

* A function to compute scalar product of persistence landscapes. * The parameter of this function is a Persistence_landscape. * This function i