Interface MaximumDensitySubgraphAlgorithm<V,E>

Type Parameters:
V - the graph vertex type
E - the graph edge type
All Known Implementing Classes:
GoldbergMaximumDensitySubgraphAlgorithm, GoldbergMaximumDensitySubgraphAlgorithmBase, GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight, GoldbergMaximumDensitySubgraphAlgorithmNodeWeights

public interface MaximumDensitySubgraphAlgorithm<V,E>
Interface for algorithms computing the maximum density subgraph
Author:
Andre Immig
  • Method Summary

    Modifier and Type
    Method
    Description
    Calculate a maximum density subgraph
    double
    Computes density of a maximum density subgraph.
  • Method Details

    • calculateDensest

      Graph<V,E> calculateDensest()
      Calculate a maximum density subgraph
      Returns:
      the maximum density subgraph
    • getDensity

      double getDensity()
      Computes density of a maximum density subgraph.
      Returns:
      the actual density of the maximum density subgraph