Interface CommunityDetectionAlgorithm<U>

Type Parameters:
U - Type of the users.
All Known Implementing Classes:
AbstractFastGreedy, AlternativeGiniFastGreedy, BalancedFastGreedy, FastGreedy, GiniWeightedFastGreedy, GirvanNewman, Infomap, LabelPropagation, LeadingVector, Louvain, NormalizedCutSpectralClustering, RatioCutSpectralClustering, SizeWeightedFastGreedy, SpectralClustering, StronglyConnectedComponents, WeaklyConnectedComponents

public interface CommunityDetectionAlgorithm<U>
Algorithm for detecting the communities of a graph.
  • Method Summary

    Modifier and Type Method Description
    Communities<U> detectCommunities​(Graph<U> graph)
    Computes the communities for a certain graph.
  • Method Details

    • detectCommunities

      Communities<U> detectCommunities​(Graph<U> graph)
      Computes the communities for a certain graph.
      Parameters:
      graph - The full graph.
      Returns:
      The communities if everything went OK, null if not.