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.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0-3 by Sam Buttrey, 5 years ago

Browse source code at https://github.com/cran/AcrossTic

Authors: Dave Ruth , Sam Buttrey

Documentation:   PDF Manual  

GPL (>= 2) license

Depends on treeClust, lpSolve

See at CRAN