AcrossTic: A Cost-Minimal Regular Spanning Subgraph with TreeClust

Construct minimum-cost regular spanning subgraph as part of a non-parametric two-sample test for equality of distribution.

Version: 1.0-3
Depends: treeClust (≥ 1.1-6), lpSolve
Published: 2016-08-13
DOI: 10.32614/CRAN.package.AcrossTic
Author: Dave Ruth, Sam Buttrey
Maintainer: Sam Buttrey <buttrey at>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
CRAN checks: AcrossTic results


Reference manual: AcrossTic.pdf


Package source: AcrossTic_1.0-3.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): AcrossTic_1.0-3.tgz, r-oldrel (arm64): AcrossTic_1.0-3.tgz, r-release (x86_64): AcrossTic_1.0-3.tgz, r-oldrel (x86_64): AcrossTic_1.0-3.tgz
Old sources: AcrossTic archive


Please use the canonical form to link to this page.