diff --git a/com.ibm.wala.core/src/com/ibm/wala/util/graph/EdgeManager.java b/com.ibm.wala.core/src/com/ibm/wala/util/graph/EdgeManager.java
index 5afb27e35..6aecb8e92 100644
--- a/com.ibm.wala.core/src/com/ibm/wala/util/graph/EdgeManager.java
+++ b/com.ibm.wala.core/src/com/ibm/wala/util/graph/EdgeManager.java
@@ -14,33 +14,35 @@ import java.util.Iterator;
 
 /**
  * An object which manages edges in a directed graph.
+ * 
+ * @param <T> the type of node in the graph
  */
 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>.
    * 
-   * @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>
    * 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