Uses of Class
org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Packages that use GoldbergMaximumDensitySubgraphAlgorithmBase Package Description org.jgrapht.alg.densesubgraph Algorithms for computing maximum density subgraphs. -
-
Uses of GoldbergMaximumDensitySubgraphAlgorithmBase in org.jgrapht.alg.densesubgraph
Subclasses of GoldbergMaximumDensitySubgraphAlgorithmBase in org.jgrapht.alg.densesubgraph Modifier and Type Class 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
GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight<V extends Pair<?,java.lang.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<?,java.lang.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.
-