Class MaxMaxClustering.MaxMaxClusteringImpl<V>

  • Type Parameters:
    V - the type of nodes in the graph
    All Implemented Interfaces:
    Serializable, Iterable<Set<V>>, org.jgrapht.alg.interfaces.ClusteringAlgorithm.Clustering<V>, MaxMaxClustering<V>
    Enclosing interface:
    MaxMaxClustering<V>

    public static class MaxMaxClustering.MaxMaxClusteringImpl<V>
    extends org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl<V>
    implements MaxMaxClustering<V>
    Default implementation of the MaxMax clustering.
    See Also:
    Serialized Form
    • Constructor Detail

      • MaxMaxClusteringImpl

        public MaxMaxClusteringImpl​(List<Set<V>> clusters,
                                    org.jgrapht.Graph<V,​org.jgrapht.graph.DefaultEdge> digraph,
                                    Set<V> roots)
        Construct a new MaxMax clustering.
        Parameters:
        clusters - the clusters
        digraph - the directed graph representation
        roots - the map of root and non-root nodes
    • Method Detail

      • getDigraph

        public org.jgrapht.Graph<V,​org.jgrapht.graph.DefaultEdge> getDigraph()
        Description copied from interface: MaxMaxClustering
        Return the directed graph representation of the input graph.
        Specified by:
        getDigraph in interface MaxMaxClustering<V>
        Returns:
        a directed graph