theprogrammablemind 7.5.0-beta.0 → 7.5.0-beta.1

package/package.json

@@ -61,6 +61,6 @@
     "json-stable-stringify": "^1.0.1",
     "node-fetch": "^2.6.1"
   },
-  "version": "7.5.0-beta.0",
+  "version": "7.5.0-beta.1",
   "license": "ISC"
 }

package/src/digraph.js

@@ -9,21 +9,38 @@ const toA = (edge) => {
 class Digraph {
   // edges maybe either [child, parent] or { child, parent }
   constructor (edges = []) {
-    this.edges = edges
+    // dont make a copy of edges. this is shared and that breaks stuff. TODO fix this
+    this._edges = edges
   }
 
-  /*
-  edges () {
-    return this.edges
+  addEdges(edges) {
+    for (let edge of edges) {
+      this.addEdge(edge)
+    }
+  }
+
+  addEdge(edge) {
+    edge = toA(edge)
+    this._edges.push(edge)
+  }
+
+  get edges() {
+    return this._edges
+  }
+
+/*
+  set edges(edges) {
+    this._edges = edges.map( toA )
   }
 */
+
   acdcs (s, from, to) {
     const todo = [s]
     const seen = new Set([s])
     const acdcs = new Set([])
     while (todo.length > 0) {
       const n = todo.pop()
-      this.edges.forEach((e) => {
+      this._edges.forEach((e) => {
         e = toA(e)
         if (e[from] === n) {
           acdcs.add(e[to])
@@ -84,12 +101,12 @@ class Digraph {
   }
 
   add (child, parent) {
-    this.edges.push([child, parent])
+    this._edges.push([child, parent])
   }
 
   addList (l) {
     for (let i = 1; i < l.length; ++i) {
-      this.edges.push([l[i - 1], l[i]])
+      this._edges.push([l[i - 1], l[i]])
     }
   }