[igraph] Hierarchical node clustering algorithm

[Fernando Barraza]

Hi everybody,

In the paper of Ahn et al (2010) about Hierarchical Link Clustering method
to detect overlapping communities, they mentioned an algorithm of node
clustering based in the same approach of link similarities but using
instead node similarities. They used this algorithm as a control for the
measurements, among others overlapping and non-overlapping methods (CPM,
FastGreedy, Infomap).

Do you know if there are an igraph implementation of that algorithm? or in
other case a close approximation to it, for example a community detection
function in other python library?

I'm looking for that before to decide to code it from scratch.

Thanks in advance,

Fdo.