Package: crann
Title: Spanning Tree Methods for Graphs
Version: 0.0.1
Authors@R: 
    person(given = "Christopher T.",
       family = "Kenny",
       role = c("aut", "cre"),
       email = "ctkenny@proton.me",
       comment = c(ORCID = "0000-0002-9386-6860"))
Description: 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.
License: MIT + file LICENSE
Encoding: UTF-8
Roxygen: list(markdown = TRUE)
RoxygenNote: 7.3.3
Imports: adj, cli
Config/testthat/edition: 3
Config/Needs/website: christopherkenny/ctktemplate
Suggests: spelling, testthat (>= 3.0.0)
Language: en-US
URL: http://christophertkenny.com/crann/
Repository: https://christopherkenny.r-universe.dev
Date/Publication: 2026-05-01 16:14:53 UTC
RemoteUrl: https://github.com/christopherkenny/crann
RemoteRef: HEAD
RemoteSha: d1bb3933396a168765b6a630747467e517a321e1
NeedsCompilation: yes
Packaged: 2026-07-04 12:46:34 UTC; root
Author: Christopher T. Kenny [aut, cre] (ORCID:
    <https://orcid.org/0000-0002-9386-6860>)
Maintainer: Christopher T. Kenny <ctkenny@proton.me>