minimumSpanningTree: Compute a Minimum Spanning Tree given a sparse similarity...

Description Usage Arguments Value Examples

Description

Compute a Minimum Spanning Tree given a sparse similarity matrix

Usage

1
minimumSpanningTree(similarity_matrix, verbose, verbose_every = 100)

Arguments

similarity_matrix

Sparse similarity matrix (= 1/distance_matrix)

verbose

Print status to console

verbose_every

Console notification of progress

Value

Sparse MST with 1 for connected nodes and 0 elsewhere

Examples

1
2
3
4
minimumSpanningTree(sparseMatrix(i = c(1,4,1,2,3,2,3,4,3,4),
                                 j = c(1,1,4,2,2,3,3,3,4,4),
                                 x = c(Inf,1,1,Inf,3,3,Inf,2,2,Inf)), 
                                 verbose = FALSE)

rtlemos/scurvy documentation built on May 30, 2019, 11:46 p.m.