deme_graph() builds a lightweight deme/landscape
graph (vertex coordinates + undirected edge list) from coordinates, with
Delaunay, k-nearest- neighbour, or lattice (rook/queen) adjacency. The
result is class c("landgraph", "terradish_graph").cov_from_biallelic(),
cov_from_genetic_data(), fst_from_biallelic(),
dist_from_cov(), dist_from_biallelic().edge_gradient() (gradient
of a scalar potential) and edge_flow() (projection of a
vector flow field, carrying a curl component).cov_from_biallelic() applies the per-locus pooled
frequency correctly per column (fixes a column-major recycling error
that affected multi-deme covariances).
Need a high-speed mirror for your open-source project?
Contact our mirror admin team at info@clientvps.com.
This archive is provided as a free public service to the community.
Proudly supported by infrastructure from VPSPulse , RxServers , BuyNumber , UnitVPS , OffshoreName and secure payment technology by ArionPay.