Implementations
We have prepared two implementations of the clustering algorithm:
the first works on a 2D matrix (recommended for dense graphs)
the second uses sibling lists (for sparse graph representations).