See: Description
Interface  Description 

CPO<T> 
An interface defining the operations on complete partial order (CPO).

InequalityTerm 
An interface for a term in an inequality over a CPO.

NonLatticeCounterExample.ExampleType 
Marker interface for the counter example type.

Class  Description 

DirectedAcyclicGraph 
A directed acyclic graph (DAG).

DirectedGraph 
A directed graph.

Edge 
A weighted or unweighted edge for a directed or undirected graph.

Element 
A base class for graph elements (nodes and edges).

ElementList 
A list of graph elements.

Graph 
A graph with optionallyweighted nodes and edges.

Inequality 
An inequality over a CPO.

InequalitySolver 
An algorithm to solve a set of inequality constraints.

LabeledList 
A list of unique objects (elements) with a mapping from the
elements into consecutive integer labels.

Node 
An optionallyweighted node for an undirected or directed graph.

NonLatticeCounterExample 
A data structure that provides counterexample information when a graph is
tested to see if it is a lattice.

Enum  Description 

CPO.BoundType 
An enumeration type to represent the two different types of bounds
that can be calculated on a set of nodes in a CPO; either
a greatest lower bound or least upper bound.

NonLatticeCounterExample.GraphExampleType 
An enumeration type to represent the types of counterexamples
that can be found when checking to see if a graph is a lattice.

Exception  Description 

GraphActionException 
Exception for graph action errors.

GraphConstructionException 
The exception of modifying graph elements in wrong ways.

GraphElementException 
The exception of accessing graph elements in wrong ways.

GraphException 
Base exception for graph errors.

GraphInvalidStateException 
Exception for graph invalid state action errors.

GraphStateException 
The exception of computing a function of graph with wrong states.

GraphTopologyException 
The exception thrown due to incorrect graph topology.

GraphWeightException 
Exception for unweighted graphs or graphs with improper weights.

Documentation for the ptolemy.graph package may be found in Volume 2 of the Ptolemy Design Document, available at http://ptolemy.eecs.berkeley.edu/ptolemyII/designdoc.htm.
Significant portions of the ptolemy.graph
package were developed
by Professor Shuvra S. Bhattacharyya and his group.