Crate fast_nnt 

Fast Rust implementation of the NeighbourNet algorithm (Bryant & Moulton, 2004) for phylogenetic analysis.

From a square, symmetric distance matrix, fast-nnt constructs an implicit split network — a planar diagram that summarises conflicting signal in the data for exploratory analysis. Unlike explicit networks, the parallelogram “boxes” do not model specific reticulation events such as hybridisation or introgression. A 2-D layout for the network is computed using the equal-angle algorithm and returned alongside the splits in a Nexus.

run_fast_nnt_from_memory is the single entry point shared by the CLI and the Python and R bindings.

Modules

algorithms

cli

data

neighbour_net

nexus

ordering

phylo

splits

utils

weights

Enums

RayonInitStatus

Initialize the global Rayon thread pool (call once per process).

Functions

init_rayon_threads

run_fast_nnt_from_memory

Build a NeighbourNet split network from a distance matrix.

set_log_level