|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Mapping | |
---|---|
goldman.collection.tagged.set | A mapping is the tagged variation of a set. |
goldman.graph | A graph represents general relationships between pairs of elements from among a set of elements. |
Uses of Mapping in goldman.collection.tagged.set |
---|
Classes in goldman.collection.tagged.set that implement Mapping | |
---|---|
class |
DirectAddressingMapping<K,V>
A tagged version of a directed addressing. |
class |
OpenAddressingMapping<K,V>
A tagged version of a open addressing. |
class |
SeparateChainingMapping<K,V>
A tagged version of a separate chaining. |
Uses of Mapping in goldman.graph |
---|
Classes in goldman.graph that implement Mapping | |
---|---|
class |
InTree<V,E extends Edge<V>>
The InTree class provides an implementation of an in-tree that stores a parent edge associated with each vertex of the graph (possibly null). |
class |
ShortestPathMatrix<V,E extends WeightedEdge<V>>
The ShortestPathMatrix class is used to store the result from an all-pairs shortest path algorithm. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |