|
|||||||||
| 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 SubGraph<N,E>
An interface representing a subgraph that provides adjacency calculation to a node.
| Method Summary | |
|---|---|
void |
addNode(N value)
Adds the node into this subgraph. |
boolean |
isIndependentOf(N node)
Returns true if the node is a neighbor of any node in this SubGraph. |
| Method Detail |
|---|
boolean isIndependentOf(N node)
void addNode(N value)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||