All Classes

Class	Description
AbsoluteCrossoverScalingControl	Scales to the absolute value passed as an argument.
AbstractElementParser<G extends Hypergraph<V,E>,V,E>	Base class for element parsers - provides some minimal functionality.
AbstractGraph<V,E>	Abstract implementation of the Graph interface.
AbstractGraphMousePlugin	a base class for GraphMousePlugin instances.
AbstractIterativeScorer<V,E,T>	An abstract class for algorithms that assign scores to vertices based on iterative methods.
AbstractIterativeScorerWithPriors<V,E,S>	An abstract class for iterative random-walk-based vertex scoring algorithms that have a fixed probability, for each vertex, of 'jumping' to that vertex at each step in the algorithm (rather than following a link out of that vertex).
AbstractLayout<V,E>	Abstract class for implementations of Layout.
AbstractLensSupport<V,E>	A class to make it easy to add an examining lens to a jung graph application.
AbstractLensSupport.Lens	the background for the hyperbolic projection
AbstractLensSupport.LensControls	the background for the hyperbolic projection
AbstractMetadata	Abstract base class for metadata - implements the property functionality
AbstractModalGraphMouse	AbstractModalGraphMouse is a PluggableGraphMouse class that manages a collection of plugins for picking and transforming the graph.
AbstractPickedState<T>	An abstract class to support ItemEvents for PickedState
AbstractPopupGraphMousePlugin
AbstractRanker<V,E>	Abstract class for algorithms that rank nodes or edges by some "importance" metric.
AbstractTypedGraph<V,E>	An abstract class for graphs whose edges all have the same EdgeType.
AbstractVertexShapeTransformer<V>
AddNodeDemo	Demonstrates visualization of a graph being actively updated.
AffineTransformer	Provides methods to map points from one coordinate system to another, by delegating to a wrapped AffineTransform (uniform) and its inverse.
AggregateGraph<V,E>
AggregateLayout<V,E>	A Layout implementation that combines multiple other layouts so that they may be manipulated as one layout.
AnimatedPickingGraphMousePlugin<V,E>	AnimatedPickingGraphMousePlugin supports the picking of one Graph Vertex.
AnimatingAddNodeDemo	A variation of AddNodeDemo that animates transitions between graph states.
Animator
AnnotatingGraphMousePlugin<V,E>	AnnotatingGraphMousePlugin can create Shape and Text annotations in a layer of the graph visualization.
AnnotatingModalGraphMouse<V,E>	a graph mouse that supplies an annotations mode
AnnotatingModalGraphMouse.ModeKeyAdapter
Annotation<T>	stores an annotation, either a shape or a string
Annotation.Layer
AnnotationControls<V,E>	a collection of controls for annotations.
AnnotationManager	handles the selection of annotations, and the support for the tools to draw them at specific layers.
AnnotationPaintable	handles the actual drawing of annotations
AnnotationRenderer	AnnotationRenderer is similar to the cell renderers used by the JTable and JTree JFC classes.
AnnotationsDemo<V,E>	Demonstrates annotation of graph elements.
ArrowFactory	A utility class for creating arrowhead shapes.
BalloonLayout<V,E>	A Layout implementation that assigns positions to Tree or Forest vertices using associations with nested circles ("balloons").
BalloonLayoutDemo	Demonstrates the visualization of a Tree using TreeLayout and BalloonLayout.
BarabasiAlbertGenerator<V,E>	Simple evolving scale-free random graph generator.
BarycenterScorer<V,E>	Assigns scores to each vertex according to the sum of its distances to all other vertices.
BasicEdgeArrowRenderingSupport<V,E>
BasicEdgeLabelRenderer<V,E>
BasicEdgeRenderer<V,E>
BasicMapEntry<K,V>	An simple minimal implementation of Map.Entry.
BasicRenderer<V,E>	The default implementation of the Renderer used by the VisualizationViewer.
BasicTransformer	A basic implementation of the MultiLayerTransformer interface that provides two Layers: VIEW and LAYOUT.
BasicVertexLabelRenderer<V,E>
BasicVertexLabelRenderer.InsidePositioner
BasicVertexLabelRenderer.OutsidePositioner
BasicVertexRenderer<V,E>
BasicVisualizationServer<V,E>	A class that maintains many of the details necessary for creating visualizations of graphs.
BetweennessCentrality<V,E>	Computes betweenness centrality for each vertex and edge in the graph.
BetweennessCentrality<V,E>	Computes betweenness centrality for each vertex and edge in the graph.
BFSDistanceLabeler<V,E>	Labels each node in the graph according to the BFS distance from the start node(s).
BicomponentClusterer<V,E>	Finds all biconnected components (bicomponents) of an undirected graph.
BidirectionalTransformer	Provides methods to map points from one coordinate system to another: graph to screen and screen to graph.
BoundingRectangleCollector<V,E>
BoundingRectanglePaintable<V,E>
Caching	Interface to provide external controls to an implementing class that manages a cache.
CachingEdgeRenderer<V,E>
CachingLayout<V,E>	A LayoutDecorator that caches locations in a clearable Map.
CachingRenderer<V,E>
CachingVertexRenderer<V,E>
CenterEdgeArrowRenderingSupport<V,E>
ChangeEventSupport	the implementing class provides support for ChangeEvents.
Checkmark	a simple Icon that draws a checkmark in the lower-right quadrant of its area.
CircleLayout<V,E>	A Layout implementation that positions vertices equally spaced on a regular circle.
CircleLayout.CircleVertexData
ClosenessCentrality<V,E>	Assigns scores to each vertex based on the mean distance to each other vertex.
ClosestShapePickSupport<V,E>	A GraphElementAccessor that finds the closest element to the pick point, and returns it if it is within the element's shape.
ClusteringDemo	This simple app demonstrates how one can use our algorithms and visualization libraries in unison.
ConstantDirectionalEdgeValueTransformer<V,E>	Returns the constructor-specified value for each edge type.
Context<G,E>	A class that is used to link together a graph element and a specific graph.
CrossoverScalingControl	A scaling control that has a crossover point.
CubicCurveEdgeEffects<V,E>
DAGLayout<V,E>	An implementation of Layout suitable for tree-like directed acyclic graphs.
DataElementParser<G extends Hypergraph<V,E>,V,E>	Parses the data element.
DataMetadata	Metadata structure for the 'data' GraphML element.
DefaultChangeEventSupport	Basic implementation of ChangeEventSupport, using standard jdk classes
DefaultEdgeLabelRenderer	DefaultEdgeLabelRenderer is similar to the cell renderers used by the JTable and JTree jfc classes.
DefaultModalGraphMouse<V,E>	DefaultModalGraphMouse is a PluggableGraphMouse class that pre-installs a large collection of plugins for picking and transforming the graph.
DefaultModalGraphMouse.ModeKeyAdapter
DefaultParallelEdgeIndexFunction<V,E>	A class which creates and maintains indices for parallel edges.
DefaultVertexLabelRenderer	DefaultVertexLabelRenderer is similar to the cell renderers used by the JTable and JTree JFC classes.
DefaultVisualizationModel<V,E>	The model containing state values for visualizations of graphs.
DegreeScorer<V>	Assigns a score to each vertex equal to its degree.
DelegateForest<V,E>	An implementation of Forest that delegates to a specified DirectedGraph instance.
DelegateToEdgeTransformer<V,E>	A Transformer<VEPair,Number that delegates its operation to a Transformer<E,Number>.
DelegateTree<V,E>	An implementation of Tree that delegates to a specified instance of DirectedGraph.
DemoLensVertexImageShaperDemo	Demonstrates the use of images to represent graph vertices.
DemoLensVertexImageShaperDemo.PickWithIconListener
DijkstraDistance<V,E>	Calculates distances in a specified graph, using Dijkstra's single-source-shortest-path algorithm.
DijkstraDistance.VertexComparator<V>	Compares according to distances, so that the BinaryHeap knows how to order the tree.
DijkstraShortestPath<V,E>	Calculates distances and shortest paths using Dijkstra's single-source-shortest-path algorithm.
DirectedGraph<V,E>	A tagging interface for implementations of Graph that accept only directed edges.
DirectedOrderedSparseMultigraph<V,E>	An implementation of DirectedGraph, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.
DirectedSparseGraph<V,E>	An implementation of DirectedGraph suitable for sparse graphs.
DirectedSparseMultigraph<V,E>	An implementation of DirectedGraph, suitable for sparse graphs, that permits parallel edges.
DirectionalEdgeArrowTransformer<V,E>	Returns wedge arrows for undirected edges and notched arrows for directed edges, of the specified dimensions.
DirectionTransformer	Functions for transforming graphs into directed or undirected graphs.
DiscreteDistribution	A utility class for calculating properties of discrete distributions.
Distance<V>	An interface for classes which calculate the distance between one vertex and another.
DistanceCentralityScorer<V,E>	Assigns scores to vertices based on their distances to each other vertex in the graph.
DistanceStatistics	Statistics relating to vertex-vertex distances in a graph.
DrawnIconVertexDemo	A demo that shows drawn Icons as vertices
EdgeArrowRenderingSupport<V,E>
EdgeBetweennessClusterer<V,E>	An algorithm for computing clusters (community structure) in graphs based on edge betweenness.
EdgeEffects<V,E>
EdgeElementParser<G extends Hypergraph<V,E>,V,E>	Parses an edge element.
EdgeIndexFunction<V,E>	An interface for a service to access the index of a given edge (in a given graph) into the set formed by the given edge and all the other edges it is parallel to.
EdgeLabelDemo	Demonstrates jung support for drawing edge labels that can be positioned at any point along the edge, and can be rotated to be parallel with the edge.
EdgeLabelRenderer
EdgeMetadata	Metadata structure for the 'edge' GraphML element.
EdgePredicateFilter<V,E>	Transforms the input graph into one which contains only those edges that pass the specified Predicate.
EdgeScorer<E,S>	An interface for algorithms that assign scores to edges.
EdgeShape<V,E>	An interface for decorators that return a Shape for a specified edge.
EdgeSupport<V,E>	interface to support the creation of new edges by the EditingGraphMousePlugin SimpleEdgeSupport is a sample implementation
EdgeType	Defines the possible edge types for graphs which assign types to edges.
EditingGraphMousePlugin<V,E>	A plugin that can create vertices, undirected edges, and directed edges using mouse gestures.
EditingModalGraphMouse<V,E>
EditingModalGraphMouse.ModeKeyAdapter
EditingPopupGraphMousePlugin<V,E>	a plugin that uses popup menus to create vertices, undirected edges, and directed edges.
EdmondsKarpMaxFlow<V,E>	Implements the Edmonds-Karp maximum flow algorithm for solving the maximum flow problem.
EigenvectorCentrality<V,E>	Calculates eigenvector centrality for each vertex in the graph.
ElementParser	Interface for all element parsers.
ElementParserRegistry<G extends Hypergraph<V,E>,V,E>	Registry for all element parsers.
EllipseVertexShapeTransformer<V>
EndpointElementParser<G extends Hypergraph<V,E>,V,E>	Parses endpoint elements.
EndpointMetadata	Metadata structure for the 'endpoint' GraphML element.
EndpointMetadata.EndpointType
EppsteinPowerLawGenerator<V,E>	Graph generator that generates undirected graphs with power-law degree distributions.
ErdosRenyiGenerator<V,E>	Generates a random graph using the Erdos-Renyi binomial model (each pair of vertices is connected with probability p).
EvolvingGraphGenerator<V,E>	An interface for algorithms that generate graphs that evolve iteratively.
ExceptionConverter	Converts an exception to the a GraphIOException.
FastRenderingGraph<V,E>	maintains caches of vertices and edges that will be the subset of the delegate graph's elements that are contained in some Rectangle.
FastRenderingLayout<V,E>	break into several rectangular areas, each of which will have a reference Graph
Filter<V,E>	An interface for classes that return a subset of the input Graph as a Graph.
FilterUtils	Utility methods relating to filtering.
FoldingTransformer<V,E>	Methods for creating a "folded" graph based on a k-partite graph or a hypergraph.
Forest<V,E>	An interface for a graph which consists of a collection of rooted directed acyclic graphs.
FourPassImageShaper	Provides Supplier methods that, given a BufferedImage, an Image, or the fileName of an image, will return a java.awt.Shape that is the contiguous traced outline of the opaque part of the image.
FRLayout<V,E>	Implements the Fruchterman-Reingold force-directed algorithm for node layout.
FRLayout.FRVertexData
FRLayout2<V,E>	Implements the Fruchterman-Reingold force-directed algorithm for node layout.
GeneralPathAsString
GradientEdgePaintTransformer<V,E>	Creates GradientPaint instances which can be used to paint an Edge.
GradientVertexRenderer<V,E>	A renderer that will fill vertex shapes with a GradientPaint
Graph<V,E>	A graph consisting of a set of vertices of type V set and a set of edges of type E.
GraphCollapser
GraphDecorator<V,E>	An implementation of Graph that delegates its method calls to a constructor-specified Graph instance.
GraphEditorDemo	Shows how to create a graph editor with JUNG.
GraphElementAccessor<V,E>	Interface for coordinate-based selection of graph components.
GraphElementParser<G extends Hypergraph<V,E>,V,E>	Parses graph elements.
GraphEvent<V,E>
GraphEvent.Edge<V,E>	An event type pertaining to graph edges.
GraphEvent.Type	Types of graph events.
GraphEvent.Vertex<V,E>	An event type pertaining to graph vertices.
GraphEventListener<V,E>	An interface for classes that listen for graph events.
GraphFile<V,E>	General interface for loading and saving a graph from/to disk.
GraphFromGraphMLDemo	Demonstrates loading (and visualizing) a graph from a GraphML file.
GraphGenerator<V,E>	An interface for algorithms that generate graphs.
Graphics2DWrapper	a complete wrapping of Graphics2D, useful as a base class.
GraphicsDecorator	an extendion of Graphics2DWrapper that adds enhanced methods for drawing icons and components
GraphIOException	Exception thrown when IO errors occur when reading/writing graphs.
GraphMetadata	Metadata structure for the 'graph' GraphML element.
GraphMetadata.EdgeDefault
GraphMLConstants	Provides some constants for element/attribute names in GraphML
GraphMLDocument	Maintains all the metadata read in from a single GraphML XML document.
GraphMLEventFilter	Filter to ignore unsupported XML events.
GraphMLMetadata<T>	Maintains information relating to data for the specified type.
GraphMLReader<G extends Hypergraph<V,E>,V,E>	Reads in data from a GraphML-formatted file and generates graphs based on that data.
GraphMLReader.KeyType
GraphMLReader.TagState
GraphMLReader2<G extends Hypergraph<V,E>,V,E>	Reads in data from a GraphML-formatted file and generates graphs based on that data.
GraphMLWriter<V,E>	Writes graphs out in GraphML format.
GraphMouseAdapter	Simple extension of MouseAdapter that supplies modifier checking
GraphMouseListener<V>	This interface allows users to register listeners to register to receive vertex clicks.
GraphMousePlugin	the interface for all plugins to the PluggableGraphMouse
GraphReader<G extends Hypergraph<V,E>,V,E>	Interface for a reader of graph objects
Graphs	Provides specialized implementations of GraphDecorator.
GraphZoomScrollPane	GraphZoomScrollPane is a Container for the Graph's VisualizationViewer and includes custom horizontal and vertical scrollbars.
GraphZoomScrollPaneDemo	Demonstrates the use of GraphZoomScrollPane.
HITS<V,E>	Assigns hub and authority scores to each vertex depending on the topology of the network.
HITS.Scores	Maintains hub and authority score information for a vertex.
HITSWithPriors<V,E>	A generalization of HITS that permits non-uniformly-distributed random jumps.
HyperbolicShapeTransformer	HyperbolicShapeTransformer extends HyperbolicTransformer and adds implementations for methods in ShapeFlatnessTransformer.
HyperbolicTransformer	HyperbolicTransformer wraps a MutableAffineTransformer and modifies the transform and inverseTransform methods so that they create a fisheye projection of the graph points, with points near the center spread out and points near the edges collapsed onto the circumference of an ellipse.
HyperEdgeElementParser<G extends Hypergraph<V,E>,V,E>	Parses hyper edge elements.
HyperEdgeMetadata	Metadata structure for the 'hyperedge' GraphML element.
Hypergraph<V,E>	A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.
ImageEdgeLabelDemo	Demonstrates the use of images on graph edge labels.
ImageShapeUtils
IncidentEdgeIndexFunction<V,E>	A class which creates and maintains indices for incident edges.
Indexer	A class providing static methods useful for improving the performance of graph algorithms.
InternalFrameSatelliteViewDemo	Similar to the SatelliteViewDemo, but using JInternalFrame.
InterpolatingVertexSizeTransformer<V>	Provides vertex sizes that are spaced proportionally between min_size and max_size depending on
Intersector
ISOMLayout<V,E>	Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph methods.
ISOMLayout.ISOMVertexData
IterativeContext	An interface for algorithms that proceed iteratively.
IterativeProcess	Provides basic infrastructure for iterative algorithms.
Key	GraphML key object that was parsed from the input stream.
Key.ForType	Enumeration for the 'for' type of this key.
KeyElementParser<G extends Hypergraph<V,E>,V,E>	Parses key elements.
KeyMap	A KeyMap is a storage mechanism for the keys read from the GraphML file.
KKLayout<V,E>	Implements the Kamada-Kawai algorithm for node layout.
KleinbergSmallWorldGenerator<V,E>	Graph generator that produces a random graph with small world properties.
KMeansClusterer<T>	Groups items into a specified number of clusters, based on their proximity in d-dimensional space, using the k-means algorithm.
KMeansClusterer.NotEnoughClustersException	An exception that indicates that the specified data points cannot be clustered into the number of clusters requested by the user.
KNeighborhoodFilter<V,E>	A filter used to extract the k-neighborhood around one or more root node(s).
KNeighborhoodFilter.EdgeType	The type of edge to follow for defining the neighborhood.
KPartiteGraph<V,E>	An interface for graphs whose vertices are each members of one of 2 or more disjoint sets (partitions), and whose edges connect only vertices in distinct partitions.
KStepMarkov<V,E>	Algorithm variant of PageRankWithPriors that computes the importance of a node based upon taking fixed-length random walks out from the root set and then computing the stationary probability of being at each node.
KStepMarkov<V,E>	A special case of PageRankWithPriors in which the final scores represent a probability distribution over position assuming a random (Markovian) walk of exactly k steps, based on the initial distribution specified by the priors.
L2RTreeLayoutDemo	A variant of TreeLayoutDemo that rotates the view by 90 degrees from the default orientation.
LabelEditingGraphMousePlugin<V,E>
LabelWrapper	A utility to wrap long lines, creating html strings with line breaks at a settable max line length
Lattice2DGenerator<V,E>	Simple generator of an m x n lattice where each vertex is incident with each of its neighbors (to the left, right, up, and down).
Layer
LayeredIcon	An icon that is made up of a collection of Icons.
Layout<V,E>	A generalized interface is a mechanism for returning (x,y) coordinates from vertices.
LayoutChangeListener<V,E>
LayoutDecorator<V,E>	a pure decorator for the Layout interface.
LayoutEvent<V,E>
LayoutEventSupport<V,E>
LayoutLensShapePickSupport<V,E>	ShapePickSupport provides access to Vertices and EdgeType based on their actual shapes.
LayoutLensSupport<V,E>	A class to make it easy to add an examining lens to a jung graph application.
LayoutScalingControl	LayoutScalingControl applies a scaling transformation to the graph layout.
LayoutTransition<V,E>
LensDemo	Demonstrates the use of HyperbolicTransform and MagnifyTransform applied to either the model (graph layout) or the view (VisualizationViewer) The hyperbolic transform is applied in an elliptical lens that affects that part of the visualization.
LensMagnificationGraphMousePlugin	HyperbolicMagnificationGraphMousePlugin changes the magnification within the Hyperbolic projection of the HyperbolicTransformer.
LensSupport	basic API for implementing lens projection support
LensTransformer	LensTransformer wraps a MutableAffineTransformer and modifies the transform and inverseTransform methods so that they create a projection of the graph points within an elliptical lens.
LensTranslatingGraphMousePlugin	Extends TranslatingGraphMousePlugin and adds the capability to drag and resize the viewing lens in the graph view.
LensVertexImageShaperDemo	Demonstrates the use of images to represent graph vertices.
LensVertexImageShaperDemo.PickWithIconListener
MagnifyIconGraphics	Subclassed to apply a magnification transform to an icon.
MagnifyImageLensSupport<V,E>	Changes various visualization settings to activate or deactivate an examining lens for a jung graph application.
MagnifyShapeTransformer	MagnifyShapeTransformer extends MagnifyTransformer and adds implementations for methods in ShapeTransformer.
MagnifyTransformer	MagnifyTransformer wraps a MutableAffineTransformer and modifies the transform and inverseTransform methods so that they create an enlarging projection of the graph points.
MapBinaryHeap<T>	An array-based binary heap implementation of a priority queue, which also provides efficient update() and contains operations.
MapSettableTransformer<I,O>	A SettableTransformer that operates on an underlying Map instance.
Metadata	Interface for any GraphML metadata.
Metadata.MetadataType	Metadata type enumeration
Metrics	A class consisting of static methods for calculating graph metrics.
MinimumSpanningForest<V,E>	For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
MinimumSpanningForest2<V,E>	For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
MinimumSpanningTreeDemo	Demonstrates a single graph with 3 layouts in 3 views.
MixedRandomGraphGenerator	Generates a mixed-mode random graph (with random edge weights) based on the output of BarabasiAlbertGenerator.
ModalGraphMouse	Interface for a GraphMouse that supports modality.
ModalGraphMouse.Mode
ModalLensGraphMouse	an implementation of the AbstractModalGraphMouse that includes plugins for manipulating a view that is using a LensTransformer.
ModalLensGraphMouse.ModeKeyAdapter
ModalSatelliteGraphMouse
MouseListenerTranslator<V,E>	This class translates mouse clicks into vertex clicks
MultiGraph<V,E>	A tagging interface which indicates that the implementing graph accepts parallel edges.
MultiLayerTransformer
MultiPickedState<T>	Maintains the state of what has been 'picked' in the graph.
MultiViewDemo	Demonstrates 3 views of one graph in one model with one layout.
MutableAffineTransformer	Provides methods to mutate the AffineTransform used by AffineTransformer base class to map points from one coordinate system to another.
MutableTransformer	Provides an API for the mutation of a Function and for adding listeners for changes on the Function
MutableTransformerDecorator	a complete decorator that wraps a MutableTransformer.
NodeElementParser<G extends Hypergraph<V,E>,V,E>	Parses node elements.
NodeMetadata	Metadata structure for the 'node' GraphML element.
NumberFormattingTransformer<T>	Transforms inputs to String representations by chaining an input Number-generating Function with an internal NumberFormat instance.
ObservableCachingLayout<V,E>	A LayoutDecorator that fires ChangeEvents when certain methods are called.
ObservableGraph<V,E>	A decorator class for graphs which generates events
OrderedKAryTree<V,E>	An implementation of Tree in which each vertex has ≤ k children.
OrderedSparseMultigraph<V,E>	An implementation of Graph that orders its vertex and edge collections according to insertion time, is suitable for sparse graphs, and permits directed, undirected, and parallel edges.
PageRank<V,E>	Assigns scores to each vertex according to the PageRank algorithm.
PageRankWithPriors<V,E>	A generalization of PageRank that permits non-uniformly-distributed random jumps.
Pair<T>	An implementation of Collection that stores exactly 2 non-null objects and is not mutable.
PajekNetReader<G extends Graph<V,E>,V,E>	Reads a Graph from a Pajek NET formatted source.
PajekNetReader.ListTagPred	A Predicate which evaluates to true if the argument ends with the string "list".
PajekNetReader.StartsWithPredicate	A Predicate which evaluates to true if the argument starts with the constructor-specified String.
PajekNetWriter<V,E>	Writes graphs in the Pajek NET format.
ParallelEdgeShapeTransformer<V,E>	An abstract class for edge-to-Shape functions that work with parallel edges.
ParserContext<G extends Hypergraph<V,E>,V,E>	Provides resources related to the current parsing context.
PersistentLayout<V,E>	interface for PersistentLayout Also holds a nested class Point to serialize the Vertex locations
PersistentLayout.Point	a serializable class to save locations
PersistentLayoutDemo	Demonstrates the use of PersistentLayout and PersistentLayoutImpl.
PersistentLayoutImpl<V,E>	Implementation of PersistentLayout.
PersistentLayoutImpl.RandomPointFactory<V>
PickableEdgePaintTransformer<E>	Paints each edge according to the Paint parameters given in the constructor, so that picked and non-picked edges can be made to look different.
PickableVertexIconTransformer<V>	Supplies an Icon for each vertex according to the Icon parameters given in the constructor, so that picked and non-picked vertices can be made to look different.
PickableVertexPaintTransformer<V>	Paints each vertex according to the Paint parameters given in the constructor, so that picked and non-picked vertices can be made to look different.
PickedInfo<T>	An interface for classes that return information regarding whether a given graph element (vertex or edge) has been selected.
PickedState<T>	An interface for classes that keep track of the "picked" state of edges or vertices.
PickingGraphMousePlugin<V,E>	PickingGraphMousePlugin supports the picking of graph elements with the mouse.
PivotingImageShaper	Provides Supplier methods that, given a BufferedImage, an Image, or the fileName of an image, will return a java.awt.Shape that is the contiguous traced outline of the opaque part of the image.
PluggableGraphMouse	a GraphMouse that accepts plugins for various mouse events.
PluggableRenderContext<V,E>
PluggableRendererDemo	Shows off some of the capabilities of PluggableRenderer.
PolarPoint	Represents a point in polar coordinates: distance and angle from the origin.
PortElementParser<G extends Hypergraph<V,E>,V,E>	Parses port elements.
PortMetadata	Metadata structure for the 'port' GraphML element.
PredicatedParallelEdgeIndexFunction<V,E>	A class which creates and maintains indices for parallel edges.
PrimMinimumSpanningTree<V,E>	For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
RadialTreeLayout<V,E>	A radial layout for Tree or Forest graphs.
RadialTreeLensDemo	Shows a RadialTreeLayout view of a Forest.
RadiusGraphElementAccessor<V,E>	Simple implementation of PickSupport that returns the vertex or edge that is closest to the specified location.
RadiusPickSupport<V,E>	Simple implementation of PickSupport that returns the vertex or edge that is closest to the specified location.
RandomLocationTransformer<V>	Provides a random vertex location within the bounds of the Dimension property.
Ranking<V>	Abstract data container for ranking objects.
RelativeAuthorityRanker<V,E>	This class provides basic infrastructure for relative authority algorithms that compute the importance of nodes relative to one or more root nodes.
Relaxer	Interface for operating the relax iterations on a layout.
RenderContext<V,E>
RenderContext.DirectedEdgeArrowPredicate<V,E>
RenderContext.UndirectedEdgeArrowPredicate<V,E>
Renderer<V,E>	The interface for drawing vertices, edges, and their labels.
Renderer.Edge<V,E>
Renderer.Edge.NOOP
Renderer.EdgeLabel<V,E>
Renderer.EdgeLabel.NOOP
Renderer.Vertex<V,E>
Renderer.Vertex.NOOP
Renderer.VertexLabel<V,E>
Renderer.VertexLabel.NOOP
Renderer.VertexLabel.Position
Renderer.VertexLabel.Positioner
ReshapingEdgeRenderer<V,E>	uses a flatness argument to break edges into smaller segments.
RotatingGraphMousePlugin	RotatingGraphMouse provides the abiity to rotate the graph using the mouse.
SatelliteAnimatedPickingGraphMousePlugin<V,E>	A version of the AnimatedPickingGraphMousePlugin that is for the SatelliteVisualizationViewer.
SatelliteRotatingGraphMousePlugin	Mouse events in the SatelliteView that match the modifiers will cause the Main view to rotate
SatelliteScalingGraphMousePlugin	Overrides ScalingGraphMousePlugin so that mouse events in the satellite view will cause scaling in the main view
SatelliteShearingGraphMousePlugin	Overrides ShearingGraphMousePlugin so that mouse events in the satellite view cause shearing of the main view
SatelliteTranslatingGraphMousePlugin	Overrides TranslatingGraphMousePlugin so that mouse events in the satellite view cause translating of the main view
SatelliteViewDemo<V,E>	Demonstrates the construction of a graph visualization with a main and a satellite view.
SatelliteVisualizationViewer<V,E>	A VisualizationViewer that can act as a satellite view for another (master) VisualizationViewer.
ScalingControl
ScalingGraphMousePlugin	ScalingGraphMouse applies a scaling transformation to the graph layout.
ScoringUtils	Methods for assigning values (to be interpreted as prior probabilities) to vertices in the context of random-walk-based scoring algorithms.
SelfLoopEdgePredicate<V,E>	A Predicate that returns true if the input edge's endpoints in the input graph are identical.
SetHypergraph<V,H>	An implementation of Hypergraph that is suitable for sparse graphs and permits parallel edges.
SettableTransformer<I,O>	An interface for classes that can set the value to be returned (from transform()) when invoked on a given input.
SettableVertexShapeTransformer<V>
ShapeFlatnessTransformer	Provides methods to map points from one coordinate system to another: graph to screen and screen to graph.
ShapePickSupport<V,E>	A GraphElementAccessor that returns elements whose Shape contains the specified pick point or region.
ShapePickSupport.Style	The available picking heuristics: Style.CENTERED: returns the element whose center is closest to the pick point.
ShapeTransformer	Provides methods to map points from one coordinate system to another: graph to screen and screen to graph.
ShearingGraphMousePlugin	ShearingGraphMousePlugin allows the user to drag with the mouse to shear the transform either in the horizontal or vertical direction.
ShortestPath<V,E>	An interface for algorithms that calculate shortest paths.
ShortestPathDemo	Demonstrates use of the shortest path algorithm and visualization of the results.
ShortestPathUtils	Utilities relating to the shortest paths in a graph.
ShowLayouts	Demonstrates several of the graph layout algorithms.
ShowLayouts.GraphChooser
SimpleEdgeSupport<V,E>
SimpleGraphDraw	A class that shows the minimal work necessary to load and visualize a graph.
SimpleVertexSupport<V,E>	sample implementation showing how to use the VertexSupport interface member of the EditingGraphMousePlugin.
SortedSparseMultigraph<V,E>	An implementation of Graph that is suitable for sparse graphs, orders its vertex and edge collections according to either specified Comparator instances or the natural ordering of their elements, and permits directed, undirected, and parallel edges.
SparseGraph<V,E>	An implementation of Graph that is suitable for sparse graphs and permits both directed and undirected edges.
SparseMultigraph<V,E>	An implementation of Graph that is suitable for sparse graphs and permits directed, undirected, and parallel edges.
SpringLayout<V,E>	The SpringLayout package represents a visualization of a set of nodes.
SpringLayout.SpringVertexData
SpringLayout2<V,E>	The SpringLayout package represents a visualization of a set of nodes.
StaticLayout<V,E>	StaticLayout places the vertices in the locations specified by its initializer, and has no other behavior.
StringElementParser<G extends Hypergraph<V,E>,V,E>	Parses an element that just contains text.
StructuralHoles<V,E>	Calculates some of the measures from Burt's text "Structural Holes: The Social Structure of Competition".
StructurallyEquivalent<V,E>	Identifies sets of structurally equivalent vertices in a graph.
SubLayoutDemo	Demonstrates the AggregateLayout class.
TestGraphs	Provides generators for several different test graphs.
ToStringLabeller	Labels vertices by their toString.
TransformingFlatnessGraphics	subclassed to pass certain operations thru the Function before the base class method is applied This is useful when you want to apply non-affine transformations to the Graphics2D used to draw elements of the graph.
TransformingGraphics	subclassed to pass certain operations thru the Function before the base class method is applied This is useful when you want to apply non-affine transformations to the Graphics2D used to draw elements of the graph.
TranslatingGraphMousePlugin	TranslatingGraphMousePlugin uses a MouseButtonOne press and drag gesture to translate the graph display in the x and y direction.
Tree<V,E>	A subtype of Graph which is a (directed, rooted) tree.
TreeCollapseDemo	Demonstrates "collapsing"/"expanding" of a tree's subtrees.
TreeCollapser
TreeLayout<V,E>
TreeLayoutDemo	Demonsrates TreeLayout and RadialTreeLayout.
TreeUtils	Contains static methods for operating on instances of Tree.
TriadicCensus	TriadicCensus is a standard social network tool that counts, for each of the different possible configurations of three vertices, the number of times that that configuration occurs in the given graph.
TwoModelDemo	Demonstrates a single graph with 2 layouts in 2 views.
UndirectedGraph<V,E>	A tagging interface for extensions of Graph that accept only undirected edges.
UndirectedOrderedSparseMultigraph<V,E>	An implementation of UndirectedGraph that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits parallel edges.
UndirectedSparseGraph<V,E>	An implementation of UndirectedGraph that is suitable for sparse graphs.
UndirectedSparseMultigraph<V,E>	An implementation of UndirectedGraph that is suitable for sparse graphs and permits parallel edges.
UnicodeLabelDemo	A demo that shows flag images as vertices, and uses unicode to render vertex labels.
UniformDegreeWeight<V,E>	An edge weight function that assigns weights as uniform transition probabilities.
UniformInOut<V,E>	Assigns weights to directed edges (the edge of the vertex/edge pair) depending on whether the vertex is the edge's source or its destination.
UnknownElementParser	Skips an entire unknown subtree of the XML
UnweightedShortestPath<V,E>	Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
VEPair<V,E>	Convenience class for associating a vertex and an edge.
VertexCollapseDemo	A demo that shows how collections of vertices can be collapsed into a single vertex.
VertexCollapseDemoWithLayouts	A demo that shows how collections of vertices can be collapsed into a single vertex.
VertexIconShapeTransformer<V>	A default implementation that stores images in a Map keyed on the vertex.
VertexImageShaperDemo	Demonstrates the use of images to represent graph vertices.
VertexImageShaperDemo.DemoVertexIconShapeTransformer<V>	this class exists only to provide settings to turn on/off shapes and image fill in this demo.
VertexImageShaperDemo.DemoVertexIconTransformer<V>	This class exists only to provide settings to turn on/off shapes and image fill in this demo.
VertexImageShaperDemo.PickWithIconListener<V>	When Vertices are picked, add a checkmark icon to the imager.
VertexImageShaperDemo.VertexStringerImpl<V,S>	A simple implementation of VertexStringer that gets Vertex labels from a Map
VertexLabelAsShapeDemo	This demo shows how to use the vertex labels themselves as the vertex shapes.
VertexLabelAsShapeRenderer<V,E>	Renders Vertex Labels, but can also supply Shapes for vertices.
VertexLabelPositionDemo	Demonstrates vertex label positioning controlled by the user.
VertexLabelRenderer
VertexPartition<V,E>	Maintains information about a vertex partition of a graph.
VertexPartitionCollapser<V,E,CV,CE>	This class transforms a graph with a known vertex partitioning into a graph whose vertices correspond to the input graph's partitions.
VertexPredicateFilter<V,E>	Transforms the input graph into one which contains only those vertices that pass the specified Predicate.
VertexScorer<V,S>	An interface for algorithms that assign scores to vertices.
VertexScoreTransformer<V,S>	A Function convenience wrapper around VertexScorer.
VertexShapeFactory<V>	A utility class for generating Shapes for drawing vertices.
VertexSupport<V,E>	interface to support the creation of new vertices by the EditingGraphMousePlugin.
ViewLensShapePickSupport<V,E>	ShapePickSupport provides access to Vertices and EdgeType based on their actual shapes.
ViewLensSupport<V,E>	Uses a LensTransformer to use in the view transform.
ViewScalingControl	ViewScalingGraphMouse applies a scaling transform to the View of the graph.
ViewTranslatingGraphMousePlugin	ViewTranslatingGraphMousePlugin uses a MouseButtonOne press and drag gesture to translate the graph display in the x and y direction by changing the AffineTransform applied to the Graphics2D.
VisRunner	Implementation of a relaxer thread for layouts.
VisualizationImageServer<V,E>	A class that could be used on the server side of a thin-client application.
VisualizationImageServerDemo	Demonstrates VisualizationImageServer.
VisualizationModel<V,E>	Interface for the state holding model of the VisualizationViewer.
VisualizationServer<V,E>
VisualizationServer.Paintable	an interface for the preRender and postRender
VisualizationViewer<V,E>	Adds mouse behaviors and tooltips to the graph visualization base class
VisualizationViewer.GraphMouse	a convenience type to represent a class that processes all types of mouse events for the graph
VoltageClusterer<V,E>	Clusters vertices of a Graph based on their ranks as calculated by VoltageScorer.
VoltageScorer<V,E>	Assigns scores to vertices according to their 'voltage' in an approximate solution to the Kirchoff equations.
WeakComponentClusterer<V,E>	Finds all weak components in a graph as sets of vertex sets.
WeightedChoice<T>	Selects items according to their probability in an arbitrary probability distribution.
WeightedNIPaths<V,E>	This algorithm measures the importance of nodes based upon both the number and length of disjoint paths that lead to a given node from each of the nodes in the root set.
WorldMapGraphDemo	Shows a graph overlaid on a world map image.