|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES All Classes | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Graph
Nested Class Summary | |
---|---|
static interface |
Graph.Algorithm
|
static interface |
Graph.Transform
|
Method Summary | |
---|---|
Edge |
addEdge(Node source,
Node sink,
java.lang.Object keyObject)
|
Node |
addNode(java.lang.Object keyObject)
|
java.util.Collection |
allEdges()
|
java.util.Collection |
allNodes()
|
boolean |
clear()
|
Edge.Iterator |
edgeIterator()
|
Edge |
getEdge(java.lang.Object keyObject)
|
Factory |
getFactory()
|
Node |
getNode(java.lang.Object keyObject)
|
boolean |
hasEdge(Edge edge)
|
boolean |
hasNode(Node node)
|
Node.Iterator |
nodeIterator()
|
int |
numEdges()
|
int |
numNodes()
|
Path.Iterator |
pathIterator(Node from,
Node to)
|
Method Detail |
---|
Factory getFactory()
Node addNode(java.lang.Object keyObject)
Edge addEdge(Node source, Node sink, java.lang.Object keyObject)
java.util.Collection allNodes()
java.util.Collection allEdges()
Node getNode(java.lang.Object keyObject)
Edge getEdge(java.lang.Object keyObject)
boolean hasNode(Node node)
boolean hasEdge(Edge edge)
int numNodes()
int numEdges()
Node.Iterator nodeIterator()
Edge.Iterator edgeIterator()
Path.Iterator pathIterator(Node from, Node to)
boolean clear()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES All Classes | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |