graph-typed 2.4.3 → 2.4.4

package/dist/esm-legacy/index.mjs

@@ -777,11 +777,6 @@ var _Heap = class _Heap extends IterableElementBase {
     }
     return out;
   }
-  /**
-  * Get the comparator used to order elements.
-  * @remarks Time O(1), Space O(1)
-  * @returns Comparator function.
-  */
   /**
    * Get the comparator used to order elements.
    * @remarks Time O(1), Space O(1)
@@ -830,8 +825,7 @@ var _Heap = class _Heap extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
-    return next;
+    return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
   }
   /**
    * (Protected) Create a like-kind instance seeded by elements.
@@ -2169,8 +2163,8 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     const Ctor = this.constructor;
     const instance = new Ctor();
     const graph = _options == null ? void 0 : _options.graph;
-    if (graph) instance._options = { ...instance._options, ...graph };
-    else instance._options = { ...instance._options, ...this._options };
+    if (graph) instance["_options"] = { ...instance["_options"], ...graph };
+    else instance["_options"] = { ...instance["_options"], ...this._options };
     return instance;
   }
   /**
@@ -2203,12 +2197,10 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
       const [va, vb] = ends;
       const ka = va.key;
       const kb = vb.key;
-      const hasA = g.hasVertex ? g.hasVertex(ka) : false;
-      const hasB = g.hasVertex ? g.hasVertex(kb) : false;
+      const hasA = typeof g.hasVertex === "function" ? g.hasVertex(ka) : false;
+      const hasB = typeof g.hasVertex === "function" ? g.hasVertex(kb) : false;
       if (hasA && hasB) {
-        const w = e.weight;
-        const val = e.value;
-        const newEdge = g.createEdge(ka, kb, w, val);
+        const newEdge = g.createEdge(ka, kb, e.weight, e.value);
         g._addEdge(newEdge);
       }
     }