interplex

Computational topology, which enables 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.

Last 30 days

This package has been downloaded 127 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 1 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 1,963 times in the last 365 days. Consider this 'mid-tier influencer' status—if it were a TikTok, it would get a nod from nieces and nephews. The day with the most downloads was Sep 11, 2024 with 26 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.