|
Class Summary |
| ArrayNodeMap<Val> |
A node map which uses a simple array to store the values. |
| ArrayNodeNumbering |
A node numbering implementation which uses an ordinary Java array to
store the node numbers. |
| ListAsNodeQueue |
A node queue which is based on a java.util.List |
| ListAsPath |
Implement a Path using a java.util.List |
| MapAsEdgeMap<Val> |
A edge map which is based on a standard java.util.Map |
| MapAsNodeMap<Val> |
A node map which is based on a standard java.util.Map |
| MapAsNodeNumbering |
|
| NodeMapAdvisor |
Advisor which returns the most suitable NodeMap for a graph. |
| NodeNumberingAdvisor |
Advisor which returns the most suitable NodeNumbering for a graph. |
| NodeNumberingAsNodeSet |
A NodeSet which is implemented using a NodeNumbering. |
| NodeSetAdvisor |
An advisor which returns the most suitable NodeSet for a graph |
| SetAsNodeSet |
A wrapper which turns a java.lang.util.Set into a NodeSet. |
| StackAsNodeStack |
Uses a java.util.Stack to implement a NodeStack. |
