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@3500 f5eafffb-2e1d-0410-98e4-8ec43c5233c4
This commit is contained in:
sjfink 2009-04-21 20:00:40 +00:00
parent f86f1a1640
commit 4a48748f1c
2 changed files with 9 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
com.ibm.wala.core/src/com/ibm/wala/util/graph/Graph.java
View File

@ -16,6 +16,8 @@ package com.ibm.wala.util.graph;
* We choose to define a {@link Graph} as a composition of a {@link NodeManager} and an {@link EdgeManager}, which
* track nodes and edges, respectively. This way, in many cases we can compose separate {@link NodeManager} and
* {@link EdgeManager} implementations to create {@link Graph} implementations, using delegation.
*
* @param <T> the type of nodes in this graph.
*/
public interface Graph<T> extends NodeManager<T>, EdgeManager<T> {
/**

8
com.ibm.wala.core/src/com/ibm/wala/util/graph/NodeManager.java
View File

@ -10,12 +10,18 @@
*******************************************************************************/
package com.ibm.wala.util.graph;
import java.util.Collection;
import java.util.Iterator;
/**
* An object which tracks graph nodes.
*
* This is effectively a stripped-down collection interface. We choose to avoid using the full {@link Collection} interface, so that
* it takes less code to implement a new {@link NodeManager}.
*
* @param <T> the type of nodes this {@link NodeManager} tracks.
*/
public interface NodeManager<T> extends Iterable<T>{
public interface NodeManager<T> extends Iterable<T> {
/**
* @return an {@link Iterator} of the nodes in this graph