Package: kevinbacran 0.0.0.9000

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.

Authors:Matt Dray [aut, cre]

kevinbacran_0.0.0.9000.tar.gz
kevinbacran_0.0.0.9000.zip(r-4.5)kevinbacran_0.0.0.9000.zip(r-4.4)kevinbacran_0.0.0.9000.zip(r-4.3)
kevinbacran_0.0.0.9000.tgz(r-4.4-any)kevinbacran_0.0.0.9000.tgz(r-4.3-any)
kevinbacran_0.0.0.9000.tar.gz(r-4.5-noble)kevinbacran_0.0.0.9000.tar.gz(r-4.4-noble)
kevinbacran_0.0.0.9000.tgz(r-4.4-emscripten)kevinbacran_0.0.0.9000.tgz(r-4.3-emscripten)
kevinbacran.pdf |kevinbacran.html✨
kevinbacran/json (API)

Peer review:

Bug tracker:https://github.com/matt-dray/kevinbacran/issues

On CRAN:

graphkevin-baconnetworktidygraph

4 exports 3 stars 0.49 score 81 dependencies 6 scripts

Last updated 5 years agofrom:7729d3ed00. Checks:OK: 1 ERROR: 6. Indexed: yes.

Exports:kb_comboskb_distancekb_pairkb_plot

Dependencies:base64encBHbslibcachemclicolorspacecountrycodecpp11cranlydigestdplyrevaluatefansifarverfastmapfontawesomefsgenericsggforceggplot2ggraphggrepelgluegraphlayoutsgridExtragtablehighrhtmltoolshtmlwidgetsigraphisobandjquerylibjsonliteknitrlabelinglatticelifecyclemagrittrMASSMatrixmemoisemgcvmimemunsellnlmeNLPpillarpkgconfigpolyclippurrrR6rappdirsRColorBrewerRcppRcppArmadilloRcppEigenrlangrmarkdownsassscalesslamstringistringrsystemfontstibbletidygraphtidyrtidyselecttinytextmtweenrutf8vctrsviridisviridisLitevisNetworkwithrwordcloudxfunxml2yaml