fast-nnt 0.2.5

Rust implementation of the SplitsTree NeighborNet algorithm.
Documentation
1
2
3
4
5
Bud1$rithms @� @� @� @$
algorithmslg1Scomp�o
algorithmsmoDDblobe�r�e)�A
algorithmsmodDblobe�r�e)�A
algorithmsph1Scomp�binlg1Scomp�binmoDDblob����Ĕ�AbinmodDblob����Ĕ�Abinph1Scompdatalg1Scomp%�datamoDDblob�a$��'�AdatamodDblob�a$��'�Adataph1Scomp@
neighbour_netlg1Scomp}�
neighbour_netmoDDblob�I�c'�A
neighbour_netmodDblob�I�c'�A
neighbour_netph1Scomp�nexuslg1ScompNDnexusmoDDblob!�/�*�AnexusmodDblob!�/�*�Anexusph1Scompporderinglg1ScompI{orderingmoDDblob�l��_��AorderingmodDblob�l��_��Aorderingph1Scomppphylolg1Scomp��phylomoDDblob<���'�AphylomodDblob<���'�Aphyloph1Scomp�splitslg1ScompJ�splitsmoDDblob֮5|g'�AsplitsmodDblob֮5|g'�Asplitsph1Scomppweightslg1ScompRbweightsmoDDblobzCW�]��AweightsmodDblobzCW�]��Aweightsph1ScomppEDSDB `� @� @� @h1Scompp