Clustering Networks based on Adjacency Matrix

This workflow clusters nodes of a given network by extracting node adjacency matrix first and use that to generate a distance matrix which is used to preform hierarchical clustering. The resulting clusters are added into the network as new node partitions. Once all cluster members are assigned to the corresponding cluster partition a partition graph is generated which shows the connections between partitions and the size of each partition.

This is a companion discussion topic for the original entry at