DASCA
/
WALA
2
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

comments 

git-svn-id: https://wala.svn.sourceforge.net/svnroot/wala/trunk@3501 f5eafffb-2e1d-0410-98e4-8ec43c5233c4
This commit is contained in:
sjfink 2009-04-21 20:03:27 +00:00
parent 4a48748f1c
commit 9636fe9575
1 changed files with 11 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
com.ibm.wala.core/src/com/ibm/wala/util/graph/EdgeManager.java
View File

@ -14,33 +14,35 @@ import java.util.Iterator;
/** /**
* An object which manages edges in a directed graph. * An object which manages edges in a directed graph.
*
* @param <T> the type of node in the graph
*/ */
public interface EdgeManager<T> { public interface EdgeManager<T> {
/** /**
* Return an Iterator over the immediate predecessor nodesof this Node in the Graph. * Return an {@link Iterator} over the immediate predecessor nodes of n
* *
* This method never returns <code>null</code>. * This method never returns <code>null</code>.
* *
* @return an Iterator over the immediate predecessor nodes of this Node. * @return an {@link Iterator} over the immediate predecessor nodes of this Node.
*/ */
public Iterator<? extends T> getPredNodes(T N); public Iterator<? extends T> getPredNodes(T n);
/** /**
* Return the number of {@link #getPredNodes immediate predecessor} nodes of this Node in the Graph. * Return the number of {@link #getPredNodes immediate predecessor} nodes of n
* *
* @return the number of immediate predecessor Nodes of this Node in the Graph. * @return the number of immediate predecessors of n.
*/ */
public int getPredNodeCount(T N); public int getPredNodeCount(T n);
/** /**
* Return an Iterator over the immediate successor nodes of this Node in the Graph * Return an Iterator over the immediate successor nodes of n
* <p> * <p>
* This method never returns <code>null</code>. * This method never returns <code>null</code>.
* *
* @return an Iterator over the immediate successor Nodes of this Node. * @return an Iterator over the immediate successor nodes of n
*/ */
public Iterator<? extends T> getSuccNodes(T N); public Iterator<? extends T> getSuccNodes(T n);
/** /**
* Return the number of {@link #getSuccNodes immediate successor} nodes of this Node in the Graph * Return the number of {@link #getSuccNodes immediate successor} nodes of this Node in the Graph