Uses of Interfaceorg.jgrapht.alg.interfaces.MaximumDensitySubgraphAlgorithm

• Packages that use MaximumDensitySubgraphAlgorithm
Package Description
org.jgrapht.alg.densesubgraph
Algorithms for computing maximum density subgraphs.
• Uses of MaximumDensitySubgraphAlgorithm in org.jgrapht.alg.densesubgraph

Classes in org.jgrapht.alg.densesubgraph that implement MaximumDensitySubgraphAlgorithm
Modifier and Type Class and Description
class  GoldbergMaximumDensitySubgraphAlgorithm<V,E>
This class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.
class  GoldbergMaximumDensitySubgraphAlgorithmBase<V,E>
This abstract base class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.
class  GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight<V extends Pair<?,Double>,E>
This class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.
class  GoldbergMaximumDensitySubgraphAlgorithmNodeWeights<V extends Pair<?,Double>,E>
This class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.