Description Usage Arguments Value Author(s) Examples
The Kernigham-Lin equations split a graph into two equal parts depending on a weighting matrix. The weighting matrix here is constrained to be the Eucledian distance between the points.
1 | partition_section(points, nrep)
|
points |
a data frame with fields |
nrep |
the number of times to split the graph |
a list of vectors, where each vector contains the id
s of the nodes in a particular group
C. Ladroue, A. Zammit Mangion
1 2 3 4 5 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.