|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectcom.ibm.wala.util.graph.impl.DelegatingNumberedEdgeManager<T>
public class DelegatingNumberedEdgeManager<T extends INodeWithNumberedEdges>
An object that delegates edge management to the nodes, INodeWithNumberedEdges
| Constructor Summary | |
|---|---|
DelegatingNumberedEdgeManager(DelegatingNumberedNodeManager<T> nodeManager)
|
|
| Method Summary | |
|---|---|
void |
addEdge(T src,
T dst)
|
int |
getPredNodeCount(T N)
Return the number of immediate predecessor
nodes of this Node
in the Graph. |
IntSet |
getPredNodeNumbers(T node)
|
java.util.Iterator<T> |
getPredNodes(T N)
Return an Iterator over the immediate predecessor nodes of this Node
in the Graph. |
int |
getSuccNodeCount(T N)
Return the number of immediate successor
nodes of this Node
in the Graph |
IntSet |
getSuccNodeNumbers(T node)
|
java.util.Iterator<T> |
getSuccNodes(T N)
Return an Iterator over the immediate successor nodes of this Node in
the Graph |
boolean |
hasEdge(T src,
T dst)
|
void |
removeAllIncidentEdges(T node)
|
void |
removeEdge(T src,
T dst)
|
void |
removeIncomingEdges(T node)
|
void |
removeOutgoingEdges(T node)
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public DelegatingNumberedEdgeManager(DelegatingNumberedNodeManager<T> nodeManager)
| Method Detail |
|---|
public java.util.Iterator<T> getPredNodes(T N)
throws java.lang.IllegalArgumentException
EdgeManagernodes of this Node
in the Graph.
This method never returns null.
getPredNodes in interface EdgeManager<T extends INodeWithNumberedEdges>java.lang.IllegalArgumentExceptionpublic IntSet getPredNodeNumbers(T node)
getPredNodeNumbers in interface NumberedEdgeManager<T extends INodeWithNumberedEdges>
public int getPredNodeCount(T N)
throws java.lang.IllegalArgumentException
EdgeManagerimmediate predecessor
nodes of this Node
in the Graph.
getPredNodeCount in interface EdgeManager<T extends INodeWithNumberedEdges>java.lang.IllegalArgumentExceptionpublic java.util.Iterator<T> getSuccNodes(T N)
EdgeManagernodes of this Node in
the Graph
This method never returns null.
getSuccNodes in interface EdgeManager<T extends INodeWithNumberedEdges>public int getSuccNodeCount(T N)
EdgeManagerimmediate successor
nodes of this Node
in the Graph
getSuccNodeCount in interface EdgeManager<T extends INodeWithNumberedEdges>
public void addEdge(T src,
T dst)
addEdge in interface EdgeManager<T extends INodeWithNumberedEdges>
public void removeEdge(T src,
T dst)
removeEdge in interface EdgeManager<T extends INodeWithNumberedEdges>public void removeAllIncidentEdges(T node)
removeAllIncidentEdges in interface EdgeManager<T extends INodeWithNumberedEdges>public void removeIncomingEdges(T node)
removeIncomingEdges in interface EdgeManager<T extends INodeWithNumberedEdges>public void removeOutgoingEdges(T node)
removeOutgoingEdges in interface EdgeManager<T extends INodeWithNumberedEdges>
public boolean hasEdge(T src,
T dst)
hasEdge in interface EdgeManager<T extends INodeWithNumberedEdges>public IntSet getSuccNodeNumbers(T node)
getSuccNodeNumbers in interface NumberedEdgeManager<T extends INodeWithNumberedEdges>
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||