netview: Netview R

In esteinig/netviewr: Network Visualization And Population Structure

Netview R

Description

Generate mutual nearest-neighbour graphs for analysis of population structure and visualization with iGraph.

Usage

netview(dist, k=1:60, mutual=T, weights=T, mst=F, algorithm='cover_tree')

Arguments

dist	Symmetrical distance matrix for NetView (N x N) [ matrix ]
k	Range of parameter k for mutual k-nearest-neighbour search [ int vector, 10:60 ]
mutual	Construct mutual nearest neighbor graph instead of nearest neighbor graph [ bool, TRUE ]
weights	Weight of edges is mapped to pairwise distance in input matrix [ bool, TRUE ]
mst	Include edges of the minimum spanning tree associated with the data [ bool, FALSE ]
algorithm	Algorithm for mutual nearest neighbour search [ char cover_tree ]

Details

For examples and tutorials, please see the repository: https://github.com/esteinig/netviewr

Value

List of graph objects (igraph)

esteinig/netviewr documentation built on Oct. 20, 2024, 5:16 a.m.