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.

AuthorDave Ruth, Sam Buttrey
Date of publication2016-08-13 11:01:25
MaintainerSam Buttrey <buttrey@nps.edu>
LicenseGPL (>= 2)
Version1.0-3

View on CRAN

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.