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 |
Author: |
Dave Ruth, Sam Buttrey |
Maintainer: |
Sam Buttrey <buttrey at nps.edu> |
License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
NeedsCompilation: |
no |
CRAN checks: |
AcrossTic results |
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=AcrossTic
to link to this page.