kevinbacran-package: kevinbacran: Degrees of Separation Between CRAN authors
In matt-dray/kevinbacran: Degrees of Separation Between CRAN authors
Description
Author(s)
See Also
Description
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.
Author(s)
Maintainer: Matt Dray mwdray@gmail.com
See Also
Useful links:
-
Report bugs at https://github.com/matt-dray/kevinbacran/issues
matt-dray/kevinbacran documentation built on Dec. 15, 2019, 12:37 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Author(s) See Also
Description
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.
Author(s)
Maintainer: Matt Dray mwdray@gmail.com
See Also
Useful links:
Report bugs at https://github.com/matt-dray/kevinbacran/issues
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.