Pair Critical Points and Compute Persistent Homology of Reeb Graphs R package rgph version 0.1.0 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>. Software Depends: R (>= 2.7.0), rJava (>= 0.5-0), phutil Suggests: rlang, tinytest, igraph (>= 0.6-0), network (>= 1.19.0), knitr, rmarkdown, dplyr, tidyr, scales, ggplot2, bench Jason Cory Brunson <cornelioid@gmail.com> Comprehensive R Archive Network (CRAN) Satyajit Mohanty [aut], Shubham Singh [aut], Jason Cory Brunson [aut, cre] (ORCID: <https://orcid.org/0000-0003-3126-9494>), Paul Rosen [cph, ctb] (ReebGraphPairing; GPL-3 license, ORCID: <https://orcid.org/0000-0002-0873-9518>), Junyi Tu [cph, ctb] (ReebGraphPairing; GPL-3 license, ORCID: <https://orcid.org/0000-0001-7026-7454>) GPL-3 2026-02-24 application/tgz https://CRAN.R-project.org/package=rgph doi:10.32614/CRAN.package.rgph