|
Class Summary |
| DirectedAcyclicGraph |
A directed acyclic graph (DAG). |
| DirectedGraph |
A directed graph. |
| Edge |
A weighted or unweighted edge for a directed or undirected graph. |
| Graph |
A graph with optionally-weighted edges and nodes. |
| GraphListener |
A class for tracking changes to a graph so that graph properties can be
recomputed only when necessary. |
| 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 optionally-weighted node for an undirected or directed graph. |