AcrossTic: A Cost-Minimal Regular Spanning Subgraph with TreeClust

Share:

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

Author
Dave Ruth, Sam Buttrey
Date of publication
2016-08-13 11:01:25
Maintainer
Sam Buttrey <buttrey@nps.edu>
License
GPL (>= 2)
Version
1.0-3

View on CRAN

Man pages

AcrossTic-package
\Sexpr[results=rd,stage=build]{tools:::Rd_package_title("AcrossTic")}
plot.AcrossTic
Plot function for simple AcrossTic objects
print.AcrossTic
Print method for AcrossTic objects
print.AcrossTicPtest
Print output of AcrossTic permutation test
ptest
Permutation test for AcrossTic objects
rRegMatch
Regular matching with minimum-cost spanning subgraphs

Files in this package

AcrossTic
AcrossTic/NAMESPACE
AcrossTic/R
AcrossTic/R/print.AcrossTicPtest.R
AcrossTic/R/print.AcrossTic.R
AcrossTic/R/rRegMatch.R
AcrossTic/R/ptest.R
AcrossTic/R/plot.AcrossTic.R
AcrossTic/MD5
AcrossTic/build
AcrossTic/build/partial.rdb
AcrossTic/DESCRIPTION
AcrossTic/man
AcrossTic/man/print.AcrossTicPtest.Rd
AcrossTic/man/plot.AcrossTic.Rd
AcrossTic/man/rRegMatch.Rd
AcrossTic/man/ptest.Rd
AcrossTic/man/print.AcrossTic.Rd
AcrossTic/man/AcrossTic-package.Rd
AcrossTic/INDEX