\brief Returns the number of vertices in the complex. */

* Universal procedure to read files with persistence. It ignores the lines starting from # (treat them as comments). * It reads the fist line which i

Stop the timer

Compute the Wasserstein distance between two diagrams. Points at infinity are supported. Parameters: X (n x 2 numpy array): First dia

@name Queries */ @{ * Returns the dimension of the simplex. */

* @brief Adds the simplex to the set of blockers and * returns a Blocker_handle toward it if was not present before and 0 otherwise. */

*/

* @brief Given an Id return the address of the vertex having this Id in the complex. * @remark For a simplicial complex, the address is the id but

* @brief returns the number of vertices in the complex. */

This function computes and returns the persistence of the simplicial complex. :param homology_coeff_field: The homology coefficient field. Mu

\brief Returns a range over the simplices of the simplicial complex. * * In the Simplex_tree, the tree is traverse in a depth-first fashion.

\brief Retrieve the original filtration value for a given simplex in the Simplex_tree. Since the * computation of extended persistence requires mod

* @brief Updates the zigzag persistence diagram after the removal of the given cell. * * @param arrowNumber Arrow number of when the cell to rem

\brief Remove a maximal simplex. * @param[in] sh Simplex handle on the maximal simplex to remove. * \pre Please check the simplex has no coface

* @brief Returns the subtraction in the field of the first element by the second element. * * @param e1 First element. * @param e2 Second ele

* @brief Stores in the first element the sum of two given elements in the field, that is * `(e1 + e2) % characteristic`, such that the result is po

* @brief returns true iff the complex is empty. */

* @brief Returns the inverse of the element in the field. * * @return The inverse. */

* @brief For interface purposes with multi-fields. Returns the inverse together with the argument. * * @param productOfCharacteristics Some valu

Be careful, this function invalidates the tree, which will be recomputed at the next query

* This procedure gives the value of a vector on a given position. **/

* This is a simple procedure to create n by n (or 2*pixel_radius times 2*pixel_radius) cubical approximation of a * Gaussian kernel. * * @ingroup P

@brief Returns the persistent Betti number of the dimension passed by parameter. * @param[in] dimension The Betti number dimension to get. * @pa

Array with the filtration values of all the cells of the complex. Modifying the values is strongly discouraged. :returns: numpy.ndar

Args: X (numpy.array): coordinates for query points, or distance matrix if metric is "precomputed", or distances

Returns true if Persistence pointer is not None.

* @brief returns the first vertex of an edge * @details it assumes that the edge is present in the complex */

\brief This function ensures that each simplex has a higher filtration value than its faces by increasing the * filtration values. * @return Tru

* true iff the simplex corresponds to one node in the trie */

* @return true iff s is a blocker of the simplicial complex */

\brief Expands the Simplex_tree containing only its one skeleton * until dimension max_dim. * * The expanded simplicial complex until dimensi

\brief Initializes the filtration cache, i.e. sorts the * simplices according to their order in the filtration. * Assumes that the filtration va

\brief Prune above filtration value given as parameter. That is: if \f$ f \f$ is the given filtration value * and \f$ f_s \f$ the filtration value

* @brief Returns the dimension of the column. * * @return The dimension of the column. */

\brief Number of vertices. */

* @brief Returns @ref Matrix::get_null_value "null index" if the column is not paired, the @ref MatIdx of the pair * otherwise. * * @return @

This function initializes and sorts the simplicial complex filtration vector. .. deprecated:: 3.2.0

This function returns the persistence intervals of the simplicial complex in a specific dimension. :param dimension: The specific dim

Returns a pointer to the root nodes of the simplex tree. */

@brief Returns the Betti number of the dimension passed by parameter. * @param[in] dimension The Betti number dimension to get. * @return Betti

\brief Computes the simplices of the simplicial complex. */

\brief Returns if the OFF file read operation was successful or not. * * @return OFF file read status. */

\brief Returns the key associated to a simplex. * * If no key has been assigned, returns `null_key()`. * \pre SimplexTreeOptions::store_key

* @brief Returns a range of the blockers of the complex passing through a vertex */

* boundary_simplex_range creates an object of a Boundary_simplex_range class * that provides ranges for the Boundary_simplex_iterator. **/

This function computes the persistence of the simplicial complex, so it can be accessed through :func:`persistent_betti_numbers`, :func:`persi

* return the id of a vertex of address local present in the graph */