A Cost-Minimal Regular Spanning Subgraph with TreeClust
![[R logo]](../../../doc/html/Rlogo.svg)
![[Up]](../../../doc/html/left.jpg)
![[Top]](../../../doc/html/up.jpg)
Documentation for package ‘AcrossTic’ version 1.0-3
Help Pages
| AcrossTic-package | A Cost-Minimal Regular Spanning Subgraph with TreeClust |
| AcrossTic | A Cost-Minimal Regular Spanning Subgraph with TreeClust |
| 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 |