Nothing
floor(log(n)) neighbours per node, yielding O(n^2 log n) time and
O(n * log(n)) working memory.igraph::mst() on a sparse edge list constructed
from integer index vectors.components(), intersection(), is_connected(), etc.).inst/extdata/benchmark_performance.R).Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.