|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
java.lang.Object
|
+--net.walend.digraph.AbstractHashCEDigraph
|
+--net.walend.digraph.HashCEDigraph
This class implements the CEDigraph interface using a Map and a Set. It's great for sparse graphs.
| Nested Class Summary |
| Nested classes inherited from class net.walend.digraph.AbstractHashCEDigraph |
AbstractHashCEDigraph.HashEdgeIterator, AbstractHashCEDigraph.NodeIterator, AbstractHashCEDigraph.NodePair |
| Field Summary |
| Fields inherited from class net.walend.digraph.AbstractHashCEDigraph |
|
| Fields inherited from interface net.walend.digraph.CEDigraph |
EMPTY |
| Constructor Summary | |
HashCEDigraph(CEDigraph digraph)
|
|
HashCEDigraph(GEDigraph digraph,
java.lang.Object edge)
|
|
HashCEDigraph(UEDigraph digraph)
|
|
| Method Summary | |
EdgeIterator |
edgeIterator()
|
java.util.Iterator |
nodeIterator()
Implementations should explicitly state how they interpret nodeIterator()'s remove method. |
| Methods inherited from class net.walend.digraph.AbstractHashCEDigraph |
addEdge, addNode, addNodes, clear, clearEdges, containsCEDigraph, containsEdge, containsEdge, containsNode, containsNodes, countInboundEdges, countOutboundEdges, edgeCount, edgeNodeIterator, getEdge, getEdges, getFromNodes, getInboundEdges, getNodes, getOutboundEdges, getPrincipleInterface, getToNodes, intersectWithCEDigraph, isEdgeFree, isEmpty, nodeCount, removeCEDigraph, removeEdge, removeNode, removeNodes, retainNodes, sameCEDigraphAs, sameStateAs, toString, unionCEDigraph |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
public HashCEDigraph(CEDigraph digraph)
public HashCEDigraph(UEDigraph digraph)
public HashCEDigraph(GEDigraph digraph,
java.lang.Object edge)
| Method Detail |
public EdgeIterator edgeIterator()
edgeIterator in interface CEDigraphedgeIterator in class AbstractHashCEDigraphpublic java.util.Iterator nodeIterator()
Digraph
nodeIterator in interface DigraphnodeIterator in class AbstractHashCEDigraph
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||