|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES All Classes | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--net.walend.digraph.AbstractHashGEDigraph | +--net.walend.digraph.HashGEDigraph
This class implements the GEDigraph interface using two HashMaps. It's great for sparse graphs.
Nested Class Summary |
Nested classes inherited from class net.walend.digraph.AbstractHashGEDigraph |
AbstractHashGEDigraph.HashEdgeIterator, AbstractHashGEDigraph.IteratorWrapper, AbstractHashGEDigraph.NodePair |
Field Summary |
Fields inherited from class net.walend.digraph.AbstractHashGEDigraph |
|
Fields inherited from interface net.walend.digraph.GEDigraph |
EMPTY |
Constructor Summary | |
HashGEDigraph(GEDigraph digraph)
|
Methods inherited from class net.walend.digraph.AbstractHashGEDigraph |
addEdge, addNode, addNodes, clear, clearEdges, containsEdge, containsGEDigraph, containsNode, containsNodes, countInboundEdges, countOutboundEdges, edgeCount, edgeNodeIterator, getFromNodes, getNodes, getPrincipleInterface, getToNodes, intersectWithGEDigraph, isEdgeFree, isEmpty, nodeCount, nodeIterator, removeEdge, removeGEDigraph, removeNode, removeNodes, retainNodes, sameGEDigraphAs, sameStateAs, toString, unionGEDigraph |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
public HashGEDigraph(GEDigraph digraph)
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES All Classes | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |