|
|||||||||||
| 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.MutableHashCEDigraph
| Nested Class Summary |
| Nested classes inherited from class net.walend.digraph.AbstractHashCEDigraph |
AbstractHashCEDigraph.HashEdgeIterator, AbstractHashCEDigraph.NodeIterator, AbstractHashCEDigraph.NodePair |
| Field Summary | |
private static int |
DEFAULTSIZE
|
| Fields inherited from class net.walend.digraph.AbstractHashCEDigraph |
|
| Fields inherited from interface net.walend.digraph.CEDigraph |
EMPTY |
| Constructor Summary | |
MutableHashCEDigraph()
|
|
MutableHashCEDigraph(CEDigraph digraph)
|
|
MutableHashCEDigraph(GEDigraph digraph,
java.lang.Object edge)
|
|
MutableHashCEDigraph(int nodeCapacity,
int edgeCapacity)
|
|
MutableHashCEDigraph(UEDigraph digraph)
|
|
| Method Summary | |
java.lang.Object |
addEdge(java.lang.Object fromNode,
java.lang.Object toNode,
java.lang.Object edge)
Return null if no existing edge is displaced by edge. |
boolean |
addNode(java.lang.Object node)
Return true if the node is added successfully, false if the digraph does not change. |
boolean |
addNodes(java.util.Set nodes)
Return true if adding the nodes changes the digraph. |
void |
clear()
Remove all nodes and edges from the CEDigraph |
void |
clearEdges()
Remove all the edges from the CEDigraph. |
Bag |
removeCEDigraph(CEDigraph digraph)
Return a Bag of edges orphaned when digraph is removed |
java.lang.Object |
removeEdge(java.lang.Object fromNode,
java.lang.Object toNode)
Return the edge that connected fromNode to toNode, or null if no edge existed. |
Bag |
removeNode(java.lang.Object node)
Return the Bag of orphaned edges that are removed with node |
Bag |
removeNodes(java.util.Set nodes)
Return the Bag of edges orphaned edges when these nodes are removed. |
Bag |
retainNodes(java.util.Set nodes)
Return a Bag of orphaned edges when the nodes are removed. |
| Methods inherited from class net.walend.digraph.AbstractHashCEDigraph |
containsCEDigraph, containsEdge, containsEdge, containsNode, containsNodes, countInboundEdges, countOutboundEdges, edgeCount, edgeIterator, edgeNodeIterator, getEdge, getEdges, getFromNodes, getInboundEdges, getNodes, getOutboundEdges, getPrincipleInterface, getToNodes, intersectWithCEDigraph, isEdgeFree, isEmpty, nodeCount, nodeIterator, sameCEDigraphAs, sameStateAs, toString, unionCEDigraph |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface net.walend.digraph.CEDigraph |
containsCEDigraph, containsEdge, edgeIterator, getEdge, getEdges, getInboundEdges, getOutboundEdges, intersectWithCEDigraph, sameCEDigraphAs, unionCEDigraph |
| Methods inherited from interface net.walend.digraph.Digraph |
containsEdge, containsNode, containsNodes, countInboundEdges, countOutboundEdges, edgeCount, edgeNodeIterator, getFromNodes, getNodes, getToNodes, isEdgeFree, isEmpty, nodeCount, nodeIterator |
| Methods inherited from interface net.walend.collection.HasState |
getPrincipleInterface, sameStateAs |
| Field Detail |
private static final int DEFAULTSIZE
| Constructor Detail |
public MutableHashCEDigraph()
public MutableHashCEDigraph(int nodeCapacity,
int edgeCapacity)
public MutableHashCEDigraph(CEDigraph digraph)
public MutableHashCEDigraph(UEDigraph digraph)
public MutableHashCEDigraph(GEDigraph digraph,
java.lang.Object edge)
| Method Detail |
public boolean addNode(java.lang.Object node)
MutableCEDigraph
addNode in interface MutableCEDigraphaddNode in class AbstractHashCEDigraph
public java.lang.Object addEdge(java.lang.Object fromNode,
java.lang.Object toNode,
java.lang.Object edge)
throws NodeMissingException
MutableCEDigraph
addEdge in interface MutableCEDigraphaddEdge in class AbstractHashCEDigraphNodeMissingException - if either node is not in the digraph.
public Bag removeNode(java.lang.Object node)
throws NodeMissingException
MutableCEDigraph
removeNode in interface MutableCEDigraphremoveNode in class AbstractHashCEDigraphNodeMissingException - if the node is not in the digraph
public java.lang.Object removeEdge(java.lang.Object fromNode,
java.lang.Object toNode)
throws NodeMissingException
MutableCEDigraph
removeEdge in interface MutableCEDigraphremoveEdge in class AbstractHashCEDigraphNodeMissingException - if either node is not in the digraphpublic boolean addNodes(java.util.Set nodes)
MutableCEDigraph
addNodes in interface MutableCEDigraphaddNodes in class AbstractHashCEDigraphpublic Bag removeNodes(java.util.Set nodes)
MutableCEDigraph
removeNodes in interface MutableCEDigraphremoveNodes in class AbstractHashCEDigraphpublic Bag removeCEDigraph(CEDigraph digraph)
MutableCEDigraph
removeCEDigraph in interface MutableCEDigraphremoveCEDigraph in class AbstractHashCEDigraphpublic Bag retainNodes(java.util.Set nodes)
MutableCEDigraph
retainNodes in interface MutableCEDigraphretainNodes in class AbstractHashCEDigraphpublic void clear()
MutableCEDigraph
clear in interface MutableCEDigraphclear in class AbstractHashCEDigraphpublic void clearEdges()
MutableCEDigraph
clearEdges in interface MutableCEDigraphclearEdges in class AbstractHashCEDigraph
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||