|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--net.walend.digraph.AbstractHashUEDigraph | +--net.walend.digraph.HashUEDigraph
This class implements the UEDigraph interface using three HashMaps. It's great for sparse graphs.
Nested Class Summary |
Nested classes inherited from class net.walend.digraph.AbstractHashUEDigraph |
AbstractHashUEDigraph.HashEdgeIterator, AbstractHashUEDigraph.NodeIterator, AbstractHashUEDigraph.NodePair |
Field Summary |
Fields inherited from class net.walend.digraph.AbstractHashUEDigraph |
|
Fields inherited from interface net.walend.digraph.UEDigraph |
EMPTY |
Constructor Summary | |
HashUEDigraph(UEDigraph digraph)
|
Method Summary | |
EdgeIterator |
edgeIterator()
Since HashCEDigraph is immutable, edgeIterator()'s remove() method throws an UnsupportedOperationException. |
java.util.Iterator |
nodeIterator()
Implementations should explicitly state how they interpret nodeIterator()'s remove method. |
Methods inherited from class net.walend.digraph.AbstractHashUEDigraph |
addEdge, addNode, addNodes, clear, clearEdges, containsEdge, containsEdge, containsEdge, containsEdges, containsNode, containsNodes, containsUEDigraph, countInboundEdges, countOutboundEdges, edgeCount, edgeNodeIterator, getEdge, getEdges, getFromNode, getFromNodes, getInboundEdges, getNodes, getOutboundEdges, getPrincipleInterface, getToNode, getToNodes, intersectWithUEDigraph, isEdgeFree, isEmpty, nodeCount, removeEdge, removeEdge, removeEdges, removeNode, removeNodes, removeUEDigraph, retainEdges, retainNodes, sameStateAs, sameUEDigraphAs, toString, unionUEDigraph |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
public HashUEDigraph(UEDigraph digraph)
Method Detail |
public EdgeIterator edgeIterator()
edgeIterator
in interface UEDigraph
edgeIterator
in class AbstractHashUEDigraph
public java.util.Iterator nodeIterator()
Digraph
nodeIterator
in interface Digraph
nodeIterator
in class AbstractHashUEDigraph
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |