Packages |
jdsl.core.algo.sorts |
Package of sorting algorithms that operate on Sequences (defined in
jdsl.core.api). |
jdsl.core.algo.traversals |
Package of traversal algorithms that operate
on jdsl.core.api.InspectableTree objects. A traversal
algorithm performs operations while visiting the nodes of a tree. |
jdsl.core.api |
Package of interfaces and exceptions that compose
the API for JDSL's core data structures: sequences, trees, priority queues,
and dictionaries (a/k/a maps or associative arrays). |
jdsl.core.ref |
Package of implementations of the interfaces in jdsl.core.api. |
jdsl.core.util |
Package that provides convenient conversions between data
structure types, including those in java.util. |
jdsl.geomobj.api |
This package contains interfaces for basic geometric objects, such
as points, linear curves, rectangles, and circles, and for
geometric testers and constructors. |
jdsl.geomobj.ref |
This package contains implementations of the interfaces in
jdsl.geomobj.api . |
jdsl.graph.algo |
Package of basic graph algorithms, including algorithms
for depth-first search, single-source shortest paths (Dijkstra's), topological
sort (Knuth), and minimum spanning trees (Prim-Jarnik). |
jdsl.graph.api |
Package of container and accessor interfaces for
graphs. In general, developers should implement the InspectableGraph
or ModifiableGraph interfaces, that provide descriptions of methods
needed for most graph types. The interface defines the methods
for the general graph type. |
jdsl.graph.ref |
Package of implementations of the interfaces in jdsl.graph.api.
The IncidenceListGraph class provides a very general graph implementation.
The package also contains Iterator types VertexIterator
and EdgeIterator for iterating over Vertex and Edge
accessors. |
jdsl.map.api |
This package contains interfaces for Ordered Graphs and Embedded
Planar Graphs. |
jdsl.map.ref |
This package contains implementations of the interfaces in
jdsl.map.api . |