Optimize hasEdge

Author: curran

index.js

@@ -137,15 +137,7 @@ function Graph(serialized) {
     }
     // Returns true if there is an edge from node u to node v.
     function hasEdge(u, v) {
-        var has = false;
-        if (edges[u]) {
-            adjacent(u).forEach(function (_v) {
-                if (_v === v) {
-                    has = true;
-                }
-            });
-        }
-        return has;
+        return adjacent(u).includes(v);
     }
     // Computes the indegree for the given node.
     // Not very efficient, costs O(E) where E = number of edges.

index.ts

@@ -146,15 +146,7 @@ function Graph(serialized?: Serialized) {
 
     // Returns true if there is an edge from node u to node v.
     function hasEdge(u: NodeId, v: NodeId) {
-        let has = false;
-        if (edges[u]) {
-            adjacent(u).forEach(function(_v) {
-                if(_v === v){
-                    has = true;
-                }
-            });
-        }
-        return has;
+        return adjacent(u).includes(v);
     }
 
     // Computes the indegree for the given node.