2 files changed, 3 insertions, 11 deletions
diff --git a/src/main/java/com/google/devtools/build/lib/graph/Digraph.java b/src/main/java/com/google/devtools/build/lib/graph/Digraph.java
index 011f6baec7..8300bef095 100644
--- a/src/main/java/com/google/devtools/build/lib/graph/Digraph.java
+++ b/src/main/java/com/google/devtools/build/lib/graph/Digraph.java
@@ -79,11 +79,6 @@ public final class Digraph<T> implements Cloneable {
   private final HashMap<T, Node<T>> nodes = Maps.newHashMap();
 
   /**
-   * A source of unique, deterministic hashCodes for {@link Node} instances.
-   */
-  private int nextHashCode = 0;
-
-  /**
    * Construct an empty Digraph.
    */
   public Digraph() {}
@@ -377,7 +372,7 @@ public final class Digraph<T> implements Cloneable {
     if (label == null) {
       throw new NullPointerException();
     }
-    return nodes.computeIfAbsent(label, k -> new Node<>(k, nextHashCode++));
+    return nodes.computeIfAbsent(label, k -> new Node<>(k));
   }
 
   /******************************************************************
diff --git a/src/main/java/com/google/devtools/build/lib/graph/Node.java b/src/main/java/com/google/devtools/build/lib/graph/Node.java
index 584b35b60d..c15fbda10e 100644
--- a/src/main/java/com/google/devtools/build/lib/graph/Node.java
+++ b/src/main/java/com/google/devtools/build/lib/graph/Node.java
@@ -63,15 +63,12 @@ public final class Node<T> {
    */
   private Collection<Node<T>> preds = null;
 
-  private final int hashCode;
-
   /**
    * Only Digraph.createNode() can call this!
    */
-  Node(T label, int hashCode) {
+  Node(T label) {
     if (label == null) { throw new NullPointerException("label"); }
     this.label = label;
-    this.hashCode = hashCode;
   }
 
   /**
@@ -273,7 +270,7 @@ public final class Node<T> {
 
   @Override
   public int hashCode() {
-    return hashCode; // Fast, deterministic.
+    return super.hashCode();
   }
 
   @Override