An interface defining the operations on complete partial order (CPO).
An interface for a term in an inequality over a CPO.
Marker interface for the counter example type.
A directed acyclic graph (DAG).
A directed graph.
A weighted or unweighted edge for a directed or undirected graph.
A base class for graph elements (nodes and edges).
A list of graph elements.
A graph with optionally-weighted nodes and edges.
An inequality over a CPO.
An algorithm to solve a set of inequality constraints.
A list of unique objects (elements) with a mapping from the elements into consecutive integer labels.
An optionally-weighted node for an undirected or directed graph.
A data structure that provides counterexample information when a graph is tested to see if it is a lattice.
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.
An enumeration type to represent the types of counterexamples that can be found when checking to see if a graph is a lattice.
Exception for graph action errors.
The exception of modifying graph elements in wrong ways.
The exception of accessing graph elements in wrong ways.
Base exception for graph errors.
Exception for graph invalid state action errors.
The exception of computing a function of graph with wrong states.
The exception thrown due to incorrect graph topology.
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.