Uses of Package
edu.uci.ics.jung.algorithms.util

Package
Description
Mechanisms for identifying clusters in graphs.
Methods for calculating properties relating to network flows (such as max flow/min cut).
Methods for generating random graphs with various properties.
 
Algorithms for assigning 2D coordinates (typically used for graph visualizations) to vertices.
Utility classes for updating layout positions.
Mechanisms for assigning values (denoting significance, influence, centrality, etc.) to graph elements based on topological properties.
Provides interfaces and classes for calculating (geodesic) distances and shortest paths.
Provides general algorithmic utilities.
Interfaces and classes for reading and writing graphs in various (file) formats.
Visualization mechanisms related to graph layout: caching, persistence, event-emitting, etc.
Utilities for graph visualization.