matt-dray/kevinbacran: Degrees of Separation Between CRAN authors
Calculate the shortest path through a graph network between any two authors listed on CRAN. Analagous to the Six Degrees of Kevin Bacon or Erdos Number. Author X collaborates with author Y; author Z collaborates with Y but not X, therefore the distance from X to Z is two.
Getting started
Browse package contents
Package details |
|
|---|---|
| Maintainer | |
| License | MIT + file LICENSE |
| Version | 0.0.0.9000 |
| URL | https://github.com/matt-dray/kevinbacran |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
