@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/floyd-warshall.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"floyd-warshall.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/floyd-warshall.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar floydWarshall_1;\nvar hasRequiredFloydWarshall;\n\nfunction requireFloydWarshall () {\n\tif (hasRequiredFloydWarshall) return floydWarshall_1;\n\thasRequiredFloydWarshall = 1;\n\tvar _ = requireLodash();\n\n\tfloydWarshall_1 = floydWarshall;\n\n\tvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\n\tfunction floydWarshall(g, weightFn, edgeFn) {\n\t  return runFloydWarshall(g,\n\t    weightFn || DEFAULT_WEIGHT_FUNC,\n\t    edgeFn || function(v) { return g.outEdges(v); });\n\t}\n\n\tfunction runFloydWarshall(g, weightFn, edgeFn) {\n\t  var results = {};\n\t  var nodes = g.nodes();\n\n\t  nodes.forEach(function(v) {\n\t    results[v] = {};\n\t    results[v][v] = { distance: 0 };\n\t    nodes.forEach(function(w) {\n\t      if (v !== w) {\n\t        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n\t      }\n\t    });\n\t    edgeFn(v).forEach(function(edge) {\n\t      var w = edge.v === v ? edge.w : edge.v;\n\t      var d = weightFn(edge);\n\t      results[v][w] = { distance: d, predecessor: v };\n\t    });\n\t  });\n\n\t  nodes.forEach(function(k) {\n\t    var rowK = results[k];\n\t    nodes.forEach(function(i) {\n\t      var rowI = results[i];\n\t      nodes.forEach(function(j) {\n\t        var ik = rowI[k];\n\t        var kj = rowK[j];\n\t        var ij = rowI[j];\n\t        var altDistance = ik.distance + kj.distance;\n\t        if (altDistance < ij.distance) {\n\t          ij.distance = altDistance;\n\t          ij.predecessor = kj.predecessor;\n\t        }\n\t      });\n\t    });\n\t  });\n\n\t  return results;\n\t}\n\treturn floydWarshall_1;\n}\n\nexport { requireFloydWarshall as __require };\n//# sourceMappingURL=floyd-warshall.js.map\n"],"names":["floydWarshall_1","hasRequiredFloydWarshall","requireFloydWarshall","requireLodash","floydWarshall","DEFAULT_WEIGHT_FUNC","g","weightFn","edgeFn","runFloydWarshall","v","results","nodes","w","edge","d","k","rowK","i","rowI","j","ik","kj","ij","altDistance"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAwB;AAChC,MAAID,EAA0B,QAAOD;AACrC,EAAAC,IAA2B;AAC3B,MAAI,IAAIE,EAAa;AAErB,EAAAH,IAAkBI;AAElB,MAAIC,IAAsB,EAAE,SAAS,CAAC;AAEtC,WAASD,EAAcE,GAAGC,GAAUC,GAAQ;AAC1C,WAAOC;AAAA,MAAiBH;AAAA,MACtBC,KAAYF;AAAA,MACZG,KAAU,SAASE,GAAG;AAAE,eAAOJ,EAAE,SAASI,CAAC;AAAA,MAAG;AAAA,IAAC;AAAA,EACnD;AAEA,WAASD,EAAiBH,GAAGC,GAAUC,GAAQ;AAC7C,QAAIG,IAAU,CAAA,GACVC,IAAQN,EAAE,MAAK;AAEnB,WAAAM,EAAM,QAAQ,SAASF,GAAG;AACxB,MAAAC,EAAQD,CAAC,IAAI,CAAA,GACbC,EAAQD,CAAC,EAAEA,CAAC,IAAI,EAAE,UAAU,EAAC,GAC7BE,EAAM,QAAQ,SAASC,GAAG;AACxB,QAAIH,MAAMG,MACRF,EAAQD,CAAC,EAAEG,CAAC,IAAI,EAAE,UAAU,OAAO,kBAAiB;AAAA,MAExD,CAAC,GACDL,EAAOE,CAAC,EAAE,QAAQ,SAASI,GAAM;AAC/B,YAAID,IAAIC,EAAK,MAAMJ,IAAII,EAAK,IAAIA,EAAK,GACjCC,IAAIR,EAASO,CAAI;AACrB,QAAAH,EAAQD,CAAC,EAAEG,CAAC,IAAI,EAAE,UAAUE,GAAG,aAAaL,EAAC;AAAA,MAC/C,CAAC;AAAA,IACH,CAAC,GAEDE,EAAM,QAAQ,SAASI,GAAG;AACxB,UAAIC,IAAON,EAAQK,CAAC;AACpB,MAAAJ,EAAM,QAAQ,SAASM,GAAG;AACxB,YAAIC,IAAOR,EAAQO,CAAC;AACpB,QAAAN,EAAM,QAAQ,SAASQ,GAAG;AACxB,cAAIC,IAAKF,EAAKH,CAAC,GACXM,IAAKL,EAAKG,CAAC,GACXG,IAAKJ,EAAKC,CAAC,GACXI,IAAcH,EAAG,WAAWC,EAAG;AACnC,UAAIE,IAAcD,EAAG,aACnBA,EAAG,WAAWC,GACdD,EAAG,cAAcD,EAAG;AAAA,QAExB,CAAC;AAAA,MACH,CAAC;AAAA,IACH,CAAC,GAEMX;AAAA,EACT;AACA,SAAOX;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/index.js

@@ -0,0 +1,31 @@
+import { __require as i } from "./components.js";
+import { __require as o } from "./dijkstra.js";
+import { __require as s } from "./dijkstra-all.js";
+import { __require as a } from "./find-cycles.js";
+import { __require as u } from "./floyd-warshall.js";
+import { __require as t } from "./is-acyclic.js";
+import { __require as m } from "./postorder.js";
+import { __require as q } from "./preorder.js";
+import { __require as _ } from "./prim.js";
+import { __require as p } from "./tarjan.js";
+import { __require as l } from "./topsort.js";
+var r, e;
+function P() {
+  return e || (e = 1, r = {
+    components: i(),
+    dijkstra: o(),
+    dijkstraAll: s(),
+    findCycles: a(),
+    floydWarshall: u(),
+    isAcyclic: t(),
+    postorder: m(),
+    preorder: q(),
+    prim: _(),
+    tarjan: p(),
+    topsort: l()
+  }), r;
+}
+export {
+  P as __require
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/index.js"],"sourcesContent":["import { __require as requireComponents } from './components.js';\nimport { __require as requireDijkstra } from './dijkstra.js';\nimport { __require as requireDijkstraAll } from './dijkstra-all.js';\nimport { __require as requireFindCycles } from './find-cycles.js';\nimport { __require as requireFloydWarshall } from './floyd-warshall.js';\nimport { __require as requireIsAcyclic } from './is-acyclic.js';\nimport { __require as requirePostorder } from './postorder.js';\nimport { __require as requirePreorder } from './preorder.js';\nimport { __require as requirePrim } from './prim.js';\nimport { __require as requireTarjan } from './tarjan.js';\nimport { __require as requireTopsort } from './topsort.js';\n\nvar alg;\nvar hasRequiredAlg;\n\nfunction requireAlg () {\n\tif (hasRequiredAlg) return alg;\n\thasRequiredAlg = 1;\n\talg = {\n\t  components: requireComponents(),\n\t  dijkstra: requireDijkstra(),\n\t  dijkstraAll: requireDijkstraAll(),\n\t  findCycles: requireFindCycles(),\n\t  floydWarshall: requireFloydWarshall(),\n\t  isAcyclic: requireIsAcyclic(),\n\t  postorder: requirePostorder(),\n\t  preorder: requirePreorder(),\n\t  prim: requirePrim(),\n\t  tarjan: requireTarjan(),\n\t  topsort: requireTopsort()\n\t};\n\treturn alg;\n}\n\nexport { requireAlg as __require };\n//# sourceMappingURL=index.js.map\n"],"names":["alg","hasRequiredAlg","requireAlg","requireComponents","requireDijkstra","requireDijkstraAll","requireFindCycles","requireFloydWarshall","requireIsAcyclic","requirePostorder","requirePreorder","requirePrim","requireTarjan","requireTopsort"],"mappings":";;;;;;;;;;;AAYA,IAAIA,GACAC;AAEJ,SAASC,IAAc;AACtB,SAAID,MACJA,IAAiB,GACjBD,IAAM;AAAA,IACJ,YAAYG,EAAiB;AAAA,IAC7B,UAAUC,EAAe;AAAA,IACzB,aAAaC,EAAkB;AAAA,IAC/B,YAAYC,EAAiB;AAAA,IAC7B,eAAeC,EAAoB;AAAA,IACnC,WAAWC,EAAgB;AAAA,IAC3B,WAAWC,EAAgB;AAAA,IAC3B,UAAUC,EAAe;AAAA,IACzB,MAAMC,EAAW;AAAA,IACjB,QAAQC,EAAa;AAAA,IACrB,SAASC,EAAc;AAAA,EAC1B,IACQb;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/is-acyclic.js

@@ -0,0 +1,23 @@
+import { __require as u } from "./topsort.js";
+var r, i;
+function s() {
+  if (i) return r;
+  i = 1;
+  var e = u();
+  r = t;
+  function t(o) {
+    try {
+      e(o);
+    } catch (c) {
+      if (c instanceof e.CycleException)
+        return !1;
+      throw c;
+    }
+    return !0;
+  }
+  return r;
+}
+export {
+  s as __require
+};
+//# sourceMappingURL=is-acyclic.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/is-acyclic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"is-acyclic.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/is-acyclic.js"],"sourcesContent":["import { __require as requireTopsort } from './topsort.js';\n\nvar isAcyclic_1;\nvar hasRequiredIsAcyclic;\n\nfunction requireIsAcyclic () {\n\tif (hasRequiredIsAcyclic) return isAcyclic_1;\n\thasRequiredIsAcyclic = 1;\n\tvar topsort = requireTopsort();\n\n\tisAcyclic_1 = isAcyclic;\n\n\tfunction isAcyclic(g) {\n\t  try {\n\t    topsort(g);\n\t  } catch (e) {\n\t    if (e instanceof topsort.CycleException) {\n\t      return false;\n\t    }\n\t    throw e;\n\t  }\n\t  return true;\n\t}\n\treturn isAcyclic_1;\n}\n\nexport { requireIsAcyclic as __require };\n//# sourceMappingURL=is-acyclic.js.map\n"],"names":["isAcyclic_1","hasRequiredIsAcyclic","requireIsAcyclic","topsort","requireTopsort","isAcyclic","g","e"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAoB;AAC5B,MAAID,EAAsB,QAAOD;AACjC,EAAAC,IAAuB;AACvB,MAAIE,IAAUC,EAAc;AAE5B,EAAAJ,IAAcK;AAEd,WAASA,EAAUC,GAAG;AACpB,QAAI;AACF,MAAAH,EAAQG,CAAC;AAAA,IACX,SAASC,GAAG;AACV,UAAIA,aAAaJ,EAAQ;AACvB,eAAO;AAET,YAAMI;AAAA,IACR;AACA,WAAO;AAAA,EACT;AACA,SAAOP;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/postorder.js

@@ -0,0 +1,16 @@
+import { __require as i } from "./dfs.js";
+var r, e;
+function a() {
+  if (e) return r;
+  e = 1;
+  var o = i();
+  r = t;
+  function t(s, u) {
+    return o(s, u, "post");
+  }
+  return r;
+}
+export {
+  a as __require
+};
+//# sourceMappingURL=postorder.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/postorder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"postorder.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/postorder.js"],"sourcesContent":["import { __require as requireDfs } from './dfs.js';\n\nvar postorder_1;\nvar hasRequiredPostorder;\n\nfunction requirePostorder () {\n\tif (hasRequiredPostorder) return postorder_1;\n\thasRequiredPostorder = 1;\n\tvar dfs = requireDfs();\n\n\tpostorder_1 = postorder;\n\n\tfunction postorder(g, vs) {\n\t  return dfs(g, vs, \"post\");\n\t}\n\treturn postorder_1;\n}\n\nexport { requirePostorder as __require };\n//# sourceMappingURL=postorder.js.map\n"],"names":["postorder_1","hasRequiredPostorder","requirePostorder","dfs","requireDfs","postorder","g","vs"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAoB;AAC5B,MAAID,EAAsB,QAAOD;AACjC,EAAAC,IAAuB;AACvB,MAAIE,IAAMC,EAAU;AAEpB,EAAAJ,IAAcK;AAEd,WAASA,EAAUC,GAAGC,GAAI;AACxB,WAAOJ,EAAIG,GAAGC,GAAI,MAAM;AAAA,EAC1B;AACA,SAAOP;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/preorder.js

@@ -0,0 +1,16 @@
+import { __require as t } from "./dfs.js";
+var r, e;
+function d() {
+  if (e) return r;
+  e = 1;
+  var u = t();
+  r = i;
+  function i(o, n) {
+    return u(o, n, "pre");
+  }
+  return r;
+}
+export {
+  d as __require
+};
+//# sourceMappingURL=preorder.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/preorder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"preorder.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/preorder.js"],"sourcesContent":["import { __require as requireDfs } from './dfs.js';\n\nvar preorder_1;\nvar hasRequiredPreorder;\n\nfunction requirePreorder () {\n\tif (hasRequiredPreorder) return preorder_1;\n\thasRequiredPreorder = 1;\n\tvar dfs = requireDfs();\n\n\tpreorder_1 = preorder;\n\n\tfunction preorder(g, vs) {\n\t  return dfs(g, vs, \"pre\");\n\t}\n\treturn preorder_1;\n}\n\nexport { requirePreorder as __require };\n//# sourceMappingURL=preorder.js.map\n"],"names":["preorder_1","hasRequiredPreorder","requirePreorder","dfs","requireDfs","preorder","g","vs"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAmB;AAC3B,MAAID,EAAqB,QAAOD;AAChC,EAAAC,IAAsB;AACtB,MAAIE,IAAMC,EAAU;AAEpB,EAAAJ,IAAaK;AAEb,WAASA,EAASC,GAAGC,GAAI;AACvB,WAAOJ,EAAIG,GAAGC,GAAI,KAAK;AAAA,EACzB;AACA,SAAOP;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/prim.js

@@ -0,0 +1,41 @@
+import { __require as w } from "../lodash.js";
+import { __require as I } from "../graph.js";
+import { __require as l } from "../data/priority-queue.js";
+var t, d;
+function y() {
+  if (d) return t;
+  d = 1;
+  var s = w(), m = I(), _ = l();
+  t = c;
+  function c(a, h) {
+    var n = new m(), o = {}, i = new _(), r;
+    function q(e) {
+      var u = e.v === r ? e.w : e.v, v = i.priority(u);
+      if (v !== void 0) {
+        var p = h(e);
+        p < v && (o[u] = r, i.decrease(u, p));
+      }
+    }
+    if (a.nodeCount() === 0)
+      return n;
+    s.each(a.nodes(), function(e) {
+      i.add(e, Number.POSITIVE_INFINITY), n.setNode(e);
+    }), i.decrease(a.nodes()[0], 0);
+    for (var f = !1; i.size() > 0; ) {
+      if (r = i.removeMin(), s.has(o, r))
+        n.setEdge(r, o[r]);
+      else {
+        if (f)
+          throw new Error("Input graph is not connected: " + a);
+        f = !0;
+      }
+      a.nodeEdges(r).forEach(q);
+    }
+    return n;
+  }
+  return t;
+}
+export {
+  y as __require
+};
+//# sourceMappingURL=prim.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/prim.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prim.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/prim.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireGraph } from '../graph.js';\nimport { __require as requirePriorityQueue } from '../data/priority-queue.js';\n\nvar prim_1;\nvar hasRequiredPrim;\n\nfunction requirePrim () {\n\tif (hasRequiredPrim) return prim_1;\n\thasRequiredPrim = 1;\n\tvar _ = requireLodash();\n\tvar Graph = requireGraph();\n\tvar PriorityQueue = requirePriorityQueue();\n\n\tprim_1 = prim;\n\n\tfunction prim(g, weightFunc) {\n\t  var result = new Graph();\n\t  var parents = {};\n\t  var pq = new PriorityQueue();\n\t  var v;\n\n\t  function updateNeighbors(edge) {\n\t    var w = edge.v === v ? edge.w : edge.v;\n\t    var pri = pq.priority(w);\n\t    if (pri !== undefined) {\n\t      var edgeWeight = weightFunc(edge);\n\t      if (edgeWeight < pri) {\n\t        parents[w] = v;\n\t        pq.decrease(w, edgeWeight);\n\t      }\n\t    }\n\t  }\n\n\t  if (g.nodeCount() === 0) {\n\t    return result;\n\t  }\n\n\t  _.each(g.nodes(), function(v) {\n\t    pq.add(v, Number.POSITIVE_INFINITY);\n\t    result.setNode(v);\n\t  });\n\n\t  // Start from an arbitrary node\n\t  pq.decrease(g.nodes()[0], 0);\n\n\t  var init = false;\n\t  while (pq.size() > 0) {\n\t    v = pq.removeMin();\n\t    if (_.has(parents, v)) {\n\t      result.setEdge(v, parents[v]);\n\t    } else if (init) {\n\t      throw new Error(\"Input graph is not connected: \" + g);\n\t    } else {\n\t      init = true;\n\t    }\n\n\t    g.nodeEdges(v).forEach(updateNeighbors);\n\t  }\n\n\t  return result;\n\t}\n\treturn prim_1;\n}\n\nexport { requirePrim as __require };\n//# sourceMappingURL=prim.js.map\n"],"names":["prim_1","hasRequiredPrim","requirePrim","_","requireLodash","Graph","requireGraph","PriorityQueue","requirePriorityQueue","prim","g","weightFunc","result","parents","pq","v","updateNeighbors","edge","w","pri","edgeWeight","init"],"mappings":";;;AAIA,IAAIA,GACAC;AAEJ,SAASC,IAAe;AACvB,MAAID,EAAiB,QAAOD;AAC5B,EAAAC,IAAkB;AAClB,MAAIE,IAAIC,EAAa,GACjBC,IAAQC,EAAY,GACpBC,IAAgBC,EAAoB;AAExC,EAAAR,IAASS;AAET,WAASA,EAAKC,GAAGC,GAAY;AAC3B,QAAIC,IAAS,IAAIP,EAAK,GAClBQ,IAAU,CAAA,GACVC,IAAK,IAAIP,EAAa,GACtBQ;AAEJ,aAASC,EAAgBC,GAAM;AAC7B,UAAIC,IAAID,EAAK,MAAMF,IAAIE,EAAK,IAAIA,EAAK,GACjCE,IAAML,EAAG,SAASI,CAAC;AACvB,UAAIC,MAAQ,QAAW;AACrB,YAAIC,IAAaT,EAAWM,CAAI;AAChC,QAAIG,IAAaD,MACfN,EAAQK,CAAC,IAAIH,GACbD,EAAG,SAASI,GAAGE,CAAU;AAAA,MAE7B;AAAA,IACF;AAEA,QAAIV,EAAE,UAAS,MAAO;AACpB,aAAOE;AAGT,IAAAT,EAAE,KAAKO,EAAE,MAAK,GAAI,SAASK,GAAG;AAC5B,MAAAD,EAAG,IAAIC,GAAG,OAAO,iBAAiB,GAClCH,EAAO,QAAQG,CAAC;AAAA,IAClB,CAAC,GAGDD,EAAG,SAASJ,EAAE,MAAK,EAAG,CAAC,GAAG,CAAC;AAG3B,aADIW,IAAO,IACJP,EAAG,KAAI,IAAK,KAAG;AAEpB,UADAC,IAAID,EAAG,UAAS,GACZX,EAAE,IAAIU,GAASE,CAAC;AAClB,QAAAH,EAAO,QAAQG,GAAGF,EAAQE,CAAC,CAAC;AAAA,WACvB;AAAA,YAAIM;AACT,gBAAM,IAAI,MAAM,mCAAmCX,CAAC;AAEpD,QAAAW,IAAO;AAAA;AAGT,MAAAX,EAAE,UAAUK,CAAC,EAAE,QAAQC,CAAe;AAAA,IACxC;AAEA,WAAOJ;AAAA,EACT;AACA,SAAOZ;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/tarjan.js

@@ -0,0 +1,35 @@
+import { __require as v } from "../lodash.js";
+var o, k;
+function _() {
+  if (k) return o;
+  k = 1;
+  var s = v();
+  o = d;
+  function d(t) {
+    var u = 0, l = [], r = {}, f = [];
+    function c(n) {
+      var a = r[n] = {
+        onStack: !0,
+        lowlink: u,
+        index: u++
+      };
+      if (l.push(n), t.successors(n).forEach(function(i) {
+        s.has(r, i) ? r[i].onStack && (a.lowlink = Math.min(a.lowlink, r[i].index)) : (c(i), a.lowlink = Math.min(a.lowlink, r[i].lowlink));
+      }), a.lowlink === a.index) {
+        var h = [], e;
+        do
+          e = l.pop(), r[e].onStack = !1, h.push(e);
+        while (n !== e);
+        f.push(h);
+      }
+    }
+    return t.nodes().forEach(function(n) {
+      s.has(r, n) || c(n);
+    }), f;
+  }
+  return o;
+}
+export {
+  _ as __require
+};
+//# sourceMappingURL=tarjan.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/tarjan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tarjan.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/tarjan.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar tarjan_1;\nvar hasRequiredTarjan;\n\nfunction requireTarjan () {\n\tif (hasRequiredTarjan) return tarjan_1;\n\thasRequiredTarjan = 1;\n\tvar _ = requireLodash();\n\n\ttarjan_1 = tarjan;\n\n\tfunction tarjan(g) {\n\t  var index = 0;\n\t  var stack = [];\n\t  var visited = {}; // node id -> { onStack, lowlink, index }\n\t  var results = [];\n\n\t  function dfs(v) {\n\t    var entry = visited[v] = {\n\t      onStack: true,\n\t      lowlink: index,\n\t      index: index++\n\t    };\n\t    stack.push(v);\n\n\t    g.successors(v).forEach(function(w) {\n\t      if (!_.has(visited, w)) {\n\t        dfs(w);\n\t        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n\t      } else if (visited[w].onStack) {\n\t        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n\t      }\n\t    });\n\n\t    if (entry.lowlink === entry.index) {\n\t      var cmpt = [];\n\t      var w;\n\t      do {\n\t        w = stack.pop();\n\t        visited[w].onStack = false;\n\t        cmpt.push(w);\n\t      } while (v !== w);\n\t      results.push(cmpt);\n\t    }\n\t  }\n\n\t  g.nodes().forEach(function(v) {\n\t    if (!_.has(visited, v)) {\n\t      dfs(v);\n\t    }\n\t  });\n\n\t  return results;\n\t}\n\treturn tarjan_1;\n}\n\nexport { requireTarjan as __require };\n//# sourceMappingURL=tarjan.js.map\n"],"names":["tarjan_1","hasRequiredTarjan","requireTarjan","_","requireLodash","tarjan","g","index","stack","visited","results","dfs","v","entry","w","cmpt"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAiB;AACzB,MAAID,EAAmB,QAAOD;AAC9B,EAAAC,IAAoB;AACpB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAWK;AAEX,WAASA,EAAOC,GAAG;AACjB,QAAIC,IAAQ,GACRC,IAAQ,CAAA,GACRC,IAAU,CAAA,GACVC,IAAU,CAAA;AAEd,aAASC,EAAIC,GAAG;AACd,UAAIC,IAAQJ,EAAQG,CAAC,IAAI;AAAA,QACvB,SAAS;AAAA,QACT,SAASL;AAAA,QACT,OAAOA;AAAA,MACd;AAYK,UAXAC,EAAM,KAAKI,CAAC,GAEZN,EAAE,WAAWM,CAAC,EAAE,QAAQ,SAASE,GAAG;AAClC,QAAKX,EAAE,IAAIM,GAASK,CAAC,IAGVL,EAAQK,CAAC,EAAE,YACpBD,EAAM,UAAU,KAAK,IAAIA,EAAM,SAASJ,EAAQK,CAAC,EAAE,KAAK,MAHxDH,EAAIG,CAAC,GACLD,EAAM,UAAU,KAAK,IAAIA,EAAM,SAASJ,EAAQK,CAAC,EAAE,OAAO;AAAA,MAI9D,CAAC,GAEGD,EAAM,YAAYA,EAAM,OAAO;AACjC,YAAIE,IAAO,CAAA,GACPD;AACJ;AACE,UAAAA,IAAIN,EAAM,IAAG,GACbC,EAAQK,CAAC,EAAE,UAAU,IACrBC,EAAK,KAAKD,CAAC;AAAA,eACJF,MAAME;AACf,QAAAJ,EAAQ,KAAKK,CAAI;AAAA,MACnB;AAAA,IACF;AAEA,WAAAT,EAAE,MAAK,EAAG,QAAQ,SAASM,GAAG;AAC5B,MAAKT,EAAE,IAAIM,GAASG,CAAC,KACnBD,EAAIC,CAAC;AAAA,IAET,CAAC,GAEMF;AAAA,EACT;AACA,SAAOV;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/topsort.js

@@ -0,0 +1,26 @@
+import { __require as f } from "../lodash.js";
+var u, p;
+function v() {
+  if (p) return u;
+  p = 1;
+  var e = f();
+  u = a, a.CycleException = t;
+  function a(i) {
+    var s = {}, o = {}, n = [];
+    function c(r) {
+      if (e.has(o, r))
+        throw new t();
+      e.has(s, r) || (o[r] = !0, s[r] = !0, e.each(i.predecessors(r), c), delete o[r], n.push(r));
+    }
+    if (e.each(i.sinks(), c), e.size(s) !== i.nodeCount())
+      throw new t();
+    return n;
+  }
+  function t() {
+  }
+  return t.prototype = new Error(), u;
+}
+export {
+  v as __require
+};
+//# sourceMappingURL=topsort.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/topsort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topsort.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/topsort.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar topsort_1;\nvar hasRequiredTopsort;\n\nfunction requireTopsort () {\n\tif (hasRequiredTopsort) return topsort_1;\n\thasRequiredTopsort = 1;\n\tvar _ = requireLodash();\n\n\ttopsort_1 = topsort;\n\ttopsort.CycleException = CycleException;\n\n\tfunction topsort(g) {\n\t  var visited = {};\n\t  var stack = {};\n\t  var results = [];\n\n\t  function visit(node) {\n\t    if (_.has(stack, node)) {\n\t      throw new CycleException();\n\t    }\n\n\t    if (!_.has(visited, node)) {\n\t      stack[node] = true;\n\t      visited[node] = true;\n\t      _.each(g.predecessors(node), visit);\n\t      delete stack[node];\n\t      results.push(node);\n\t    }\n\t  }\n\n\t  _.each(g.sinks(), visit);\n\n\t  if (_.size(visited) !== g.nodeCount()) {\n\t    throw new CycleException();\n\t  }\n\n\t  return results;\n\t}\n\n\tfunction CycleException() {}\n\tCycleException.prototype = new Error(); // must be an instance of Error to pass testing\n\treturn topsort_1;\n}\n\nexport { requireTopsort as __require };\n//# sourceMappingURL=topsort.js.map\n"],"names":["topsort_1","hasRequiredTopsort","requireTopsort","_","requireLodash","topsort","CycleException","g","visited","stack","results","visit","node"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAkB;AAC1B,MAAID,EAAoB,QAAOD;AAC/B,EAAAC,IAAqB;AACrB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAYK,GACZA,EAAQ,iBAAiBC;AAEzB,WAASD,EAAQE,GAAG;AAClB,QAAIC,IAAU,CAAA,GACVC,IAAQ,CAAA,GACRC,IAAU,CAAA;AAEd,aAASC,EAAMC,GAAM;AACnB,UAAIT,EAAE,IAAIM,GAAOG,CAAI;AACnB,cAAM,IAAIN,EAAc;AAG1B,MAAKH,EAAE,IAAIK,GAASI,CAAI,MACtBH,EAAMG,CAAI,IAAI,IACdJ,EAAQI,CAAI,IAAI,IAChBT,EAAE,KAAKI,EAAE,aAAaK,CAAI,GAAGD,CAAK,GAClC,OAAOF,EAAMG,CAAI,GACjBF,EAAQ,KAAKE,CAAI;AAAA,IAErB;AAIA,QAFAT,EAAE,KAAKI,EAAE,MAAK,GAAII,CAAK,GAEnBR,EAAE,KAAKK,CAAO,MAAMD,EAAE,UAAS;AACjC,YAAM,IAAID,EAAc;AAG1B,WAAOI;AAAA,EACT;AAEA,WAASJ,IAAiB;AAAA,EAAC;AAC3B,SAAAA,EAAe,YAAY,IAAI,SACxBN;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/data/priority-queue.js

@@ -0,0 +1,57 @@
+import { __require as u } from "../lodash.js";
+var n, h;
+function _() {
+  if (h) return n;
+  h = 1;
+  var s = u();
+  n = a;
+  function a() {
+    this._arr = [], this._keyIndices = {};
+  }
+  return a.prototype.size = function() {
+    return this._arr.length;
+  }, a.prototype.keys = function() {
+    return this._arr.map(function(r) {
+      return r.key;
+    });
+  }, a.prototype.has = function(r) {
+    return s.has(this._keyIndices, r);
+  }, a.prototype.priority = function(r) {
+    var t = this._keyIndices[r];
+    if (t !== void 0)
+      return this._arr[t].priority;
+  }, a.prototype.min = function() {
+    if (this.size() === 0)
+      throw new Error("Queue underflow");
+    return this._arr[0].key;
+  }, a.prototype.add = function(r, t) {
+    var i = this._keyIndices;
+    if (r = String(r), !s.has(i, r)) {
+      var o = this._arr, e = o.length;
+      return i[r] = e, o.push({ key: r, priority: t }), this._decrease(e), !0;
+    }
+    return !1;
+  }, a.prototype.removeMin = function() {
+    this._swap(0, this._arr.length - 1);
+    var r = this._arr.pop();
+    return delete this._keyIndices[r.key], this._heapify(0), r.key;
+  }, a.prototype.decrease = function(r, t) {
+    var i = this._keyIndices[r];
+    if (t > this._arr[i].priority)
+      throw new Error("New priority is greater than current priority. Key: " + r + " Old: " + this._arr[i].priority + " New: " + t);
+    this._arr[i].priority = t, this._decrease(i);
+  }, a.prototype._heapify = function(r) {
+    var t = this._arr, i = 2 * r, o = i + 1, e = r;
+    i < t.length && (e = t[i].priority < t[e].priority ? i : e, o < t.length && (e = t[o].priority < t[e].priority ? o : e), e !== r && (this._swap(r, e), this._heapify(e)));
+  }, a.prototype._decrease = function(r) {
+    for (var t = this._arr, i = t[r].priority, o; r !== 0 && (o = r >> 1, !(t[o].priority < i)); )
+      this._swap(r, o), r = o;
+  }, a.prototype._swap = function(r, t) {
+    var i = this._arr, o = this._keyIndices, e = i[r], p = i[t];
+    i[r] = p, i[t] = e, o[p.key] = r, o[e.key] = t;
+  }, n;
+}
+export {
+  _ as __require
+};
+//# sourceMappingURL=priority-queue.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/data/priority-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-queue.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/data/priority-queue.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar priorityQueue;\nvar hasRequiredPriorityQueue;\n\nfunction requirePriorityQueue () {\n\tif (hasRequiredPriorityQueue) return priorityQueue;\n\thasRequiredPriorityQueue = 1;\n\tvar _ = requireLodash();\n\n\tpriorityQueue = PriorityQueue;\n\n\t/**\n\t * A min-priority queue data structure. This algorithm is derived from Cormen,\n\t * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n\t * queue is that you can efficiently (in O(1) time) get the smallest key in\n\t * the queue. Adding and removing elements takes O(log n) time. A key can\n\t * have its priority decreased in O(log n) time.\n\t */\n\tfunction PriorityQueue() {\n\t  this._arr = [];\n\t  this._keyIndices = {};\n\t}\n\n\t/**\n\t * Returns the number of elements in the queue. Takes `O(1)` time.\n\t */\n\tPriorityQueue.prototype.size = function() {\n\t  return this._arr.length;\n\t};\n\n\t/**\n\t * Returns the keys that are in the queue. Takes `O(n)` time.\n\t */\n\tPriorityQueue.prototype.keys = function() {\n\t  return this._arr.map(function(x) { return x.key; });\n\t};\n\n\t/**\n\t * Returns `true` if **key** is in the queue and `false` if not.\n\t */\n\tPriorityQueue.prototype.has = function(key) {\n\t  return _.has(this._keyIndices, key);\n\t};\n\n\t/**\n\t * Returns the priority for **key**. If **key** is not present in the queue\n\t * then this function returns `undefined`. Takes `O(1)` time.\n\t *\n\t * @param {Object} key\n\t */\n\tPriorityQueue.prototype.priority = function(key) {\n\t  var index = this._keyIndices[key];\n\t  if (index !== undefined) {\n\t    return this._arr[index].priority;\n\t  }\n\t};\n\n\t/**\n\t * Returns the key for the minimum element in this queue. If the queue is\n\t * empty this function throws an Error. Takes `O(1)` time.\n\t */\n\tPriorityQueue.prototype.min = function() {\n\t  if (this.size() === 0) {\n\t    throw new Error(\"Queue underflow\");\n\t  }\n\t  return this._arr[0].key;\n\t};\n\n\t/**\n\t * Inserts a new key into the priority queue. If the key already exists in\n\t * the queue this function returns `false`; otherwise it will return `true`.\n\t * Takes `O(n)` time.\n\t *\n\t * @param {Object} key the key to add\n\t * @param {Number} priority the initial priority for the key\n\t */\n\tPriorityQueue.prototype.add = function(key, priority) {\n\t  var keyIndices = this._keyIndices;\n\t  key = String(key);\n\t  if (!_.has(keyIndices, key)) {\n\t    var arr = this._arr;\n\t    var index = arr.length;\n\t    keyIndices[key] = index;\n\t    arr.push({key: key, priority: priority});\n\t    this._decrease(index);\n\t    return true;\n\t  }\n\t  return false;\n\t};\n\n\t/**\n\t * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n\t */\n\tPriorityQueue.prototype.removeMin = function() {\n\t  this._swap(0, this._arr.length - 1);\n\t  var min = this._arr.pop();\n\t  delete this._keyIndices[min.key];\n\t  this._heapify(0);\n\t  return min.key;\n\t};\n\n\t/**\n\t * Decreases the priority for **key** to **priority**. If the new priority is\n\t * greater than the previous priority, this function will throw an Error.\n\t *\n\t * @param {Object} key the key for which to raise priority\n\t * @param {Number} priority the new priority for the key\n\t */\n\tPriorityQueue.prototype.decrease = function(key, priority) {\n\t  var index = this._keyIndices[key];\n\t  if (priority > this._arr[index].priority) {\n\t    throw new Error(\"New priority is greater than current priority. \" +\n\t        \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n\t  }\n\t  this._arr[index].priority = priority;\n\t  this._decrease(index);\n\t};\n\n\tPriorityQueue.prototype._heapify = function(i) {\n\t  var arr = this._arr;\n\t  var l = 2 * i;\n\t  var r = l + 1;\n\t  var largest = i;\n\t  if (l < arr.length) {\n\t    largest = arr[l].priority < arr[largest].priority ? l : largest;\n\t    if (r < arr.length) {\n\t      largest = arr[r].priority < arr[largest].priority ? r : largest;\n\t    }\n\t    if (largest !== i) {\n\t      this._swap(i, largest);\n\t      this._heapify(largest);\n\t    }\n\t  }\n\t};\n\n\tPriorityQueue.prototype._decrease = function(index) {\n\t  var arr = this._arr;\n\t  var priority = arr[index].priority;\n\t  var parent;\n\t  while (index !== 0) {\n\t    parent = index >> 1;\n\t    if (arr[parent].priority < priority) {\n\t      break;\n\t    }\n\t    this._swap(index, parent);\n\t    index = parent;\n\t  }\n\t};\n\n\tPriorityQueue.prototype._swap = function(i, j) {\n\t  var arr = this._arr;\n\t  var keyIndices = this._keyIndices;\n\t  var origArrI = arr[i];\n\t  var origArrJ = arr[j];\n\t  arr[i] = origArrJ;\n\t  arr[j] = origArrI;\n\t  keyIndices[origArrJ.key] = i;\n\t  keyIndices[origArrI.key] = j;\n\t};\n\treturn priorityQueue;\n}\n\nexport { requirePriorityQueue as __require };\n//# sourceMappingURL=priority-queue.js.map\n"],"names":["priorityQueue","hasRequiredPriorityQueue","requirePriorityQueue","_","requireLodash","PriorityQueue","x","key","index","priority","keyIndices","arr","min","i","l","r","largest","parent","j","origArrI","origArrJ"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAwB;AAChC,MAAID,EAA0B,QAAOD;AACrC,EAAAC,IAA2B;AAC3B,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAgBK;AAShB,WAASA,IAAgB;AACvB,SAAK,OAAO,CAAA,GACZ,KAAK,cAAc,CAAA;AAAA,EACrB;AAKA,SAAAA,EAAc,UAAU,OAAO,WAAW;AACxC,WAAO,KAAK,KAAK;AAAA,EACnB,GAKAA,EAAc,UAAU,OAAO,WAAW;AACxC,WAAO,KAAK,KAAK,IAAI,SAASC,GAAG;AAAE,aAAOA,EAAE;AAAA,IAAK,CAAC;AAAA,EACpD,GAKAD,EAAc,UAAU,MAAM,SAASE,GAAK;AAC1C,WAAOJ,EAAE,IAAI,KAAK,aAAaI,CAAG;AAAA,EACpC,GAQAF,EAAc,UAAU,WAAW,SAASE,GAAK;AAC/C,QAAIC,IAAQ,KAAK,YAAYD,CAAG;AAChC,QAAIC,MAAU;AACZ,aAAO,KAAK,KAAKA,CAAK,EAAE;AAAA,EAE5B,GAMAH,EAAc,UAAU,MAAM,WAAW;AACvC,QAAI,KAAK,KAAI,MAAO;AAClB,YAAM,IAAI,MAAM,iBAAiB;AAEnC,WAAO,KAAK,KAAK,CAAC,EAAE;AAAA,EACtB,GAUAA,EAAc,UAAU,MAAM,SAASE,GAAKE,GAAU;AACpD,QAAIC,IAAa,KAAK;AAEtB,QADAH,IAAM,OAAOA,CAAG,GACZ,CAACJ,EAAE,IAAIO,GAAYH,CAAG,GAAG;AAC3B,UAAII,IAAM,KAAK,MACXH,IAAQG,EAAI;AAChB,aAAAD,EAAWH,CAAG,IAAIC,GAClBG,EAAI,KAAK,EAAC,KAAKJ,GAAK,UAAUE,EAAQ,CAAC,GACvC,KAAK,UAAUD,CAAK,GACb;AAAA,IACT;AACA,WAAO;AAAA,EACT,GAKAH,EAAc,UAAU,YAAY,WAAW;AAC7C,SAAK,MAAM,GAAG,KAAK,KAAK,SAAS,CAAC;AAClC,QAAIO,IAAM,KAAK,KAAK,IAAG;AACvB,kBAAO,KAAK,YAAYA,EAAI,GAAG,GAC/B,KAAK,SAAS,CAAC,GACRA,EAAI;AAAA,EACb,GASAP,EAAc,UAAU,WAAW,SAASE,GAAKE,GAAU;AACzD,QAAID,IAAQ,KAAK,YAAYD,CAAG;AAChC,QAAIE,IAAW,KAAK,KAAKD,CAAK,EAAE;AAC9B,YAAM,IAAI,MAAM,yDACFD,IAAM,WAAW,KAAK,KAAKC,CAAK,EAAE,WAAW,WAAWC,CAAQ;AAEhF,SAAK,KAAKD,CAAK,EAAE,WAAWC,GAC5B,KAAK,UAAUD,CAAK;AAAA,EACtB,GAEAH,EAAc,UAAU,WAAW,SAASQ,GAAG;AAC7C,QAAIF,IAAM,KAAK,MACXG,IAAI,IAAID,GACRE,IAAID,IAAI,GACRE,IAAUH;AACd,IAAIC,IAAIH,EAAI,WACVK,IAAUL,EAAIG,CAAC,EAAE,WAAWH,EAAIK,CAAO,EAAE,WAAWF,IAAIE,GACpDD,IAAIJ,EAAI,WACVK,IAAUL,EAAII,CAAC,EAAE,WAAWJ,EAAIK,CAAO,EAAE,WAAWD,IAAIC,IAEtDA,MAAYH,MACd,KAAK,MAAMA,GAAGG,CAAO,GACrB,KAAK,SAASA,CAAO;AAAA,EAG3B,GAEAX,EAAc,UAAU,YAAY,SAASG,GAAO;AAIlD,aAHIG,IAAM,KAAK,MACXF,IAAWE,EAAIH,CAAK,EAAE,UACtBS,GACGT,MAAU,MACfS,IAAST,KAAS,GACd,EAAAG,EAAIM,CAAM,EAAE,WAAWR;AAG3B,WAAK,MAAMD,GAAOS,CAAM,GACxBT,IAAQS;AAAA,EAEZ,GAEAZ,EAAc,UAAU,QAAQ,SAASQ,GAAGK,GAAG;AAC7C,QAAIP,IAAM,KAAK,MACXD,IAAa,KAAK,aAClBS,IAAWR,EAAIE,CAAC,GAChBO,IAAWT,EAAIO,CAAC;AACpB,IAAAP,EAAIE,CAAC,IAAIO,GACTT,EAAIO,CAAC,IAAIC,GACTT,EAAWU,EAAS,GAAG,IAAIP,GAC3BH,EAAWS,EAAS,GAAG,IAAID;AAAA,EAC7B,GACOlB;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/graph.js

@@ -0,0 +1,211 @@
+import { __require as E } from "./lodash.js";
+var p, m;
+function v() {
+  if (m) return p;
+  m = 1;
+  var i = E();
+  p = n;
+  var y = "\0", a = "\0", _ = "
";
+  function n(e) {
+    this._isDirected = i.has(e, "directed") ? e.directed : !0, this._isMultigraph = i.has(e, "multigraph") ? e.multigraph : !1, this._isCompound = i.has(e, "compound") ? e.compound : !1, this._label = void 0, this._defaultNodeLabelFn = i.constant(void 0), this._defaultEdgeLabelFn = i.constant(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[a] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
+  }
+  n.prototype._nodeCount = 0, n.prototype._edgeCount = 0, n.prototype.isDirected = function() {
+    return this._isDirected;
+  }, n.prototype.isMultigraph = function() {
+    return this._isMultigraph;
+  }, n.prototype.isCompound = function() {
+    return this._isCompound;
+  }, n.prototype.setGraph = function(e) {
+    return this._label = e, this;
+  }, n.prototype.graph = function() {
+    return this._label;
+  }, n.prototype.setDefaultNodeLabel = function(e) {
+    return i.isFunction(e) || (e = i.constant(e)), this._defaultNodeLabelFn = e, this;
+  }, n.prototype.nodeCount = function() {
+    return this._nodeCount;
+  }, n.prototype.nodes = function() {
+    return i.keys(this._nodes);
+  }, n.prototype.sources = function() {
+    var e = this;
+    return i.filter(this.nodes(), function(t) {
+      return i.isEmpty(e._in[t]);
+    });
+  }, n.prototype.sinks = function() {
+    var e = this;
+    return i.filter(this.nodes(), function(t) {
+      return i.isEmpty(e._out[t]);
+    });
+  }, n.prototype.setNodes = function(e, t) {
+    var s = arguments, r = this;
+    return i.each(e, function(h) {
+      s.length > 1 ? r.setNode(h, t) : r.setNode(h);
+    }), this;
+  }, n.prototype.setNode = function(e, t) {
+    return i.has(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = a, this._children[e] = {}, this._children[a][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+  }, n.prototype.node = function(e) {
+    return this._nodes[e];
+  }, n.prototype.hasNode = function(e) {
+    return i.has(this._nodes, e);
+  }, n.prototype.removeNode = function(e) {
+    var t = this;
+    if (i.has(this._nodes, e)) {
+      var s = function(r) {
+        t.removeEdge(t._edgeObjs[r]);
+      };
+      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], i.each(this.children(e), function(r) {
+        t.setParent(r);
+      }), delete this._children[e]), i.each(i.keys(this._in[e]), s), delete this._in[e], delete this._preds[e], i.each(i.keys(this._out[e]), s), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+    }
+    return this;
+  }, n.prototype.setParent = function(e, t) {
+    if (!this._isCompound)
+      throw new Error("Cannot set parent in a non-compound graph");
+    if (i.isUndefined(t))
+      t = a;
+    else {
+      t += "";
+      for (var s = t; !i.isUndefined(s); s = this.parent(s))
+        if (s === e)
+          throw new Error("Setting " + t + " as parent of " + e + " would create a cycle");
+      this.setNode(t);
+    }
+    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
+  }, n.prototype._removeFromParentsChildList = function(e) {
+    delete this._children[this._parent[e]][e];
+  }, n.prototype.parent = function(e) {
+    if (this._isCompound) {
+      var t = this._parent[e];
+      if (t !== a)
+        return t;
+    }
+  }, n.prototype.children = function(e) {
+    if (i.isUndefined(e) && (e = a), this._isCompound) {
+      var t = this._children[e];
+      if (t)
+        return i.keys(t);
+    } else {
+      if (e === a)
+        return this.nodes();
+      if (this.hasNode(e))
+        return [];
+    }
+  }, n.prototype.predecessors = function(e) {
+    var t = this._preds[e];
+    if (t)
+      return i.keys(t);
+  }, n.prototype.successors = function(e) {
+    var t = this._sucs[e];
+    if (t)
+      return i.keys(t);
+  }, n.prototype.neighbors = function(e) {
+    var t = this.predecessors(e);
+    if (t)
+      return i.union(t, this.successors(e));
+  }, n.prototype.isLeaf = function(e) {
+    var t;
+    return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), t.length === 0;
+  }, n.prototype.filterNodes = function(e) {
+    var t = new this.constructor({
+      directed: this._isDirected,
+      multigraph: this._isMultigraph,
+      compound: this._isCompound
+    });
+    t.setGraph(this.graph());
+    var s = this;
+    i.each(this._nodes, function(o, u) {
+      e(u) && t.setNode(u, o);
+    }), i.each(this._edgeObjs, function(o) {
+      t.hasNode(o.v) && t.hasNode(o.w) && t.setEdge(o, s.edge(o));
+    });
+    var r = {};
+    function h(o) {
+      var u = s.parent(o);
+      return u === void 0 || t.hasNode(u) ? (r[o] = u, u) : u in r ? r[u] : h(u);
+    }
+    return this._isCompound && i.each(t.nodes(), function(o) {
+      t.setParent(o, h(o));
+    }), t;
+  }, n.prototype.setDefaultEdgeLabel = function(e) {
+    return i.isFunction(e) || (e = i.constant(e)), this._defaultEdgeLabelFn = e, this;
+  }, n.prototype.edgeCount = function() {
+    return this._edgeCount;
+  }, n.prototype.edges = function() {
+    return i.values(this._edgeObjs);
+  }, n.prototype.setPath = function(e, t) {
+    var s = this, r = arguments;
+    return i.reduce(e, function(h, o) {
+      return r.length > 1 ? s.setEdge(h, o, t) : s.setEdge(h, o), o;
+    }), this;
+  }, n.prototype.setEdge = function() {
+    var e, t, s, r, h = !1, o = arguments[0];
+    typeof o == "object" && o !== null && "v" in o ? (e = o.v, t = o.w, s = o.name, arguments.length === 2 && (r = arguments[1], h = !0)) : (e = o, t = arguments[1], s = arguments[3], arguments.length > 2 && (r = arguments[2], h = !0)), e = "" + e, t = "" + t, i.isUndefined(s) || (s = "" + s);
+    var u = f(this._isDirected, e, t, s);
+    if (i.has(this._edgeLabels, u))
+      return h && (this._edgeLabels[u] = r), this;
+    if (!i.isUndefined(s) && !this._isMultigraph)
+      throw new Error("Cannot set a named edge when isMultigraph = false");
+    this.setNode(e), this.setNode(t), this._edgeLabels[u] = h ? r : this._defaultEdgeLabelFn(e, t, s);
+    var d = b(this._isDirected, e, t, s);
+    return e = d.v, t = d.w, Object.freeze(d), this._edgeObjs[u] = d, l(this._preds[t], e), l(this._sucs[e], t), this._in[t][u] = d, this._out[e][u] = d, this._edgeCount++, this;
+  }, n.prototype.edge = function(e, t, s) {
+    var r = arguments.length === 1 ? c(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s);
+    return this._edgeLabels[r];
+  }, n.prototype.hasEdge = function(e, t, s) {
+    var r = arguments.length === 1 ? c(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s);
+    return i.has(this._edgeLabels, r);
+  }, n.prototype.removeEdge = function(e, t, s) {
+    var r = arguments.length === 1 ? c(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s), h = this._edgeObjs[r];
+    return h && (e = h.v, t = h.w, delete this._edgeLabels[r], delete this._edgeObjs[r], g(this._preds[t], e), g(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--), this;
+  }, n.prototype.inEdges = function(e, t) {
+    var s = this._in[e];
+    if (s) {
+      var r = i.values(s);
+      return t ? i.filter(r, function(h) {
+        return h.v === t;
+      }) : r;
+    }
+  }, n.prototype.outEdges = function(e, t) {
+    var s = this._out[e];
+    if (s) {
+      var r = i.values(s);
+      return t ? i.filter(r, function(h) {
+        return h.w === t;
+      }) : r;
+    }
+  }, n.prototype.nodeEdges = function(e, t) {
+    var s = this.inEdges(e, t);
+    if (s)
+      return s.concat(this.outEdges(e, t));
+  };
+  function l(e, t) {
+    e[t] ? e[t]++ : e[t] = 1;
+  }
+  function g(e, t) {
+    --e[t] || delete e[t];
+  }
+  function f(e, t, s, r) {
+    var h = "" + t, o = "" + s;
+    if (!e && h > o) {
+      var u = h;
+      h = o, o = u;
+    }
+    return h + _ + o + _ + (i.isUndefined(r) ? y : r);
+  }
+  function b(e, t, s, r) {
+    var h = "" + t, o = "" + s;
+    if (!e && h > o) {
+      var u = h;
+      h = o, o = u;
+    }
+    var d = { v: h, w: o };
+    return r && (d.name = r), d;
+  }
+  function c(e, t) {
+    return f(e, t.v, t.w, t.name);
+  }
+  return p;
+}
+export {
+  v as __require
+};
+//# sourceMappingURL=graph.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/graph.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\n\nvar graph;\nvar hasRequiredGraph;\n\nfunction requireGraph () {\n\tif (hasRequiredGraph) return graph;\n\thasRequiredGraph = 1;\n\n\tvar _ = requireLodash();\n\n\tgraph = Graph;\n\n\tvar DEFAULT_EDGE_NAME = \"\\x00\";\n\tvar GRAPH_NODE = \"\\x00\";\n\tvar EDGE_KEY_DELIM = \"\\x01\";\n\n\t// Implementation notes:\n\t//\n\t//  * Node id query functions should return string ids for the nodes\n\t//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n\t//    composed of enough information to uniquely identify an edge: {v, w, name}.\n\t//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n\t//    reference edges. This is because we need a performant way to look these\n\t//    edges up and, object properties, which have string keys, are the closest\n\t//    we're going to get to a performant hashtable in JavaScript.\n\n\tfunction Graph(opts) {\n\t  this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n\t  this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n\t  this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n\t  // Label for the graph itself\n\t  this._label = undefined;\n\n\t  // Defaults to be set when creating a new node\n\t  this._defaultNodeLabelFn = _.constant(undefined);\n\n\t  // Defaults to be set when creating a new edge\n\t  this._defaultEdgeLabelFn = _.constant(undefined);\n\n\t  // v -> label\n\t  this._nodes = {};\n\n\t  if (this._isCompound) {\n\t    // v -> parent\n\t    this._parent = {};\n\n\t    // v -> children\n\t    this._children = {};\n\t    this._children[GRAPH_NODE] = {};\n\t  }\n\n\t  // v -> edgeObj\n\t  this._in = {};\n\n\t  // u -> v -> Number\n\t  this._preds = {};\n\n\t  // v -> edgeObj\n\t  this._out = {};\n\n\t  // v -> w -> Number\n\t  this._sucs = {};\n\n\t  // e -> edgeObj\n\t  this._edgeObjs = {};\n\n\t  // e -> label\n\t  this._edgeLabels = {};\n\t}\n\n\t/* Number of nodes in the graph. Should only be changed by the implementation. */\n\tGraph.prototype._nodeCount = 0;\n\n\t/* Number of edges in the graph. Should only be changed by the implementation. */\n\tGraph.prototype._edgeCount = 0;\n\n\n\t/* === Graph functions ========= */\n\n\tGraph.prototype.isDirected = function() {\n\t  return this._isDirected;\n\t};\n\n\tGraph.prototype.isMultigraph = function() {\n\t  return this._isMultigraph;\n\t};\n\n\tGraph.prototype.isCompound = function() {\n\t  return this._isCompound;\n\t};\n\n\tGraph.prototype.setGraph = function(label) {\n\t  this._label = label;\n\t  return this;\n\t};\n\n\tGraph.prototype.graph = function() {\n\t  return this._label;\n\t};\n\n\n\t/* === Node functions ========== */\n\n\tGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n\t  if (!_.isFunction(newDefault)) {\n\t    newDefault = _.constant(newDefault);\n\t  }\n\t  this._defaultNodeLabelFn = newDefault;\n\t  return this;\n\t};\n\n\tGraph.prototype.nodeCount = function() {\n\t  return this._nodeCount;\n\t};\n\n\tGraph.prototype.nodes = function() {\n\t  return _.keys(this._nodes);\n\t};\n\n\tGraph.prototype.sources = function() {\n\t  var self = this;\n\t  return _.filter(this.nodes(), function(v) {\n\t    return _.isEmpty(self._in[v]);\n\t  });\n\t};\n\n\tGraph.prototype.sinks = function() {\n\t  var self = this;\n\t  return _.filter(this.nodes(), function(v) {\n\t    return _.isEmpty(self._out[v]);\n\t  });\n\t};\n\n\tGraph.prototype.setNodes = function(vs, value) {\n\t  var args = arguments;\n\t  var self = this;\n\t  _.each(vs, function(v) {\n\t    if (args.length > 1) {\n\t      self.setNode(v, value);\n\t    } else {\n\t      self.setNode(v);\n\t    }\n\t  });\n\t  return this;\n\t};\n\n\tGraph.prototype.setNode = function(v, value) {\n\t  if (_.has(this._nodes, v)) {\n\t    if (arguments.length > 1) {\n\t      this._nodes[v] = value;\n\t    }\n\t    return this;\n\t  }\n\n\t  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n\t  if (this._isCompound) {\n\t    this._parent[v] = GRAPH_NODE;\n\t    this._children[v] = {};\n\t    this._children[GRAPH_NODE][v] = true;\n\t  }\n\t  this._in[v] = {};\n\t  this._preds[v] = {};\n\t  this._out[v] = {};\n\t  this._sucs[v] = {};\n\t  ++this._nodeCount;\n\t  return this;\n\t};\n\n\tGraph.prototype.node = function(v) {\n\t  return this._nodes[v];\n\t};\n\n\tGraph.prototype.hasNode = function(v) {\n\t  return _.has(this._nodes, v);\n\t};\n\n\tGraph.prototype.removeNode =  function(v) {\n\t  var self = this;\n\t  if (_.has(this._nodes, v)) {\n\t    var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n\t    delete this._nodes[v];\n\t    if (this._isCompound) {\n\t      this._removeFromParentsChildList(v);\n\t      delete this._parent[v];\n\t      _.each(this.children(v), function(child) {\n\t        self.setParent(child);\n\t      });\n\t      delete this._children[v];\n\t    }\n\t    _.each(_.keys(this._in[v]), removeEdge);\n\t    delete this._in[v];\n\t    delete this._preds[v];\n\t    _.each(_.keys(this._out[v]), removeEdge);\n\t    delete this._out[v];\n\t    delete this._sucs[v];\n\t    --this._nodeCount;\n\t  }\n\t  return this;\n\t};\n\n\tGraph.prototype.setParent = function(v, parent) {\n\t  if (!this._isCompound) {\n\t    throw new Error(\"Cannot set parent in a non-compound graph\");\n\t  }\n\n\t  if (_.isUndefined(parent)) {\n\t    parent = GRAPH_NODE;\n\t  } else {\n\t    // Coerce parent to string\n\t    parent += \"\";\n\t    for (var ancestor = parent;\n\t      !_.isUndefined(ancestor);\n\t      ancestor = this.parent(ancestor)) {\n\t      if (ancestor === v) {\n\t        throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n\t                        \" would create a cycle\");\n\t      }\n\t    }\n\n\t    this.setNode(parent);\n\t  }\n\n\t  this.setNode(v);\n\t  this._removeFromParentsChildList(v);\n\t  this._parent[v] = parent;\n\t  this._children[parent][v] = true;\n\t  return this;\n\t};\n\n\tGraph.prototype._removeFromParentsChildList = function(v) {\n\t  delete this._children[this._parent[v]][v];\n\t};\n\n\tGraph.prototype.parent = function(v) {\n\t  if (this._isCompound) {\n\t    var parent = this._parent[v];\n\t    if (parent !== GRAPH_NODE) {\n\t      return parent;\n\t    }\n\t  }\n\t};\n\n\tGraph.prototype.children = function(v) {\n\t  if (_.isUndefined(v)) {\n\t    v = GRAPH_NODE;\n\t  }\n\n\t  if (this._isCompound) {\n\t    var children = this._children[v];\n\t    if (children) {\n\t      return _.keys(children);\n\t    }\n\t  } else if (v === GRAPH_NODE) {\n\t    return this.nodes();\n\t  } else if (this.hasNode(v)) {\n\t    return [];\n\t  }\n\t};\n\n\tGraph.prototype.predecessors = function(v) {\n\t  var predsV = this._preds[v];\n\t  if (predsV) {\n\t    return _.keys(predsV);\n\t  }\n\t};\n\n\tGraph.prototype.successors = function(v) {\n\t  var sucsV = this._sucs[v];\n\t  if (sucsV) {\n\t    return _.keys(sucsV);\n\t  }\n\t};\n\n\tGraph.prototype.neighbors = function(v) {\n\t  var preds = this.predecessors(v);\n\t  if (preds) {\n\t    return _.union(preds, this.successors(v));\n\t  }\n\t};\n\n\tGraph.prototype.isLeaf = function (v) {\n\t  var neighbors;\n\t  if (this.isDirected()) {\n\t    neighbors = this.successors(v);\n\t  } else {\n\t    neighbors = this.neighbors(v);\n\t  }\n\t  return neighbors.length === 0;\n\t};\n\n\tGraph.prototype.filterNodes = function(filter) {\n\t  var copy = new this.constructor({\n\t    directed: this._isDirected,\n\t    multigraph: this._isMultigraph,\n\t    compound: this._isCompound\n\t  });\n\n\t  copy.setGraph(this.graph());\n\n\t  var self = this;\n\t  _.each(this._nodes, function(value, v) {\n\t    if (filter(v)) {\n\t      copy.setNode(v, value);\n\t    }\n\t  });\n\n\t  _.each(this._edgeObjs, function(e) {\n\t    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n\t      copy.setEdge(e, self.edge(e));\n\t    }\n\t  });\n\n\t  var parents = {};\n\t  function findParent(v) {\n\t    var parent = self.parent(v);\n\t    if (parent === undefined || copy.hasNode(parent)) {\n\t      parents[v] = parent;\n\t      return parent;\n\t    } else if (parent in parents) {\n\t      return parents[parent];\n\t    } else {\n\t      return findParent(parent);\n\t    }\n\t  }\n\n\t  if (this._isCompound) {\n\t    _.each(copy.nodes(), function(v) {\n\t      copy.setParent(v, findParent(v));\n\t    });\n\t  }\n\n\t  return copy;\n\t};\n\n\t/* === Edge functions ========== */\n\n\tGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n\t  if (!_.isFunction(newDefault)) {\n\t    newDefault = _.constant(newDefault);\n\t  }\n\t  this._defaultEdgeLabelFn = newDefault;\n\t  return this;\n\t};\n\n\tGraph.prototype.edgeCount = function() {\n\t  return this._edgeCount;\n\t};\n\n\tGraph.prototype.edges = function() {\n\t  return _.values(this._edgeObjs);\n\t};\n\n\tGraph.prototype.setPath = function(vs, value) {\n\t  var self = this;\n\t  var args = arguments;\n\t  _.reduce(vs, function(v, w) {\n\t    if (args.length > 1) {\n\t      self.setEdge(v, w, value);\n\t    } else {\n\t      self.setEdge(v, w);\n\t    }\n\t    return w;\n\t  });\n\t  return this;\n\t};\n\n\t/*\n\t * setEdge(v, w, [value, [name]])\n\t * setEdge({ v, w, [name] }, [value])\n\t */\n\tGraph.prototype.setEdge = function() {\n\t  var v, w, name, value;\n\t  var valueSpecified = false;\n\t  var arg0 = arguments[0];\n\n\t  if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n\t    v = arg0.v;\n\t    w = arg0.w;\n\t    name = arg0.name;\n\t    if (arguments.length === 2) {\n\t      value = arguments[1];\n\t      valueSpecified = true;\n\t    }\n\t  } else {\n\t    v = arg0;\n\t    w = arguments[1];\n\t    name = arguments[3];\n\t    if (arguments.length > 2) {\n\t      value = arguments[2];\n\t      valueSpecified = true;\n\t    }\n\t  }\n\n\t  v = \"\" + v;\n\t  w = \"\" + w;\n\t  if (!_.isUndefined(name)) {\n\t    name = \"\" + name;\n\t  }\n\n\t  var e = edgeArgsToId(this._isDirected, v, w, name);\n\t  if (_.has(this._edgeLabels, e)) {\n\t    if (valueSpecified) {\n\t      this._edgeLabels[e] = value;\n\t    }\n\t    return this;\n\t  }\n\n\t  if (!_.isUndefined(name) && !this._isMultigraph) {\n\t    throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n\t  }\n\n\t  // It didn't exist, so we need to create it.\n\t  // First ensure the nodes exist.\n\t  this.setNode(v);\n\t  this.setNode(w);\n\n\t  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n\t  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n\t  // Ensure we add undirected edges in a consistent way.\n\t  v = edgeObj.v;\n\t  w = edgeObj.w;\n\n\t  Object.freeze(edgeObj);\n\t  this._edgeObjs[e] = edgeObj;\n\t  incrementOrInitEntry(this._preds[w], v);\n\t  incrementOrInitEntry(this._sucs[v], w);\n\t  this._in[w][e] = edgeObj;\n\t  this._out[v][e] = edgeObj;\n\t  this._edgeCount++;\n\t  return this;\n\t};\n\n\tGraph.prototype.edge = function(v, w, name) {\n\t  var e = (arguments.length === 1\n\t    ? edgeObjToId(this._isDirected, arguments[0])\n\t    : edgeArgsToId(this._isDirected, v, w, name));\n\t  return this._edgeLabels[e];\n\t};\n\n\tGraph.prototype.hasEdge = function(v, w, name) {\n\t  var e = (arguments.length === 1\n\t    ? edgeObjToId(this._isDirected, arguments[0])\n\t    : edgeArgsToId(this._isDirected, v, w, name));\n\t  return _.has(this._edgeLabels, e);\n\t};\n\n\tGraph.prototype.removeEdge = function(v, w, name) {\n\t  var e = (arguments.length === 1\n\t    ? edgeObjToId(this._isDirected, arguments[0])\n\t    : edgeArgsToId(this._isDirected, v, w, name));\n\t  var edge = this._edgeObjs[e];\n\t  if (edge) {\n\t    v = edge.v;\n\t    w = edge.w;\n\t    delete this._edgeLabels[e];\n\t    delete this._edgeObjs[e];\n\t    decrementOrRemoveEntry(this._preds[w], v);\n\t    decrementOrRemoveEntry(this._sucs[v], w);\n\t    delete this._in[w][e];\n\t    delete this._out[v][e];\n\t    this._edgeCount--;\n\t  }\n\t  return this;\n\t};\n\n\tGraph.prototype.inEdges = function(v, u) {\n\t  var inV = this._in[v];\n\t  if (inV) {\n\t    var edges = _.values(inV);\n\t    if (!u) {\n\t      return edges;\n\t    }\n\t    return _.filter(edges, function(edge) { return edge.v === u; });\n\t  }\n\t};\n\n\tGraph.prototype.outEdges = function(v, w) {\n\t  var outV = this._out[v];\n\t  if (outV) {\n\t    var edges = _.values(outV);\n\t    if (!w) {\n\t      return edges;\n\t    }\n\t    return _.filter(edges, function(edge) { return edge.w === w; });\n\t  }\n\t};\n\n\tGraph.prototype.nodeEdges = function(v, w) {\n\t  var inEdges = this.inEdges(v, w);\n\t  if (inEdges) {\n\t    return inEdges.concat(this.outEdges(v, w));\n\t  }\n\t};\n\n\tfunction incrementOrInitEntry(map, k) {\n\t  if (map[k]) {\n\t    map[k]++;\n\t  } else {\n\t    map[k] = 1;\n\t  }\n\t}\n\n\tfunction decrementOrRemoveEntry(map, k) {\n\t  if (!--map[k]) { delete map[k]; }\n\t}\n\n\tfunction edgeArgsToId(isDirected, v_, w_, name) {\n\t  var v = \"\" + v_;\n\t  var w = \"\" + w_;\n\t  if (!isDirected && v > w) {\n\t    var tmp = v;\n\t    v = w;\n\t    w = tmp;\n\t  }\n\t  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n\t             (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n\t}\n\n\tfunction edgeArgsToObj(isDirected, v_, w_, name) {\n\t  var v = \"\" + v_;\n\t  var w = \"\" + w_;\n\t  if (!isDirected && v > w) {\n\t    var tmp = v;\n\t    v = w;\n\t    w = tmp;\n\t  }\n\t  var edgeObj =  { v: v, w: w };\n\t  if (name) {\n\t    edgeObj.name = name;\n\t  }\n\t  return edgeObj;\n\t}\n\n\tfunction edgeObjToId(isDirected, edgeObj) {\n\t  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n\t}\n\treturn graph;\n}\n\nexport { requireGraph as __require };\n//# sourceMappingURL=graph.js.map\n"],"names":["graph","hasRequiredGraph","requireGraph","_","requireLodash","Graph","DEFAULT_EDGE_NAME","GRAPH_NODE","EDGE_KEY_DELIM","opts","label","newDefault","self","v","vs","value","args","removeEdge","e","child","parent","ancestor","children","predsV","sucsV","preds","neighbors","filter","copy","parents","findParent","w","name","valueSpecified","arg0","edgeArgsToId","edgeObj","edgeArgsToObj","incrementOrInitEntry","edgeObjToId","edge","decrementOrRemoveEntry","u","inV","edges","outV","inEdges","map","k","isDirected","v_","w_","tmp"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAgB;AACxB,MAAID,EAAkB,QAAOD;AAC7B,EAAAC,IAAmB;AAEnB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAQK;AAER,MAAIC,IAAoB,MACpBC,IAAa,MACbC,IAAiB;AAYrB,WAASH,EAAMI,GAAM;AACnB,SAAK,cAAcN,EAAE,IAAIM,GAAM,UAAU,IAAIA,EAAK,WAAW,IAC7D,KAAK,gBAAgBN,EAAE,IAAIM,GAAM,YAAY,IAAIA,EAAK,aAAa,IACnE,KAAK,cAAcN,EAAE,IAAIM,GAAM,UAAU,IAAIA,EAAK,WAAW,IAG7D,KAAK,SAAS,QAGd,KAAK,sBAAsBN,EAAE,SAAS,MAAS,GAG/C,KAAK,sBAAsBA,EAAE,SAAS,MAAS,GAG/C,KAAK,SAAS,CAAA,GAEV,KAAK,gBAEP,KAAK,UAAU,CAAA,GAGf,KAAK,YAAY,CAAA,GACjB,KAAK,UAAUI,CAAU,IAAI,CAAA,IAI/B,KAAK,MAAM,CAAA,GAGX,KAAK,SAAS,CAAA,GAGd,KAAK,OAAO,CAAA,GAGZ,KAAK,QAAQ,CAAA,GAGb,KAAK,YAAY,CAAA,GAGjB,KAAK,cAAc,CAAA;AAAA,EACrB;AAGA,EAAAF,EAAM,UAAU,aAAa,GAG7BA,EAAM,UAAU,aAAa,GAK7BA,EAAM,UAAU,aAAa,WAAW;AACtC,WAAO,KAAK;AAAA,EACd,GAEAA,EAAM,UAAU,eAAe,WAAW;AACxC,WAAO,KAAK;AAAA,EACd,GAEAA,EAAM,UAAU,aAAa,WAAW;AACtC,WAAO,KAAK;AAAA,EACd,GAEAA,EAAM,UAAU,WAAW,SAASK,GAAO;AACzC,gBAAK,SAASA,GACP;AAAA,EACT,GAEAL,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAO,KAAK;AAAA,EACd,GAKAA,EAAM,UAAU,sBAAsB,SAASM,GAAY;AACzD,WAAKR,EAAE,WAAWQ,CAAU,MAC1BA,IAAaR,EAAE,SAASQ,CAAU,IAEpC,KAAK,sBAAsBA,GACpB;AAAA,EACT,GAEAN,EAAM,UAAU,YAAY,WAAW;AACrC,WAAO,KAAK;AAAA,EACd,GAEAA,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAOF,EAAE,KAAK,KAAK,MAAM;AAAA,EAC3B,GAEAE,EAAM,UAAU,UAAU,WAAW;AACnC,QAAIO,IAAO;AACX,WAAOT,EAAE,OAAO,KAAK,MAAK,GAAI,SAASU,GAAG;AACxC,aAAOV,EAAE,QAAQS,EAAK,IAAIC,CAAC,CAAC;AAAA,IAC9B,CAAC;AAAA,EACH,GAEAR,EAAM,UAAU,QAAQ,WAAW;AACjC,QAAIO,IAAO;AACX,WAAOT,EAAE,OAAO,KAAK,MAAK,GAAI,SAASU,GAAG;AACxC,aAAOV,EAAE,QAAQS,EAAK,KAAKC,CAAC,CAAC;AAAA,IAC/B,CAAC;AAAA,EACH,GAEAR,EAAM,UAAU,WAAW,SAASS,GAAIC,GAAO;AAC7C,QAAIC,IAAO,WACPJ,IAAO;AACX,WAAAT,EAAE,KAAKW,GAAI,SAASD,GAAG;AACrB,MAAIG,EAAK,SAAS,IAChBJ,EAAK,QAAQC,GAAGE,CAAK,IAErBH,EAAK,QAAQC,CAAC;AAAA,IAElB,CAAC,GACM;AAAA,EACT,GAEAR,EAAM,UAAU,UAAU,SAASQ,GAAGE,GAAO;AAC3C,WAAIZ,EAAE,IAAI,KAAK,QAAQU,CAAC,KAClB,UAAU,SAAS,MACrB,KAAK,OAAOA,CAAC,IAAIE,IAEZ,SAGT,KAAK,OAAOF,CAAC,IAAI,UAAU,SAAS,IAAIE,IAAQ,KAAK,oBAAoBF,CAAC,GACtE,KAAK,gBACP,KAAK,QAAQA,CAAC,IAAIN,GAClB,KAAK,UAAUM,CAAC,IAAI,CAAA,GACpB,KAAK,UAAUN,CAAU,EAAEM,CAAC,IAAI,KAElC,KAAK,IAAIA,CAAC,IAAI,CAAA,GACd,KAAK,OAAOA,CAAC,IAAI,CAAA,GACjB,KAAK,KAAKA,CAAC,IAAI,CAAA,GACf,KAAK,MAAMA,CAAC,IAAI,CAAA,GAChB,EAAE,KAAK,YACA;AAAA,EACT,GAEAR,EAAM,UAAU,OAAO,SAASQ,GAAG;AACjC,WAAO,KAAK,OAAOA,CAAC;AAAA,EACtB,GAEAR,EAAM,UAAU,UAAU,SAASQ,GAAG;AACpC,WAAOV,EAAE,IAAI,KAAK,QAAQU,CAAC;AAAA,EAC7B,GAEAR,EAAM,UAAU,aAAc,SAASQ,GAAG;AACxC,QAAID,IAAO;AACX,QAAIT,EAAE,IAAI,KAAK,QAAQU,CAAC,GAAG;AACzB,UAAII,IAAa,SAASC,GAAG;AAAE,QAAAN,EAAK,WAAWA,EAAK,UAAUM,CAAC,CAAC;AAAA,MAAG;AACnE,aAAO,KAAK,OAAOL,CAAC,GAChB,KAAK,gBACP,KAAK,4BAA4BA,CAAC,GAClC,OAAO,KAAK,QAAQA,CAAC,GACrBV,EAAE,KAAK,KAAK,SAASU,CAAC,GAAG,SAASM,GAAO;AACvC,QAAAP,EAAK,UAAUO,CAAK;AAAA,MACtB,CAAC,GACD,OAAO,KAAK,UAAUN,CAAC,IAEzBV,EAAE,KAAKA,EAAE,KAAK,KAAK,IAAIU,CAAC,CAAC,GAAGI,CAAU,GACtC,OAAO,KAAK,IAAIJ,CAAC,GACjB,OAAO,KAAK,OAAOA,CAAC,GACpBV,EAAE,KAAKA,EAAE,KAAK,KAAK,KAAKU,CAAC,CAAC,GAAGI,CAAU,GACvC,OAAO,KAAK,KAAKJ,CAAC,GAClB,OAAO,KAAK,MAAMA,CAAC,GACnB,EAAE,KAAK;AAAA,IACT;AACA,WAAO;AAAA,EACT,GAEAR,EAAM,UAAU,YAAY,SAASQ,GAAGO,GAAQ;AAC9C,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,2CAA2C;AAG7D,QAAIjB,EAAE,YAAYiB,CAAM;AACtB,MAAAA,IAASb;AAAA,SACJ;AAEL,MAAAa,KAAU;AACV,eAASC,IAAWD,GAClB,CAACjB,EAAE,YAAYkB,CAAQ,GACvBA,IAAW,KAAK,OAAOA,CAAQ;AAC/B,YAAIA,MAAaR;AACf,gBAAM,IAAI,MAAM,aAAaO,IAAQ,mBAAmBP,IACxC,uBAAuB;AAI3C,WAAK,QAAQO,CAAM;AAAA,IACrB;AAEA,gBAAK,QAAQP,CAAC,GACd,KAAK,4BAA4BA,CAAC,GAClC,KAAK,QAAQA,CAAC,IAAIO,GAClB,KAAK,UAAUA,CAAM,EAAEP,CAAC,IAAI,IACrB;AAAA,EACT,GAEAR,EAAM,UAAU,8BAA8B,SAASQ,GAAG;AACxD,WAAO,KAAK,UAAU,KAAK,QAAQA,CAAC,CAAC,EAAEA,CAAC;AAAA,EAC1C,GAEAR,EAAM,UAAU,SAAS,SAASQ,GAAG;AACnC,QAAI,KAAK,aAAa;AACpB,UAAIO,IAAS,KAAK,QAAQP,CAAC;AAC3B,UAAIO,MAAWb;AACb,eAAOa;AAAA,IAEX;AAAA,EACF,GAEAf,EAAM,UAAU,WAAW,SAASQ,GAAG;AAKrC,QAJIV,EAAE,YAAYU,CAAC,MACjBA,IAAIN,IAGF,KAAK,aAAa;AACpB,UAAIe,IAAW,KAAK,UAAUT,CAAC;AAC/B,UAAIS;AACF,eAAOnB,EAAE,KAAKmB,CAAQ;AAAA,IAE1B,OAAO;AAAA,UAAIT,MAAMN;AACf,eAAO,KAAK,MAAK;AACZ,UAAI,KAAK,QAAQM,CAAC;AACvB,eAAO,CAAA;AAAA;AAAA,EAEX,GAEAR,EAAM,UAAU,eAAe,SAASQ,GAAG;AACzC,QAAIU,IAAS,KAAK,OAAOV,CAAC;AAC1B,QAAIU;AACF,aAAOpB,EAAE,KAAKoB,CAAM;AAAA,EAExB,GAEAlB,EAAM,UAAU,aAAa,SAASQ,GAAG;AACvC,QAAIW,IAAQ,KAAK,MAAMX,CAAC;AACxB,QAAIW;AACF,aAAOrB,EAAE,KAAKqB,CAAK;AAAA,EAEvB,GAEAnB,EAAM,UAAU,YAAY,SAASQ,GAAG;AACtC,QAAIY,IAAQ,KAAK,aAAaZ,CAAC;AAC/B,QAAIY;AACF,aAAOtB,EAAE,MAAMsB,GAAO,KAAK,WAAWZ,CAAC,CAAC;AAAA,EAE5C,GAEAR,EAAM,UAAU,SAAS,SAAUQ,GAAG;AACpC,QAAIa;AACJ,WAAI,KAAK,eACPA,IAAY,KAAK,WAAWb,CAAC,IAE7Ba,IAAY,KAAK,UAAUb,CAAC,GAEvBa,EAAU,WAAW;AAAA,EAC9B,GAEArB,EAAM,UAAU,cAAc,SAASsB,GAAQ;AAC7C,QAAIC,IAAO,IAAI,KAAK,YAAY;AAAA,MAC9B,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,IACpB,CAAI;AAED,IAAAA,EAAK,SAAS,KAAK,OAAO;AAE1B,QAAIhB,IAAO;AACX,IAAAT,EAAE,KAAK,KAAK,QAAQ,SAASY,GAAOF,GAAG;AACrC,MAAIc,EAAOd,CAAC,KACVe,EAAK,QAAQf,GAAGE,CAAK;AAAA,IAEzB,CAAC,GAEDZ,EAAE,KAAK,KAAK,WAAW,SAASe,GAAG;AACjC,MAAIU,EAAK,QAAQV,EAAE,CAAC,KAAKU,EAAK,QAAQV,EAAE,CAAC,KACvCU,EAAK,QAAQV,GAAGN,EAAK,KAAKM,CAAC,CAAC;AAAA,IAEhC,CAAC;AAED,QAAIW,IAAU,CAAA;AACd,aAASC,EAAWjB,GAAG;AACrB,UAAIO,IAASR,EAAK,OAAOC,CAAC;AAC1B,aAAIO,MAAW,UAAaQ,EAAK,QAAQR,CAAM,KAC7CS,EAAQhB,CAAC,IAAIO,GACNA,KACEA,KAAUS,IACZA,EAAQT,CAAM,IAEdU,EAAWV,CAAM;AAAA,IAE5B;AAEA,WAAI,KAAK,eACPjB,EAAE,KAAKyB,EAAK,MAAK,GAAI,SAASf,GAAG;AAC/B,MAAAe,EAAK,UAAUf,GAAGiB,EAAWjB,CAAC,CAAC;AAAA,IACjC,CAAC,GAGIe;AAAA,EACT,GAIAvB,EAAM,UAAU,sBAAsB,SAASM,GAAY;AACzD,WAAKR,EAAE,WAAWQ,CAAU,MAC1BA,IAAaR,EAAE,SAASQ,CAAU,IAEpC,KAAK,sBAAsBA,GACpB;AAAA,EACT,GAEAN,EAAM,UAAU,YAAY,WAAW;AACrC,WAAO,KAAK;AAAA,EACd,GAEAA,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAOF,EAAE,OAAO,KAAK,SAAS;AAAA,EAChC,GAEAE,EAAM,UAAU,UAAU,SAASS,GAAIC,GAAO;AAC5C,QAAIH,IAAO,MACPI,IAAO;AACX,WAAAb,EAAE,OAAOW,GAAI,SAASD,GAAGkB,GAAG;AAC1B,aAAIf,EAAK,SAAS,IAChBJ,EAAK,QAAQC,GAAGkB,GAAGhB,CAAK,IAExBH,EAAK,QAAQC,GAAGkB,CAAC,GAEZA;AAAA,IACT,CAAC,GACM;AAAA,EACT,GAMA1B,EAAM,UAAU,UAAU,WAAW;AACnC,QAAIQ,GAAGkB,GAAGC,GAAMjB,GACZkB,IAAiB,IACjBC,IAAO,UAAU,CAAC;AAEtB,IAAI,OAAOA,KAAS,YAAYA,MAAS,QAAQ,OAAOA,KACtDrB,IAAIqB,EAAK,GACTH,IAAIG,EAAK,GACTF,IAAOE,EAAK,MACR,UAAU,WAAW,MACvBnB,IAAQ,UAAU,CAAC,GACnBkB,IAAiB,QAGnBpB,IAAIqB,GACJH,IAAI,UAAU,CAAC,GACfC,IAAO,UAAU,CAAC,GACd,UAAU,SAAS,MACrBjB,IAAQ,UAAU,CAAC,GACnBkB,IAAiB,MAIrBpB,IAAI,KAAKA,GACTkB,IAAI,KAAKA,GACJ5B,EAAE,YAAY6B,CAAI,MACrBA,IAAO,KAAKA;AAGd,QAAId,IAAIiB,EAAa,KAAK,aAAatB,GAAGkB,GAAGC,CAAI;AACjD,QAAI7B,EAAE,IAAI,KAAK,aAAae,CAAC;AAC3B,aAAIe,MACF,KAAK,YAAYf,CAAC,IAAIH,IAEjB;AAGT,QAAI,CAACZ,EAAE,YAAY6B,CAAI,KAAK,CAAC,KAAK;AAChC,YAAM,IAAI,MAAM,mDAAmD;AAKrE,SAAK,QAAQnB,CAAC,GACd,KAAK,QAAQkB,CAAC,GAEd,KAAK,YAAYb,CAAC,IAAIe,IAAiBlB,IAAQ,KAAK,oBAAoBF,GAAGkB,GAAGC,CAAI;AAElF,QAAII,IAAUC,EAAc,KAAK,aAAaxB,GAAGkB,GAAGC,CAAI;AAExD,WAAAnB,IAAIuB,EAAQ,GACZL,IAAIK,EAAQ,GAEZ,OAAO,OAAOA,CAAO,GACrB,KAAK,UAAUlB,CAAC,IAAIkB,GACpBE,EAAqB,KAAK,OAAOP,CAAC,GAAGlB,CAAC,GACtCyB,EAAqB,KAAK,MAAMzB,CAAC,GAAGkB,CAAC,GACrC,KAAK,IAAIA,CAAC,EAAEb,CAAC,IAAIkB,GACjB,KAAK,KAAKvB,CAAC,EAAEK,CAAC,IAAIkB,GAClB,KAAK,cACE;AAAA,EACT,GAEA/B,EAAM,UAAU,OAAO,SAASQ,GAAGkB,GAAGC,GAAM;AAC1C,QAAId,IAAK,UAAU,WAAW,IAC1BqB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAatB,GAAGkB,GAAGC,CAAI;AAC7C,WAAO,KAAK,YAAYd,CAAC;AAAA,EAC3B,GAEAb,EAAM,UAAU,UAAU,SAASQ,GAAGkB,GAAGC,GAAM;AAC7C,QAAId,IAAK,UAAU,WAAW,IAC1BqB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAatB,GAAGkB,GAAGC,CAAI;AAC7C,WAAO7B,EAAE,IAAI,KAAK,aAAae,CAAC;AAAA,EAClC,GAEAb,EAAM,UAAU,aAAa,SAASQ,GAAGkB,GAAGC,GAAM;AAChD,QAAId,IAAK,UAAU,WAAW,IAC1BqB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAatB,GAAGkB,GAAGC,CAAI,GACzCQ,IAAO,KAAK,UAAUtB,CAAC;AAC3B,WAAIsB,MACF3B,IAAI2B,EAAK,GACTT,IAAIS,EAAK,GACT,OAAO,KAAK,YAAYtB,CAAC,GACzB,OAAO,KAAK,UAAUA,CAAC,GACvBuB,EAAuB,KAAK,OAAOV,CAAC,GAAGlB,CAAC,GACxC4B,EAAuB,KAAK,MAAM5B,CAAC,GAAGkB,CAAC,GACvC,OAAO,KAAK,IAAIA,CAAC,EAAEb,CAAC,GACpB,OAAO,KAAK,KAAKL,CAAC,EAAEK,CAAC,GACrB,KAAK,eAEA;AAAA,EACT,GAEAb,EAAM,UAAU,UAAU,SAASQ,GAAG6B,GAAG;AACvC,QAAIC,IAAM,KAAK,IAAI9B,CAAC;AACpB,QAAI8B,GAAK;AACP,UAAIC,IAAQzC,EAAE,OAAOwC,CAAG;AACxB,aAAKD,IAGEvC,EAAE,OAAOyC,GAAO,SAASJ,GAAM;AAAE,eAAOA,EAAK,MAAME;AAAA,MAAG,CAAC,IAFrDE;AAAA,IAGX;AAAA,EACF,GAEAvC,EAAM,UAAU,WAAW,SAASQ,GAAGkB,GAAG;AACxC,QAAIc,IAAO,KAAK,KAAKhC,CAAC;AACtB,QAAIgC,GAAM;AACR,UAAID,IAAQzC,EAAE,OAAO0C,CAAI;AACzB,aAAKd,IAGE5B,EAAE,OAAOyC,GAAO,SAASJ,GAAM;AAAE,eAAOA,EAAK,MAAMT;AAAA,MAAG,CAAC,IAFrDa;AAAA,IAGX;AAAA,EACF,GAEAvC,EAAM,UAAU,YAAY,SAASQ,GAAGkB,GAAG;AACzC,QAAIe,IAAU,KAAK,QAAQjC,GAAGkB,CAAC;AAC/B,QAAIe;AACF,aAAOA,EAAQ,OAAO,KAAK,SAASjC,GAAGkB,CAAC,CAAC;AAAA,EAE7C;AAEA,WAASO,EAAqBS,GAAKC,GAAG;AACpC,IAAID,EAAIC,CAAC,IACPD,EAAIC,CAAC,MAELD,EAAIC,CAAC,IAAI;AAAA,EAEb;AAEA,WAASP,EAAuBM,GAAKC,GAAG;AACtC,IAAK,EAAED,EAAIC,CAAC,KAAK,OAAOD,EAAIC,CAAC;AAAA,EAC/B;AAEA,WAASb,EAAac,GAAYC,GAAIC,GAAInB,GAAM;AAC9C,QAAInB,IAAI,KAAKqC,GACTnB,IAAI,KAAKoB;AACb,QAAI,CAACF,KAAcpC,IAAIkB,GAAG;AACxB,UAAIqB,IAAMvC;AACV,MAAAA,IAAIkB,GACJA,IAAIqB;AAAA,IACN;AACA,WAAOvC,IAAIL,IAAiBuB,IAAIvB,KACpBL,EAAE,YAAY6B,CAAI,IAAI1B,IAAoB0B;AAAA,EACxD;AAEA,WAASK,EAAcY,GAAYC,GAAIC,GAAInB,GAAM;AAC/C,QAAInB,IAAI,KAAKqC,GACTnB,IAAI,KAAKoB;AACb,QAAI,CAACF,KAAcpC,IAAIkB,GAAG;AACxB,UAAIqB,IAAMvC;AACV,MAAAA,IAAIkB,GACJA,IAAIqB;AAAA,IACN;AACA,QAAIhB,IAAW,EAAE,GAAGvB,GAAG,GAAGkB,EAAC;AAC3B,WAAIC,MACFI,EAAQ,OAAOJ,IAEVI;AAAA,EACT;AAEA,WAASG,EAAYU,GAAYb,GAAS;AACxC,WAAOD,EAAac,GAAYb,EAAQ,GAAGA,EAAQ,GAAGA,EAAQ,IAAI;AAAA,EACpE;AACA,SAAOpC;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/index.js

@@ -0,0 +1,13 @@
+import { __require as i } from "./graph.js";
+import { __require as u } from "./version.js";
+var r, e;
+function q() {
+  return e || (e = 1, r = {
+    Graph: i(),
+    version: u()
+  }), r;
+}
+export {
+  q as __require
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/index.js"],"sourcesContent":["import { __require as requireGraph } from './graph.js';\nimport { __require as requireVersion } from './version.js';\n\nvar lib;\nvar hasRequiredLib;\n\nfunction requireLib () {\n\tif (hasRequiredLib) return lib;\n\thasRequiredLib = 1;\n\t// Includes only the \"core\" of graphlib\n\tlib = {\n\t  Graph: requireGraph(),\n\t  version: requireVersion()\n\t};\n\treturn lib;\n}\n\nexport { requireLib as __require };\n//# sourceMappingURL=index.js.map\n"],"names":["lib","hasRequiredLib","requireLib","requireGraph","requireVersion"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAAc;AACtB,SAAID,MACJA,IAAiB,GAEjBD,IAAM;AAAA,IACJ,OAAOG,EAAY;AAAA,IACnB,SAASC,EAAc;AAAA,EAC1B,IACQJ;AACR;","x_google_ignoreList":[0]}