Installation
About
Computational topology, which includes topological data analysis (TDA), makes pervasive use of abstract mathematical objects called simplicial complexes; see Edelsbrunner and Harer (2010) doi:10.1090/mbk/069. Several R packages and other software libraries used through an R interface construct and use data structures that represent simplicial complexes, including mathematical graphs viewed as 1-dimensional complexes. This package provides coercers (converters) between these data structures. Currently supported structures are complete lists of simplices as used by 'TDA'; the simplex trees of Boissonnat and Maria (2014) doi:10.1007/s00453-014-9887-3 as implemented in 'simplextree' and in Python GUDHI (by way of 'reticulate'); and the graph classes of 'igraph' and 'network', by way of the 'intergraph' package.
github.com/corybrunson/interplex | |
Bug report | File report |
Key Metrics
Downloads
Yesterday | 6 -14% |
Last 7 days | 46 +15% |
Last 30 days | 177 -20% |
Last 90 days | 464 +1619% |
Last 365 days | 547 -54% |