JUNG - Algorithms 2.1.1 API

Packages

Package	Description
edu.uci.ics.jung.algorithms.blockmodel	Support for establishing and maintaining graph element equivalence (such as in blockmodeling).
edu.uci.ics.jung.algorithms.cluster	Mechanisms for identifying clusters in graphs.
edu.uci.ics.jung.algorithms.filters	Filtering mechanisms that produce subgraphs of an original graph.
edu.uci.ics.jung.algorithms.flows	Methods for calculating properties relating to network flows (such as max flow/min cut).
edu.uci.ics.jung.algorithms.generators	Methods for generating new (often random) graphs with various properties.
edu.uci.ics.jung.algorithms.generators.random	Methods for generating random graphs with various properties.
edu.uci.ics.jung.algorithms.importance
edu.uci.ics.jung.algorithms.layout	Algorithms for assigning 2D coordinates (typically used for graph visualizations) to vertices.
edu.uci.ics.jung.algorithms.layout.util	Utility classes for updating layout positions.
edu.uci.ics.jung.algorithms.metrics	Specialized measures for graph properties.
edu.uci.ics.jung.algorithms.scoring	Mechanisms for assigning values (denoting significance, influence, centrality, etc.) to graph elements based on topological properties.
edu.uci.ics.jung.algorithms.scoring.util	Utility functions for assigning scores to graph elements.
edu.uci.ics.jung.algorithms.shortestpath	Provides interfaces and classes for calculating (geodesic) distances and shortest paths.
edu.uci.ics.jung.algorithms.transformation	Mechanisms for graph transformation.
edu.uci.ics.jung.algorithms.util	Provides general algorithmic utilities.