|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |
See:
Description
Packages | |
edu.uci.ics.jung.algorithms | Provides a set of specialized algorithms for computing various measures on graphs as well as transforming graphs in different ways. |
edu.uci.ics.jung.algorithms.blockmodel | Implementations of a notion of graph equivalence for blockmodeling, and a mechanism for collapsing blocks. |
edu.uci.ics.jung.algorithms.cluster | Provides a series of methods for locating clusters in graphs according to some model-based, heuristic or graph-theoretic criteria. |
edu.uci.ics.jung.algorithms.connectivity | Provides a series of methods for computing various aspects of a graph's overall connectivity structure. |
edu.uci.ics.jung.algorithms.flows | Provides a series of methods for solving the s-t max flow and other network flow problems. |
edu.uci.ics.jung.algorithms.importance | Provides a set of algorithms for computing the importance of each node (or edge)
in a graph relative to all others (or, for the algorithms that inherit from
RelativeAuthorityRanker , relative to a specified subset of elements).
|
edu.uci.ics.jung.algorithms.metrics | |
edu.uci.ics.jung.algorithms.shortestpath | Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph. |
edu.uci.ics.jung.algorithms.transformation | |
edu.uci.ics.jung.exceptions | Provides customized exceptions for the JUNG framework. |
edu.uci.ics.jung.graph | Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes. |
edu.uci.ics.jung.graph.decorators | Provides mechanisms for annotating nodes consistently with useful information. |
edu.uci.ics.jung.graph.event | |
edu.uci.ics.jung.graph.filters | Provides for a filtering mechanism that produces subgraphs of an original graph. |
edu.uci.ics.jung.graph.filters.impl | Provides sample implementations and generally useful filters. |
edu.uci.ics.jung.graph.impl | Implementations of the JUNG vertex, edge, and graph interfaces. |
edu.uci.ics.jung.graph.predicates | A Predicate tests whether an Object satisfies a specific
implementation-defined property. |
edu.uci.ics.jung.io | Provides a set of graph file format interpreters for loading graphs from disk. |
edu.uci.ics.jung.random.generators | Provides a series of methods for generating new graphs with various properties. |
edu.uci.ics.jung.random.permuters | Provides a series of methods for permuting graphs in different ways. |
edu.uci.ics.jung.statistics | Provides a set of statistical tools for analyzing graphs. |
edu.uci.ics.jung.utils | Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application. |
edu.uci.ics.jung.visualization | Provides a visualization mechanism for drawing and rendering Graphs. |
edu.uci.ics.jung.visualization.contrib | These are additional layouts contributed by various users. |
edu.uci.ics.jung.visualization.control | |
edu.uci.ics.jung.visualization.graphdraw | Provides support classes for the GraphDraw mechanism: generalized functions so users can tweak variables freely when creating with EdgeDraw. |
edu.uci.ics.jung.visualization.subLayout | |
edu.uci.ics.jung.visualization.transform | |
edu.uci.ics.jung.visualization.transform.shape | |
samples.graph | Provides sample graph code that may be of interest. |
samples.graph.southern | |
samples.preview_new_graphdraw | This module provides a new way of thinking about graph drawing. |
samples.preview_new_graphdraw.event | |
samples.preview_new_graphdraw.impl | |
samples.preview_new_graphdraw.impl.crooked | |
samples.preview_new_graphdraw.iter | |
samples.preview_new_graphdraw.iterablelayouts | |
samples.preview_new_graphdraw.staticlayouts | |
samples.preview_new_graphdraw.test | |
samples.preview_new_graphdraw.transform |
The JUNG library provides a variety of graph algorithms, network visualization tools, and support for dynamic graphs through a filtering system.
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |