Computes a new measure, DNSL betweenness, via the creation of a new graph from an existing one, duplicating nodes with self-loops. This betweenness centrality does not drop this essential information. Implements Merelo & Molinari (2024) <doi:10.1007/s42001-023-00245-4>.
| Version: | 0.3.0 |
| Depends: | R (≥ 3.5.0) |
| Imports: | igraph,Rdpack |
| Suggests: | testthat (≥ 3.0.0),knitr,qpdf,rmarkdown,dogesr |
| Published: | 2024-04-10 |
| DOI: | 10.32614/CRAN.package.dupNodes |
| Author: | Juan Julián Merelo-Guervós |
| Maintainer: | Juan Julián Merelo-Guervós <jjmerelo at gmail.com> |
| License: | GPL-3 |
| NeedsCompilation: | no |
| Materials: | README,NEWS |
| CRAN checks: | dupNodes results |
| Package source: | dupNodes_0.3.0.tar.gz |
| Windows binaries: | r-devel:dupNodes_0.3.0.zip, r-release:dupNodes_0.3.0.zip, r-oldrel:dupNodes_0.3.0.zip |
| macOS binaries: | r-release (arm64):dupNodes_0.3.0.tgz, r-oldrel (arm64):dupNodes_0.3.0.tgz, r-release (x86_64):dupNodes_0.3.0.tgz, r-oldrel (x86_64):dupNodes_0.3.0.tgz |
| Old sources: | dupNodes archive |
Please use the canonical formhttps://CRAN.R-project.org/package=dupNodesto link to this page.