Module org.jgrapht.core
Package org.jgrapht.alg.interfaces
Interface MaximumDensitySubgraphAlgorithm<V,E>
-
- Type Parameters:
V- the graph vertex typeE- 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
All Methods Instance Methods Abstract Methods Modifier and Type Method Description Graph<V,E>calculateDensest()Calculate a maximum density subgraphdoublegetDensity()Computes density of a maximum density subgraph.
-