# --------------------------------------------
# CITATION file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# --------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "crann" in publications use:'
type: software
license: MIT
title: 'crann: Spanning Tree Methods for Graphs'
version: 0.0.1
doi: 10.32614/CRAN.package.crann
abstract: 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 <https://doi.org/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 <https://doi.org/10.1145/237814.237880>,
  and structural utilities including fundamental cycles and cuts.
authors:
- family-names: Kenny
  given-names: Christopher T.
  email: ctkenny@proton.me
  orcid: https://orcid.org/0000-0002-9386-6860
repository: https://christopherkenny.r-universe.dev
commit: d1bb3933396a168765b6a630747467e517a321e1
url: http://christophertkenny.com/crann/
date-released: '2026-05-01'
contact:
- family-names: Kenny
  given-names: Christopher T.
  email: ctkenny@proton.me
  orcid: https://orcid.org/0000-0002-9386-6860