speakeasyR

cranv0.1.8

Fast and Robust Multi-Scale Graph Clustering. A graph community detection algorithm that aims to be performant on large graphs and robust, returning consistent results across runs. SpeakEasy 2 (SE2), the underlying algorithm, is described in Chris Gaiteri, David R. Connell & Faraz A. Sultan et al. (2023) <doi:10.1186/s13059-023-03062-0>. The co

License GPL (>= 3)0 versions1 maintainers2 deps61 weekly dl
SpeakEasy-2/speakeasyR
37
/ 100
Health
use with caution

[email protected] low health (37/100) — consider alternatives

  • Low health score (37/100)
Health breakdown0 – 100
10/25
maintenance
0/20
popularity
25/25
security
0/15
maturity
2/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

Dependencies (2)
API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/cran/speakeasyR

First published · 2025-10-03 18:08:54

Last updated · 2025-09-30T18:10:02+00:00

speakeasyR — Health Score 37/100 | DepScope