rgph
Pair Critical Points and Compute Persistent Homology of Reeb Graphs
Interface to the 'ReebGraphPairing' program to compute critical points of Reeb graphs following Tu, Hajij, & Rosen (2019) <doi:10.1007/978-3-030-33720-9_8> via the 'rJava' package. Also store Reeb graphs in a minimal S3 class, convert between other network data structures, and post-process pairing data to obtain extended persistent homology following Carrière & Oudot (2018) <doi:10.1007/s10208-017-9370-z>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | rgph_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
rolling linux/noble R-4.5 | rgph_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
rolling source/ R- | rgph_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
latest linux/jammy R-4.5 | rgph_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
latest linux/noble R-4.5 | rgph_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
latest source/ R- | rgph_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
2026-04-26 source/ R- | rgph_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
2026-04-23 source/ R- | rgph_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
2026-04-09 windows/windows R-4.5 | rgph_0.1.0.zip |
1.0 MiB |