Package: crann 0.0.1
Christopher T. Kenny
crann: Spanning Tree Methods for Graphs
Implements spanning tree algorithms for undirected graphs represented as 'adj' adjacency lists. Provides enumeration of all spanning trees via Winter's (1986) contraction-based algorithm <doi:10.1007/BF01939361>, counting via Kirchhoff's matrix tree theorem, minimum spanning trees via Kruskal's algorithm, uniform random sampling via Wilson's (1996) loop-erased random walk <doi:10.1145/237814.237880>, and structural utilities including fundamental cycles and cuts.
Authors:
crann_0.0.1.tar.gz
crann_0.0.1.zip(r-4.7-x86_64)crann_0.0.1.zip(r-4.7-arm64)crann_0.0.1.zip(r-4.6-x86_64)crann_0.0.1.zip(r-4.6-arm64)crann_0.0.1.zip(r-4.5-x86_64)
crann_0.0.1.tgz(r-4.6-x86_64)crann_0.0.1.tgz(r-4.6-arm64)crann_0.0.1.tgz(r-4.5-x86_64)crann_0.0.1.tgz(r-4.5-arm64)
crann_0.0.1.tar.gz(r-4.7-arm64)crann_0.0.1.tar.gz(r-4.7-x86_64)crann_0.0.1.tar.gz(r-4.6-arm64)crann_0.0.1.tar.gz(r-4.6-x86_64)
crann_0.0.1.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
crann/json (API)
| # Install 'crann' in R: |
| install.packages('crann', repos = c('https://christopherkenny.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/christopherkenny/crann/issues
Pkgdown/docs site:https://christophertkenny.com
Last updated from:d1bb393339. Checks:15 OK. Indexed: yes.
| Target | Result | Time | Files | Syslog |
|---|---|---|---|---|
| linux-devel-arm64 | OK | 80 | ||
| linux-devel-x86_64 | OK | 100 | ||
| source / vignettes | OK | 189 | ||
| linux-release-arm64 | OK | 79 | ||
| linux-release-x86_64 | OK | 97 | ||
| macos-release-arm64 | OK | 84 | ||
| macos-release-x86_64 | OK | 145 | ||
| macos-oldrel-arm64 | OK | 100 | ||
| macos-oldrel-x86_64 | OK | 242 | ||
| windows-devel-arm64 | OK | 204 | ||
| windows-devel-x86_64 | OK | 120 | ||
| windows-release-arm64 | OK | 207 | ||
| windows-release-x86_64 | OK | 54 | ||
| windows-oldrel-x86_64 | OK | 82 | ||
| wasm-release | OK | 77 |
Exports:count_spanning_treesenumerate_spanning_treesenumerate_spanning_trees_edgesfundamental_cutsfundamental_cyclesis_spanning_treeis_spanning_tree_ofminimum_spanning_treesample_spanning_tree
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Count spanning trees | count_spanning_trees |
| Enumerate all spanning trees | enumerate_spanning_trees |
| Enumerate spanning trees as an edge matrix | enumerate_spanning_trees_edges |
| Fundamental cuts of a spanning tree | fundamental_cuts |
| Fundamental cycles of a spanning tree | fundamental_cycles |
| Test if a graph is a spanning tree | is_spanning_tree |
| Test if a graph is a spanning tree of another graph | is_spanning_tree_of |
| Minimum spanning tree | minimum_spanning_tree |
| Sample a uniform random spanning tree | sample_spanning_tree |