interplex: *interplex* package

In interplex: Coercion Methods for Simplicial Complex Data Structures

interplex package

Description

This is a helper package to coerce simplicial complexes between different data structures.

Details

This package helps interface between different topological data analytic packages and workflows by coercing simplicial complex objects stored using different data structures. Each coercion is designed to retain as much annotation as possible, whether of simplices or of the complex.

The package supports coercions between simplicial complexes stored using the following data structures:

• a complete list of simplices, as stored as cmplx values of filtration objects in the TDA package

• an object of class 'Rcpp_SimplexTree' as implemented in the simplextree package

• an object of class 'gudhi.simplex_tree.SimplexTree' as implemented in Python GUDHI and imported via reticulate

• an 'igraph' object, as implemented in the igraph package

• a 'network' object, as implemented in the network package

Author(s)

Maintainer: Jason Cory Brunson [e-mail] (ORCID)

Other contributors:

• Yara Skaf [contributor]

See Also

Useful links:

• https://github.com/tdaverse/interplex

• Report bugs at https://github.com/tdaverse/interplex/issues

interplex documentation built on May 29, 2024, 6:28 a.m.