Compute per-edge similarity values on graphs using the DRESS (Diffusive Recursive Structural Similarity) algorithm. Supports weighted/unweighted and directed/undirected graphs. Iterative fixed-point fitting converges to stable edge scores that capture neighbourhood overlap structure.
| Version: | 0.1.2 |
| Published: | 2026-02-25 |
| DOI: | 10.32614/CRAN.package.dress.graph |
| Author: | Eduar Castrillo Velilla [aut, cre] |
| Maintainer: | Eduar Castrillo Velilla <velicast at outlook.com> |
| License: | MIT + file LICENSE |
| NeedsCompilation: | yes |
| SystemRequirements: | OpenMP |
| CRAN checks: | dress.graph results |
| Reference manual: | dress.graph.html , dress.graph.pdf |
| Package source: | dress.graph_0.1.2.tar.gz |
| Windows binaries: | r-devel: dress.graph_0.1.2.zip, r-release: dress.graph_0.1.2.zip, r-oldrel: dress.graph_0.1.2.zip |
| macOS binaries: | r-release (arm64): dress.graph_0.1.2.tgz, r-oldrel (arm64): dress.graph_0.1.2.tgz, r-release (x86_64): dress.graph_0.1.2.tgz, r-oldrel (x86_64): dress.graph_0.1.2.tgz |
Please use the canonical form https://CRAN.R-project.org/package=dress.graph to link to this page.