Rank in Similarity Graph Edge-Count Two-Sample Test (RISE) R package GraphRankTest version 0.1 Implements the Rank In Similarity Graph Edge-count two-sample test (RISE) for high-dimensional and non-Euclidean data. The method constructs similarity-based graphs, such as k-nearest neighbor graph (k-NNG), k-minimum spanning tree (k-MST), and k-minimum distance non-bipartite pairing (k-MDP), and evaluates rank-based within-sample edge counts with asymptotic and permutation p-values. For methodological details, see Zhou and Chen (2023) <https://proceedings.mlr.press/v195/zhou23a.html>. Software Depends: R (>= 3.5.0) Imports: stats, ade4, nbpMatching Suggests: testthat (>= 3.0.0), rmarkdown Doudou Zhou <ddzhou@nus.edu.sg> Comprehensive R Archive Network (CRAN) Doudou Zhou [aut, cre] (ORCID: <https://orcid.org/0000-0002-0830-2287>), Hao Chen [aut] (ORCID: <https://orcid.org/0000-0002-4597-2773>) GPL (>= 2) 2025-11-12 application/tgz https://CRAN.R-project.org/package=GraphRankTest doi:10.32614/CRAN.package.GraphRankTest