public class ShortPathClustering
extends InteractionGraph
Algorithm of clustering based on
a distance computed by minimum linkage of the oriented shortest path
when shortest paths are equal, the bigger number of links is get as minimum
The ceiling size of cluster and the max length of shortest paths are parameters
the condition to stop clustering is the
- the maximal length of shortest paths is reached
- the number of clusters remaining in the queue is less than 2
When the size of an union of clusters exceed the ceiling size, it is not created and
the biggest is out of the queue and kept apart
the start list of nodes is sorted by in degree, so sources are first
every created cluster is placed at the end of the queue to slow the increasing of size