An object which provides relationships between two objects.
Edge segments are composed of an edge and its two connected nodes.
A Grid data structure which represents an orthogonal set of data objects.
Abstract implementation of a Graph.
This class represents an accumulated edge.
Grid implementation using integral coordinates.
Graph class implementation which provides utilities to keep track of separate clusters within the graph.
Implementation of a Directed Graph.
A GraphPath is a path along a graph.
This class is a set of static utility methods which operate on Graphs.
This class implements a PathIterator that traverses across a collection of shapes, treating them as a single shape.
Encrypts a property map of strings to a file, or decrypts the property map from the file.
Grid implementation which uses double values for its coordinates.
This class is designed to provide SVG output for drawing objects with Java2D.
This extension of DataGraph adds support for Timed Edges and Nodes
Simple extension to DefaultMutableTreeNode which allows typing of the object stored at each node
|TreeGraph<N extends javax.swing.tree.DefaultMutableTreeNode,E>||
Utility class for graphs which contain Trees as nodes.
Implementation of an Undirected Graph.
Determines whether an edge is acceptible to add to a TreeGraph
Provides a number of data structures and support classes. These structures - Graphs, Trees, and Grids - provide a set of data structures which can be used for a variety of applications. These data structures are implemented with Generics, allowing an application to use a flexible approach for organizing its data. The classes are designed to conform to the style used by the Collections framework, and therefore should be familiar to most developers.