@readme/markdown 9.2.2 → 9.3.1

package/dist/995.node.js

@@ -48,8 +48,6 @@ function uniqueId(prefix) {
 
 /* harmony default export */ const lodash_es_uniqueId = (uniqueId);
 
-// EXTERNAL MODULE: ./node_modules/lodash-es/has.js + 1 modules
-var has = __webpack_require__(796);
 // EXTERNAL MODULE: ./node_modules/lodash-es/constant.js
 var constant = __webpack_require__(3659);
 // EXTERNAL MODULE: ./node_modules/lodash-es/flatten.js
@@ -256,7 +254,7 @@ function greedyFAS(g, weightFn) {
   return flatten/* default */.A(
     map/* default */.A(results, function (e) {
       return g.outEdges(e.v, e.w);
-    })
+    }),
   );
 }
 
@@ -386,13 +384,13 @@ function dfsFAS(g) {
   var visited = {};
 
   function dfs(v) {
-    if (has/* default */.A(visited, v)) {
+    if (Object.prototype.hasOwnProperty.call(visited, v)) {
       return;
     }
     visited[v] = true;
     stack[v] = true;
     forEach/* default */.A(g.outEdges(v), function (e) {
-      if (has/* default */.A(stack, e.w)) {
+      if (Object.prototype.hasOwnProperty.call(stack, e.w)) {
         fas.push(e);
       } else {
         dfs(e.w);
@@ -605,6 +603,8 @@ function mapValues(object, iteratee) {
 var isUndefined = __webpack_require__(9523);
 // EXTERNAL MODULE: ./node_modules/lodash-es/min.js
 var lodash_es_min = __webpack_require__(963);
+// EXTERNAL MODULE: ./node_modules/lodash-es/has.js + 1 modules
+var has = __webpack_require__(796);
 // EXTERNAL MODULE: ./node_modules/lodash-es/_root.js
 var _root = __webpack_require__(4606);
 ;// ./node_modules/lodash-es/now.js
@@ -772,7 +772,7 @@ function normalizeRanks(g) {
   var min = lodash_es_min/* default */.A(
     map/* default */.A(g.nodes(), function (v) {
       return g.node(v).rank;
-    })
+    }),
   );
   forEach/* default */.A(g.nodes(), function (v) {
     var node = g.node(v);
@@ -787,7 +787,7 @@ function removeEmptyRanks(g) {
   var offset = lodash_es_min/* default */.A(
     map/* default */.A(g.nodes(), function (v) {
       return g.node(v).rank;
-    })
+    }),
   );
 
   var layers = [];
@@ -831,7 +831,7 @@ function util_maxRank(g) {
       if (!isUndefined/* default */.A(rank)) {
         return rank;
       }
-    })
+    }),
   );
 }
 
@@ -883,7 +883,7 @@ function addBorderSegments(g) {
       forEach/* default */.A(children, dfs);
     }
 
-    if (has/* default */.A(node, 'minRank')) {
+    if (Object.prototype.hasOwnProperty.call(node, 'minRank')) {
       node.borderLeft = [];
       node.borderRight = [];
       for (var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank) {
@@ -954,7 +954,7 @@ function reverseY(g) {
   forEach/* default */.A(g.edges(), function (e) {
     var edge = g.edge(e);
     forEach/* default */.A(edge.points, reverseYOne);
-    if (has/* default */.A(edge, 'y')) {
+    if (Object.prototype.hasOwnProperty.call(edge, 'y')) {
       reverseYOne(edge);
     }
   });
@@ -972,7 +972,7 @@ function swapXY(g) {
   forEach/* default */.A(g.edges(), function (e) {
     var edge = g.edge(e);
     forEach/* default */.A(edge.points, swapXYOne);
-    if (has/* default */.A(edge, 'x')) {
+    if (Object.prototype.hasOwnProperty.call(edge, 'x')) {
       swapXYOne(edge);
     }
   });
@@ -985,6 +985,11 @@ function swapXYOne(attrs) {
 }
 
 ;// ./node_modules/dagre-d3-es/src/dagre/normalize.js
+/**
+ * TypeScript type imports:
+ *
+ * @import { Graph } from '../graphlib/graph.js';
+ */
 
 
 
@@ -1013,6 +1018,9 @@ function normalize_run(g) {
   });
 }
 
+/**
+ * @param {Graph} g
+ */
 function normalizeEdge(g, e) {
   var v = e.v;
   var vRank = g.node(v).rank;
@@ -1026,7 +1034,20 @@ function normalizeEdge(g, e) {
 
   g.removeEdge(e);
 
-  var dummy, attrs, i;
+  /**
+   * @typedef {Object} Attrs
+   * @property {number} width
+   * @property {number} height
+   * @property {ReturnType<Graph["node"]>} edgeLabel
+   * @property {any} edgeObj
+   * @property {ReturnType<Graph["node"]>["rank"]} rank
+   * @property {string} [dummy]
+   * @property {ReturnType<Graph["node"]>["labelpos"]} [labelpos]
+   */
+
+  /** @type {Attrs | undefined} */
+  var attrs = undefined;
+  var dummy, i;
   for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
     edgeLabel.points = [];
     attrs = {
@@ -1040,9 +1061,7 @@ function normalizeEdge(g, e) {
     if (vRank === labelRank) {
       attrs.width = edgeLabel.width;
       attrs.height = edgeLabel.height;
-      // @ts-expect-error
       attrs.dummy = 'edge-label';
-      // @ts-expect-error
       attrs.labelpos = edgeLabel.labelpos;
     }
     g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);
@@ -1146,7 +1165,7 @@ function longestPath(g) {
 
   function dfs(v) {
     var label = g.node(v);
-    if (has/* default */.A(visited, v)) {
+    if (Object.prototype.hasOwnProperty.call(visited, v)) {
       return label.rank;
     }
     visited[v] = true;
@@ -1154,7 +1173,7 @@ function longestPath(g) {
     var rank = lodash_es_min/* default */.A(
       map/* default */.A(g.outEdges(v), function (e) {
         return dfs(e.w) - g.edge(e).minlen;
-      })
+      }),
     );
 
     if (
@@ -1289,7 +1308,7 @@ function dijkstra_dijkstra(g, source, weightFn, edgeFn) {
     edgeFn ||
       function (v) {
         return g.outEdges(v);
-      }
+      },
   );
 }
 
@@ -1310,7 +1329,7 @@ function runDijkstra(g, source, weightFn, edgeFn) {
           'Bad edge: ' +
           edge +
           ' Weight: ' +
-          weight
+          weight,
       );
     }
 
@@ -1352,7 +1371,7 @@ function dijkstraAll(g, weightFunc, edgeFunc) {
     function (acc, v) {
       acc[v] = dijkstra(g, v, weightFunc, edgeFunc);
     },
-    {}
+    {},
   );
 }
 
@@ -1370,7 +1389,7 @@ function floydWarshall(g, weightFn, edgeFn) {
     edgeFn ||
       function (v) {
         return g.outEdges(v);
-      }
+      },
   );
 }
 
@@ -1592,11 +1611,11 @@ function topsort_topsort(g) {
   var results = [];
 
   function visit(node) {
-    if (has/* default */.A(stack, node)) {
+    if (Object.prototype.hasOwnProperty.call(stack, node)) {
       throw new topsort_CycleException();
     }
 
-    if (!has/* default */.A(visited, node)) {
+    if (!Object.prototype.hasOwnProperty.call(visited, node)) {
       stack[node] = true;
       visited[node] = true;
       forEach/* default */.A(g.predecessors(node), visit);
@@ -1669,7 +1688,7 @@ function dfs(g, vs, order) {
 }
 
 function doDfs(g, v, postorder, visited, navigation, acc) {
-  if (!has/* default */.A(visited, v)) {
+  if (!Object.prototype.hasOwnProperty.call(visited, v)) {
     visited[v] = true;
 
     if (!postorder) {
@@ -1744,7 +1763,7 @@ function prim(g, weightFunc) {
   var init = false;
   while (pq.size() > 0) {
     v = pq.removeMin();
-    if (_.has(parents, v)) {
+    if (Object.prototype.hasOwnProperty.call(parents, v)) {
       result.setEdge(v, parents[v]);
     } else if (init) {
       throw new Error('Input graph is not connected: ' + g);
@@ -1907,7 +1926,7 @@ function dfsAssignLowLim(tree, visited, nextLim, v, parent) {
 
   visited[v] = true;
   forEach/* default */.A(tree.neighbors(v), function (w) {
-    if (!has/* default */.A(visited, w)) {
+    if (!Object.prototype.hasOwnProperty.call(visited, w)) {
       nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);
     }
   });
@@ -2192,7 +2211,7 @@ function sumWeights(g) {
     function (acc, e) {
       return acc + g.edge(e).weight;
     },
-    0
+    0,
   );
 }
 
@@ -2356,7 +2375,7 @@ function buildLayerGraph(g, rank, relationship) {
         result.setEdge(u, v, { weight: g.edge(e).weight + weight });
       });
 
-      if (has/* default */.A(node, 'minRank')) {
+      if (Object.prototype.hasOwnProperty.call(node, 'minRank')) {
         result.setNode(v, {
           borderLeft: node.borderLeft[rank],
           borderRight: node.borderRight[rank],
@@ -2691,7 +2710,7 @@ function twoLayerCrossCount(g, northLayer, southLayer) {
     southLayer,
     map/* default */.A(southLayer, function (v, i) {
       return i;
-    })
+    }),
   );
   var southEntries = flatten/* default */.A(
     map/* default */.A(northLayer, function (v) {
@@ -2699,9 +2718,9 @@ function twoLayerCrossCount(g, northLayer, southLayer) {
         map/* default */.A(g.outEdges(v), function (e) {
           return { pos: southPos[e.w], weight: g.edge(e).weight };
         }),
-        'pos'
+        'pos',
       );
-    })
+    }),
   );
 
   // Build the accumulator tree
@@ -2732,7 +2751,7 @@ function twoLayerCrossCount(g, northLayer, southLayer) {
         tree[index] += entry.weight;
       }
       cc += entry.weight * weightSum;
-    })
+    }),
   );
 
   return cc;
@@ -2741,8 +2760,6 @@ function twoLayerCrossCount(g, northLayer, southLayer) {
 ;// ./node_modules/dagre-d3-es/src/dagre/order/init-order.js
 
 
-
-
 /*
  * Assigns an initial order value for each node by performing a DFS search
  * starting from nodes in the first rank. Nodes are assigned an order in their
@@ -2762,7 +2779,7 @@ function initOrder(g) {
   var maxRank = lodash_es_max(
     map/* default */.A(simpleNodes, function (v) {
       return g.node(v).rank;
-    })
+    }),
   );
   var layers = map/* default */.A(lodash_es_range(maxRank + 1), function () {
     return [];
@@ -2805,7 +2822,7 @@ function barycenter(g, movable) {
             weight: acc.weight + edge.weight,
           };
         },
-        { sum: 0, weight: 0 }
+        { sum: 0, weight: 0 },
       );
 
       return {
@@ -2922,7 +2939,7 @@ function doResolveConflicts(sourceSet) {
     }),
     function (entry) {
       return lodash_es_pick(entry, ['vs', 'i', 'barycenter', 'weight']);
-    }
+    },
   );
 }
 
@@ -2955,7 +2972,7 @@ function mergeEntries(target, source) {
 
 function sort(entries, biasRight) {
   var parts = partition(entries, function (entry) {
-    return has/* default */.A(entry, 'barycenter');
+    return Object.prototype.hasOwnProperty.call(entry, 'barycenter');
   });
   var sortable = parts.lhs,
     unsortable = lodash_es_sortBy(parts.rhs, function (entry) {
@@ -3034,7 +3051,7 @@ function sortSubgraph(g, v, cg, biasRight) {
     if (g.children(entry.v).length) {
       var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
       subgraphs[entry.v] = subgraphResult;
-      if (has/* default */.A(subgraphResult, 'barycenter')) {
+      if (Object.prototype.hasOwnProperty.call(subgraphResult, 'barycenter')) {
         mergeBarycenters(entry, subgraphResult);
       }
     }
@@ -3050,7 +3067,7 @@ function sortSubgraph(g, v, cg, biasRight) {
     if (g.predecessors(bl).length) {
       var blPred = g.node(g.predecessors(bl)[0]),
         brPred = g.node(g.predecessors(br)[0]);
-      if (!has/* default */.A(result, 'barycenter')) {
+      if (!Object.prototype.hasOwnProperty.call(result, 'barycenter')) {
         result.barycenter = 0;
         result.weight = 0;
       }
@@ -3071,7 +3088,7 @@ function expandSubgraphs(entries, subgraphs) {
           return subgraphs[v].vs;
         }
         return v;
-      })
+      }),
     );
   });
 }
@@ -3481,7 +3498,7 @@ function hasConflict(conflicts, v, w) {
     v = w;
     w = tmp;
   }
-  return has/* default */.A(conflicts[v], w);
+  return !!conflicts[v] && Object.prototype.hasOwnProperty.call(conflicts[v], w);
 }
 
 /*
@@ -3712,7 +3729,7 @@ function sep(nodeSep, edgeSep, reverseSep) {
     var delta;
 
     sum += vLabel.width / 2;
-    if (has/* default */.A(vLabel, 'labelpos')) {
+    if (Object.prototype.hasOwnProperty.call(vLabel, 'labelpos')) {
       switch (vLabel.labelpos.toLowerCase()) {
         case 'l':
           delta = -vLabel.width / 2;
@@ -3731,7 +3748,7 @@ function sep(nodeSep, edgeSep, reverseSep) {
     sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;
 
     sum += wLabel.width / 2;
-    if (has/* default */.A(wLabel, 'labelpos')) {
+    if (Object.prototype.hasOwnProperty.call(wLabel, 'labelpos')) {
       switch (wLabel.labelpos.toLowerCase()) {
         case 'l':
           delta = wLabel.width / 2;
@@ -3778,7 +3795,7 @@ function positionY(g) {
     var maxHeight = lodash_es_max(
       map/* default */.A(layer, function (v) {
         return g.node(v).height;
-      })
+      }),
     );
     forEach/* default */.A(layer, function (v) {
       g.node(v).y = prevY + maxHeight / 2;
@@ -3805,101 +3822,41 @@ function positionY(g) {
 
 function layout(g, opts) {
   var time = opts && opts.debugTiming ? util_time : notime;
-  time('layout', function () {
-    var layoutGraph = time('  buildLayoutGraph', function () {
-      return buildLayoutGraph(g);
-    });
-    time('  runLayout', function () {
-      runLayout(layoutGraph, time);
-    });
-    time('  updateInputGraph', function () {
-      updateInputGraph(g, layoutGraph);
-    });
+  time('layout', () => {
+    var layoutGraph = time('  buildLayoutGraph', () => buildLayoutGraph(g));
+    time('  runLayout', () => runLayout(layoutGraph, time));
+    time('  updateInputGraph', () => updateInputGraph(g, layoutGraph));
   });
 }
 
 function runLayout(g, time) {
-  time('    makeSpaceForEdgeLabels', function () {
-    makeSpaceForEdgeLabels(g);
-  });
-  time('    removeSelfEdges', function () {
-    removeSelfEdges(g);
-  });
-  time('    acyclic', function () {
-    run(g);
-  });
-  time('    nestingGraph.run', function () {
-    nesting_graph_run(g);
-  });
-  time('    rank', function () {
-    rank(asNonCompoundGraph(g));
-  });
-  time('    injectEdgeLabelProxies', function () {
-    injectEdgeLabelProxies(g);
-  });
-  time('    removeEmptyRanks', function () {
-    removeEmptyRanks(g);
-  });
-  time('    nestingGraph.cleanup', function () {
-    cleanup(g);
-  });
-  time('    normalizeRanks', function () {
-    normalizeRanks(g);
-  });
-  time('    assignRankMinMax', function () {
-    assignRankMinMax(g);
-  });
-  time('    removeEdgeLabelProxies', function () {
-    removeEdgeLabelProxies(g);
-  });
-  time('    normalize.run', function () {
-    normalize_run(g);
-  });
-  time('    parentDummyChains', function () {
-    parentDummyChains(g);
-  });
-  time('    addBorderSegments', function () {
-    addBorderSegments(g);
-  });
-  time('    order', function () {
-    order(g);
-  });
-  time('    insertSelfEdges', function () {
-    insertSelfEdges(g);
-  });
-  time('    adjustCoordinateSystem', function () {
-    adjust(g);
-  });
-  time('    position', function () {
-    position(g);
-  });
-  time('    positionSelfEdges', function () {
-    positionSelfEdges(g);
-  });
-  time('    removeBorderNodes', function () {
-    removeBorderNodes(g);
-  });
-  time('    normalize.undo', function () {
-    normalize_undo(g);
-  });
-  time('    fixupEdgeLabelCoords', function () {
-    fixupEdgeLabelCoords(g);
-  });
-  time('    undoCoordinateSystem', function () {
-    coordinate_system_undo(g);
-  });
-  time('    translateGraph', function () {
-    translateGraph(g);
-  });
-  time('    assignNodeIntersects', function () {
-    assignNodeIntersects(g);
-  });
-  time('    reversePoints', function () {
-    reversePointsForReversedEdges(g);
-  });
-  time('    acyclic.undo', function () {
-    undo(g);
-  });
+  time('    makeSpaceForEdgeLabels', () => makeSpaceForEdgeLabels(g));
+  time('    removeSelfEdges', () => removeSelfEdges(g));
+  time('    acyclic', () => run(g));
+  time('    nestingGraph.run', () => nesting_graph_run(g));
+  time('    rank', () => rank(asNonCompoundGraph(g)));
+  time('    injectEdgeLabelProxies', () => injectEdgeLabelProxies(g));
+  time('    removeEmptyRanks', () => removeEmptyRanks(g));
+  time('    nestingGraph.cleanup', () => cleanup(g));
+  time('    normalizeRanks', () => normalizeRanks(g));
+  time('    assignRankMinMax', () => assignRankMinMax(g));
+  time('    removeEdgeLabelProxies', () => removeEdgeLabelProxies(g));
+  time('    normalize.run', () => normalize_run(g));
+  time('    parentDummyChains', () => parentDummyChains(g));
+  time('    addBorderSegments', () => addBorderSegments(g));
+  time('    order', () => order(g));
+  time('    insertSelfEdges', () => insertSelfEdges(g));
+  time('    adjustCoordinateSystem', () => adjust(g));
+  time('    position', () => position(g));
+  time('    positionSelfEdges', () => positionSelfEdges(g));
+  time('    removeBorderNodes', () => removeBorderNodes(g));
+  time('    normalize.undo', () => normalize_undo(g));
+  time('    fixupEdgeLabelCoords', () => fixupEdgeLabelCoords(g));
+  time('    undoCoordinateSystem', () => coordinate_system_undo(g));
+  time('    translateGraph', () => translateGraph(g));
+  time('    assignNodeIntersects', () => assignNodeIntersects(g));
+  time('    reversePoints', () => reversePointsForReversedEdges(g));
+  time('    acyclic.undo', () => undo(g));
 }
 
 /*
@@ -3929,7 +3886,7 @@ function updateInputGraph(inputGraph, layoutGraph) {
     var layoutLabel = layoutGraph.edge(e);
 
     inputLabel.points = layoutLabel.points;
-    if (has/* default */.A(layoutLabel, 'x')) {
+    if (Object.prototype.hasOwnProperty.call(layoutLabel, 'x')) {
       inputLabel.x = layoutLabel.x;
       inputLabel.y = layoutLabel.y;
     }
@@ -3966,7 +3923,7 @@ function buildLayoutGraph(inputGraph) {
   var graph = canonicalize(inputGraph.graph());
 
   g.setGraph(
-    merge/* default */.A({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), lodash_es_pick(graph, graphAttrs))
+    merge/* default */.A({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), lodash_es_pick(graph, graphAttrs)),
   );
 
   forEach/* default */.A(inputGraph.nodes(), function (v) {
@@ -3979,7 +3936,7 @@ function buildLayoutGraph(inputGraph) {
     var edge = canonicalize(inputGraph.edge(e));
     g.setEdge(
       e,
-      merge/* default */.A({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), lodash_es_pick(edge, edgeAttrs))
+      merge/* default */.A({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), lodash_es_pick(edge, edgeAttrs)),
     );
   });
 
@@ -4077,7 +4034,7 @@ function translateGraph(g) {
   });
   forEach/* default */.A(g.edges(), function (e) {
     var edge = g.edge(e);
-    if (has/* default */.A(edge, 'x')) {
+    if (Object.prototype.hasOwnProperty.call(edge, 'x')) {
       getExtremes(edge);
     }
   });
@@ -4097,10 +4054,10 @@ function translateGraph(g) {
       p.x -= minX;
       p.y -= minY;
     });
-    if (has/* default */.A(edge, 'x')) {
+    if (Object.prototype.hasOwnProperty.call(edge, 'x')) {
       edge.x -= minX;
     }
-    if (has/* default */.A(edge, 'y')) {
+    if (Object.prototype.hasOwnProperty.call(edge, 'y')) {
       edge.y -= minY;
     }
   });
@@ -4131,7 +4088,7 @@ function assignNodeIntersects(g) {
 function fixupEdgeLabelCoords(g) {
   forEach/* default */.A(g.edges(), function (e) {
     var edge = g.edge(e);
-    if (has/* default */.A(edge, 'x')) {
+    if (Object.prototype.hasOwnProperty.call(edge, 'x')) {
       if (edge.labelpos === 'l' || edge.labelpos === 'r') {
         edge.width -= edge.labeloffset;
       }
@@ -4211,7 +4168,7 @@ function insertSelfEdges(g) {
             e: selfEdge.e,
             label: selfEdge.label,
           },
-          '_se'
+          '_se',
         );
       });
       delete node.selfEdges;
@@ -4275,8 +4232,6 @@ __webpack_require__.d(__webpack_exports__, {
   T: () => (/* binding */ Graph)
 });
 
-// EXTERNAL MODULE: ./node_modules/lodash-es/has.js + 1 modules
-var has = __webpack_require__(796);
 // EXTERNAL MODULE: ./node_modules/lodash-es/constant.js
 var constant = __webpack_require__(3659);
 // EXTERNAL MODULE: ./node_modules/lodash-es/isFunction.js
@@ -4359,9 +4314,15 @@ var EDGE_KEY_DELIM = '\x01';
 //    we're going to get to a performant hashtable in JavaScript.
 class Graph {
   constructor(opts = {}) {
-    this._isDirected = has/* default */.A(opts, 'directed') ? opts.directed : true;
-    this._isMultigraph = has/* default */.A(opts, 'multigraph') ? opts.multigraph : false;
-    this._isCompound = has/* default */.A(opts, 'compound') ? opts.compound : false;
+    this._isDirected = Object.prototype.hasOwnProperty.call(opts, 'directed')
+      ? opts.directed
+      : true;
+    this._isMultigraph = Object.prototype.hasOwnProperty.call(opts, 'multigraph')
+      ? opts.multigraph
+      : false;
+    this._isCompound = Object.prototype.hasOwnProperty.call(opts, 'compound')
+      ? opts.compound
+      : false;
 
     // Label for the graph itself
     this._label = undefined;
@@ -4458,7 +4419,7 @@ class Graph {
     return this;
   }
   setNode(v, value) {
-    if (has/* default */.A(this._nodes, v)) {
+    if (Object.prototype.hasOwnProperty.call(this._nodes, v)) {
       if (arguments.length > 1) {
         this._nodes[v] = value;
       }
@@ -4483,20 +4444,17 @@ class Graph {
     return this._nodes[v];
   }
   hasNode(v) {
-    return has/* default */.A(this._nodes, v);
+    return Object.prototype.hasOwnProperty.call(this._nodes, v);
   }
   removeNode(v) {
-    var self = this;
-    if (has/* default */.A(this._nodes, v)) {
-      var removeEdge = function (e) {
-        self.removeEdge(self._edgeObjs[e]);
-      };
+    if (Object.prototype.hasOwnProperty.call(this._nodes, v)) {
+      var removeEdge = (e) => this.removeEdge(this._edgeObjs[e]);
       delete this._nodes[v];
       if (this._isCompound) {
         this._removeFromParentsChildList(v);
         delete this._parent[v];
-        forEach/* default */.A(this.children(v), function (child) {
-          self.setParent(child);
+        forEach/* default */.A(this.children(v), (child) => {
+          this.setParent(child);
         });
         delete this._children[v];
       }
@@ -4695,7 +4653,7 @@ class Graph {
     }
 
     var e = edgeArgsToId(this._isDirected, v, w, name);
-    if (has/* default */.A(this._edgeLabels, e)) {
+    if (Object.prototype.hasOwnProperty.call(this._edgeLabels, e)) {
       if (valueSpecified) {
         this._edgeLabels[e] = value;
       }
@@ -4740,7 +4698,7 @@ class Graph {
       arguments.length === 1
         ? edgeObjToId(this._isDirected, arguments[0])
         : edgeArgsToId(this._isDirected, v, w, name);
-    return has/* default */.A(this._edgeLabels, e);
+    return Object.prototype.hasOwnProperty.call(this._edgeLabels, e);
   }
   removeEdge(v, w, name) {
     var e =
@@ -5334,6 +5292,78 @@ function flatten(array) {
 /* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (flatten);
 
 
+/***/ }),
+
+/***/ 796:
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+
+// EXPORTS
+__webpack_require__.d(__webpack_exports__, {
+  A: () => (/* binding */ lodash_es_has)
+});
+
+;// ./node_modules/lodash-es/_baseHas.js
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var _baseHas_hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * The base implementation of `_.has` without support for deep paths.
+ *
+ * @private
+ * @param {Object} [object] The object to query.
+ * @param {Array|string} key The key to check.
+ * @returns {boolean} Returns `true` if `key` exists, else `false`.
+ */
+function baseHas(object, key) {
+  return object != null && _baseHas_hasOwnProperty.call(object, key);
+}
+
+/* harmony default export */ const _baseHas = (baseHas);
+
+// EXTERNAL MODULE: ./node_modules/lodash-es/_hasPath.js
+var _hasPath = __webpack_require__(4491);
+;// ./node_modules/lodash-es/has.js
+
+
+
+/**
+ * Checks if `path` is a direct property of `object`.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @param {Array|string} path The path to check.
+ * @returns {boolean} Returns `true` if `path` exists, else `false`.
+ * @example
+ *
+ * var object = { 'a': { 'b': 2 } };
+ * var other = _.create({ 'a': _.create({ 'b': 2 }) });
+ *
+ * _.has(object, 'a');
+ * // => true
+ *
+ * _.has(object, 'a.b');
+ * // => true
+ *
+ * _.has(object, ['a', 'b']);
+ * // => true
+ *
+ * _.has(other, 'a');
+ * // => false
+ */
+function has(object, path) {
+  return object != null && (0,_hasPath/* default */.A)(object, path, _baseHas);
+}
+
+/* harmony default export */ const lodash_es_has = (has);
+
+
 /***/ }),
 
 /***/ 6378: