|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
N
- Value type that the graph node stores.E
- Value type that the graph edge stores.public interface AdjacencyGraph<N,E>
A minimal graph interface. Provided is add nodes to the graph, adjacency calculation between a SubGraph and a GraphNode, and adding node annotations.
For a more extensive interface, see Graph
.
Graph
Method Summary | |
---|---|
void |
clearNodeAnnotations()
Makes each node's annotation null. |
GraphNode<N,E> |
getNode(N value)
Gets a node from the graph given a value. |
Collection<GraphNode<N,E>> |
getNodes()
Gets an immutable list of all nodes. |
int |
getWeight(N value)
Returns a weight for the given value to be used in ordering nodes, e.g. |
SubGraph<N,E> |
newSubGraph()
Returns an empty SubGraph for this Graph. |
Method Detail |
---|
Collection<GraphNode<N,E>> getNodes()
GraphNode<N,E> getNode(N value)
Object.equals
.
value
- The node's value.
SubGraph<N,E> newSubGraph()
void clearNodeAnnotations()
int getWeight(N value)
GraphColoring
.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |