generate.intersections.mst.knn: Performs the intersections between MST y kNN graphs
In jorgeklz/mstknnclust: MST-kNN Clustering Algorithm

generate.intersections.mst.knn

R Documentation

Performs the intersections between MST y kNN graphs

This function performs a graph partition based on the intersection of the edges of two proximity graphs: MST and kNN.

generate.intersections.mst.knn(nodes.list, distance.matrix, suggested.k)

`nodes.list`	A vector with a subset of objects (nodes) of the data matrix for which the MST y kNN graphs must be generated.
`distance.matrix`	A distance matrix between each pair of elements in `nodes.list`. It is used as the edges costs to generate MST y kNN graphs.
`suggested.k`	A numeric value representing the number of nearest neighbors to consider to generate the kNN graph.

A list with the elements

`cc`	A numeric value representing the number of connected components (cc) generated after graphs intersection.
`subgraphs`	A list where each item contains the nodes of the connected components (cc) generated.
`ccgraph`	A object of class "igraph" which is a network with each connected components (cc) generated.