@seed-ship/mcp-ui-solid 5.7.0 → 6.1.0

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra.js

@@ -0,0 +1,60 @@
+import { __require as requireLodash$1 } from "../lodash.js";
+import { __require as requirePriorityQueue } from "../data/priority-queue.js";
+var dijkstra_1;
+var hasRequiredDijkstra;
+function requireDijkstra() {
+  if (hasRequiredDijkstra) return dijkstra_1;
+  hasRequiredDijkstra = 1;
+  var _ = requireLodash$1();
+  var PriorityQueue = requirePriorityQueue();
+  dijkstra_1 = dijkstra;
+  var DEFAULT_WEIGHT_FUNC = _.constant(1);
+  function dijkstra(g, source, weightFn, edgeFn) {
+    return runDijkstra(
+      g,
+      String(source),
+      weightFn || DEFAULT_WEIGHT_FUNC,
+      edgeFn || function(v) {
+        return g.outEdges(v);
+      }
+    );
+  }
+  function runDijkstra(g, source, weightFn, edgeFn) {
+    var results = {};
+    var pq = new PriorityQueue();
+    var v, vEntry;
+    var updateNeighbors = function(edge) {
+      var w = edge.v !== v ? edge.v : edge.w;
+      var wEntry = results[w];
+      var weight = weightFn(edge);
+      var distance = vEntry.distance + weight;
+      if (weight < 0) {
+        throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + edge + " Weight: " + weight);
+      }
+      if (distance < wEntry.distance) {
+        wEntry.distance = distance;
+        wEntry.predecessor = v;
+        pq.decrease(w, distance);
+      }
+    };
+    g.nodes().forEach(function(v2) {
+      var distance = v2 === source ? 0 : Number.POSITIVE_INFINITY;
+      results[v2] = { distance };
+      pq.add(v2, distance);
+    });
+    while (pq.size() > 0) {
+      v = pq.removeMin();
+      vEntry = results[v];
+      if (vEntry.distance === Number.POSITIVE_INFINITY) {
+        break;
+      }
+      edgeFn(v).forEach(updateNeighbors);
+    }
+    return results;
+  }
+  return dijkstra_1;
+}
+export {
+  requireDijkstra as __require
+};
+//# sourceMappingURL=dijkstra.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requirePriorityQueue } from '../data/priority-queue.js';\n\nvar dijkstra_1;\nvar hasRequiredDijkstra;\n\nfunction requireDijkstra () {\n\tif (hasRequiredDijkstra) return dijkstra_1;\n\thasRequiredDijkstra = 1;\n\tvar _ = requireLodash();\n\tvar PriorityQueue = requirePriorityQueue();\n\n\tdijkstra_1 = dijkstra;\n\n\tvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\n\tfunction dijkstra(g, source, weightFn, edgeFn) {\n\t  return runDijkstra(g, String(source),\n\t    weightFn || DEFAULT_WEIGHT_FUNC,\n\t    edgeFn || function(v) { return g.outEdges(v); });\n\t}\n\n\tfunction runDijkstra(g, source, weightFn, edgeFn) {\n\t  var results = {};\n\t  var pq = new PriorityQueue();\n\t  var v, vEntry;\n\n\t  var updateNeighbors = function(edge) {\n\t    var w = edge.v !== v ? edge.v : edge.w;\n\t    var wEntry = results[w];\n\t    var weight = weightFn(edge);\n\t    var distance = vEntry.distance + weight;\n\n\t    if (weight < 0) {\n\t      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n\t                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n\t    }\n\n\t    if (distance < wEntry.distance) {\n\t      wEntry.distance = distance;\n\t      wEntry.predecessor = v;\n\t      pq.decrease(w, distance);\n\t    }\n\t  };\n\n\t  g.nodes().forEach(function(v) {\n\t    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n\t    results[v] = { distance: distance };\n\t    pq.add(v, distance);\n\t  });\n\n\t  while (pq.size() > 0) {\n\t    v = pq.removeMin();\n\t    vEntry = results[v];\n\t    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n\t      break;\n\t    }\n\n\t    edgeFn(v).forEach(updateNeighbors);\n\t  }\n\n\t  return results;\n\t}\n\treturn dijkstra_1;\n}\n\nexport { requireDijkstra as __require };\n//# sourceMappingURL=dijkstra.js.map\n"],"names":["requireLodash","v"],"mappings":";;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,kBAAmB;AAC3B,MAAI,oBAAqB,QAAO;AAChC,wBAAsB;AACtB,MAAI,IAAIA,gBAAa;AACrB,MAAI,gBAAgB,qBAAoB;AAExC,eAAa;AAEb,MAAI,sBAAsB,EAAE,SAAS,CAAC;AAEtC,WAAS,SAAS,GAAG,QAAQ,UAAU,QAAQ;AAC7C,WAAO;AAAA,MAAY;AAAA,MAAG,OAAO,MAAM;AAAA,MACjC,YAAY;AAAA,MACZ,UAAU,SAAS,GAAG;AAAE,eAAO,EAAE,SAAS,CAAC;AAAA,MAAG;AAAA,IAAC;AAAA,EACnD;AAEA,WAAS,YAAY,GAAG,QAAQ,UAAU,QAAQ;AAChD,QAAI,UAAU,CAAA;AACd,QAAI,KAAK,IAAI,cAAa;AAC1B,QAAI,GAAG;AAEP,QAAI,kBAAkB,SAAS,MAAM;AACnC,UAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,UAAI,SAAS,QAAQ,CAAC;AACtB,UAAI,SAAS,SAAS,IAAI;AAC1B,UAAI,WAAW,OAAO,WAAW;AAEjC,UAAI,SAAS,GAAG;AACd,cAAM,IAAI,MAAM,8DACe,OAAO,cAAc,MAAM;AAAA,MAC5D;AAEA,UAAI,WAAW,OAAO,UAAU;AAC9B,eAAO,WAAW;AAClB,eAAO,cAAc;AACrB,WAAG,SAAS,GAAG,QAAQ;AAAA,MACzB;AAAA,IACF;AAEA,MAAE,MAAK,EAAG,QAAQ,SAASC,IAAG;AAC5B,UAAI,WAAWA,OAAM,SAAS,IAAI,OAAO;AACzC,cAAQA,EAAC,IAAI,EAAE,SAAkB;AACjC,SAAG,IAAIA,IAAG,QAAQ;AAAA,IACpB,CAAC;AAED,WAAO,GAAG,KAAI,IAAK,GAAG;AACpB,UAAI,GAAG,UAAS;AAChB,eAAS,QAAQ,CAAC;AAClB,UAAI,OAAO,aAAa,OAAO,mBAAmB;AAChD;AAAA,MACF;AAEA,aAAO,CAAC,EAAE,QAAQ,eAAe;AAAA,IACnC;AAEA,WAAO;AAAA,EACT;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.cjs

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("../lodash.cjs");
+const tarjan = require("./tarjan.cjs");
+var findCycles_1;
+var hasRequiredFindCycles;
+function requireFindCycles() {
+  if (hasRequiredFindCycles) return findCycles_1;
+  hasRequiredFindCycles = 1;
+  var _ = lodash.__require();
+  var tarjan$1 = tarjan.__require();
+  findCycles_1 = findCycles;
+  function findCycles(g) {
+    return _.filter(tarjan$1(g), function(cmpt) {
+      return cmpt.length > 1 || cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]);
+    });
+  }
+  return findCycles_1;
+}
+exports.__require = requireFindCycles;
+//# sourceMappingURL=find-cycles.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-cycles.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireTarjan } from './tarjan.js';\n\nvar findCycles_1;\nvar hasRequiredFindCycles;\n\nfunction requireFindCycles () {\n\tif (hasRequiredFindCycles) return findCycles_1;\n\thasRequiredFindCycles = 1;\n\tvar _ = requireLodash();\n\tvar tarjan = requireTarjan();\n\n\tfindCycles_1 = findCycles;\n\n\tfunction findCycles(g) {\n\t  return _.filter(tarjan(g), function(cmpt) {\n\t    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n\t  });\n\t}\n\treturn findCycles_1;\n}\n\nexport { requireFindCycles as __require };\n//# sourceMappingURL=find-cycles.js.map\n"],"names":["requireLodash","tarjan","requireTarjan"],"mappings":";;;;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,oBAAqB;AAC7B,MAAI,sBAAuB,QAAO;AAClC,0BAAwB;AACxB,MAAI,IAAIA,OAAAA,UAAa;AACrB,MAAIC,WAASC,OAAAA,UAAa;AAE1B,iBAAe;AAEf,WAAS,WAAW,GAAG;AACrB,WAAO,EAAE,OAAOD,SAAO,CAAC,GAAG,SAAS,MAAM;AACxC,aAAO,KAAK,SAAS,KAAM,KAAK,WAAW,KAAK,EAAE,QAAQ,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IAC5E,CAAC;AAAA,EACH;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.js

@@ -0,0 +1,21 @@
+import { __require as requireLodash$1 } from "../lodash.js";
+import { __require as requireTarjan } from "./tarjan.js";
+var findCycles_1;
+var hasRequiredFindCycles;
+function requireFindCycles() {
+  if (hasRequiredFindCycles) return findCycles_1;
+  hasRequiredFindCycles = 1;
+  var _ = requireLodash$1();
+  var tarjan = requireTarjan();
+  findCycles_1 = findCycles;
+  function findCycles(g) {
+    return _.filter(tarjan(g), function(cmpt) {
+      return cmpt.length > 1 || cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]);
+    });
+  }
+  return findCycles_1;
+}
+export {
+  requireFindCycles as __require
+};
+//# sourceMappingURL=find-cycles.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-cycles.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireTarjan } from './tarjan.js';\n\nvar findCycles_1;\nvar hasRequiredFindCycles;\n\nfunction requireFindCycles () {\n\tif (hasRequiredFindCycles) return findCycles_1;\n\thasRequiredFindCycles = 1;\n\tvar _ = requireLodash();\n\tvar tarjan = requireTarjan();\n\n\tfindCycles_1 = findCycles;\n\n\tfunction findCycles(g) {\n\t  return _.filter(tarjan(g), function(cmpt) {\n\t    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n\t  });\n\t}\n\treturn findCycles_1;\n}\n\nexport { requireFindCycles as __require };\n//# sourceMappingURL=find-cycles.js.map\n"],"names":["requireLodash"],"mappings":";;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,oBAAqB;AAC7B,MAAI,sBAAuB,QAAO;AAClC,0BAAwB;AACxB,MAAI,IAAIA,gBAAa;AACrB,MAAI,SAAS,cAAa;AAE1B,iBAAe;AAEf,WAAS,WAAW,GAAG;AACrB,WAAO,EAAE,OAAO,OAAO,CAAC,GAAG,SAAS,MAAM;AACxC,aAAO,KAAK,SAAS,KAAM,KAAK,WAAW,KAAK,EAAE,QAAQ,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IAC5E,CAAC;AAAA,EACH;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/floyd-warshall.cjs

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("../lodash.cjs");
+var floydWarshall_1;
+var hasRequiredFloydWarshall;
+function requireFloydWarshall() {
+  if (hasRequiredFloydWarshall) return floydWarshall_1;
+  hasRequiredFloydWarshall = 1;
+  var _ = lodash.__require();
+  floydWarshall_1 = floydWarshall;
+  var DEFAULT_WEIGHT_FUNC = _.constant(1);
+  function floydWarshall(g, weightFn, edgeFn) {
+    return runFloydWarshall(
+      g,
+      weightFn || DEFAULT_WEIGHT_FUNC,
+      edgeFn || function(v) {
+        return g.outEdges(v);
+      }
+    );
+  }
+  function runFloydWarshall(g, weightFn, edgeFn) {
+    var results = {};
+    var nodes = g.nodes();
+    nodes.forEach(function(v) {
+      results[v] = {};
+      results[v][v] = { distance: 0 };
+      nodes.forEach(function(w) {
+        if (v !== w) {
+          results[v][w] = { distance: Number.POSITIVE_INFINITY };
+        }
+      });
+      edgeFn(v).forEach(function(edge) {
+        var w = edge.v === v ? edge.w : edge.v;
+        var d = weightFn(edge);
+        results[v][w] = { distance: d, predecessor: v };
+      });
+    });
+    nodes.forEach(function(k) {
+      var rowK = results[k];
+      nodes.forEach(function(i) {
+        var rowI = results[i];
+        nodes.forEach(function(j) {
+          var ik = rowI[k];
+          var kj = rowK[j];
+          var ij = rowI[j];
+          var altDistance = ik.distance + kj.distance;
+          if (altDistance < ij.distance) {
+            ij.distance = altDistance;
+            ij.predecessor = kj.predecessor;
+          }
+        });
+      });
+    });
+    return results;
+  }
+  return floydWarshall_1;
+}
+exports.__require = requireFloydWarshall;
+//# sourceMappingURL=floyd-warshall.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/floyd-warshall.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"floyd-warshall.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["requireLodash"],"mappings":";;;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,uBAAwB;AAChC,MAAI,yBAA0B,QAAO;AACrC,6BAA2B;AAC3B,MAAI,IAAIA,OAAAA,UAAa;AAErB,oBAAkB;AAElB,MAAI,sBAAsB,EAAE,SAAS,CAAC;AAEtC,WAAS,cAAc,GAAG,UAAU,QAAQ;AAC1C,WAAO;AAAA,MAAiB;AAAA,MACtB,YAAY;AAAA,MACZ,UAAU,SAAS,GAAG;AAAE,eAAO,EAAE,SAAS,CAAC;AAAA,MAAG;AAAA,IAAC;AAAA,EACnD;AAEA,WAAS,iBAAiB,GAAG,UAAU,QAAQ;AAC7C,QAAI,UAAU,CAAA;AACd,QAAI,QAAQ,EAAE,MAAK;AAEnB,UAAM,QAAQ,SAAS,GAAG;AACxB,cAAQ,CAAC,IAAI,CAAA;AACb,cAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,EAAC;AAC7B,YAAM,QAAQ,SAAS,GAAG;AACxB,YAAI,MAAM,GAAG;AACX,kBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,OAAO,kBAAiB;AAAA,QACtD;AAAA,MACF,CAAC;AACD,aAAO,CAAC,EAAE,QAAQ,SAAS,MAAM;AAC/B,YAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,YAAI,IAAI,SAAS,IAAI;AACrB,gBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,GAAG,aAAa,EAAC;AAAA,MAC/C,CAAC;AAAA,IACH,CAAC;AAED,UAAM,QAAQ,SAAS,GAAG;AACxB,UAAI,OAAO,QAAQ,CAAC;AACpB,YAAM,QAAQ,SAAS,GAAG;AACxB,YAAI,OAAO,QAAQ,CAAC;AACpB,cAAM,QAAQ,SAAS,GAAG;AACxB,cAAI,KAAK,KAAK,CAAC;AACf,cAAI,KAAK,KAAK,CAAC;AACf,cAAI,KAAK,KAAK,CAAC;AACf,cAAI,cAAc,GAAG,WAAW,GAAG;AACnC,cAAI,cAAc,GAAG,UAAU;AAC7B,eAAG,WAAW;AACd,eAAG,cAAc,GAAG;AAAA,UACtB;AAAA,QACF,CAAC;AAAA,MACH,CAAC;AAAA,IACH,CAAC;AAED,WAAO;AAAA,EACT;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/floyd-warshall.js

@@ -0,0 +1,59 @@
+import { __require as requireLodash$1 } from "../lodash.js";
+var floydWarshall_1;
+var hasRequiredFloydWarshall;
+function requireFloydWarshall() {
+  if (hasRequiredFloydWarshall) return floydWarshall_1;
+  hasRequiredFloydWarshall = 1;
+  var _ = requireLodash$1();
+  floydWarshall_1 = floydWarshall;
+  var DEFAULT_WEIGHT_FUNC = _.constant(1);
+  function floydWarshall(g, weightFn, edgeFn) {
+    return runFloydWarshall(
+      g,
+      weightFn || DEFAULT_WEIGHT_FUNC,
+      edgeFn || function(v) {
+        return g.outEdges(v);
+      }
+    );
+  }
+  function runFloydWarshall(g, weightFn, edgeFn) {
+    var results = {};
+    var nodes = g.nodes();
+    nodes.forEach(function(v) {
+      results[v] = {};
+      results[v][v] = { distance: 0 };
+      nodes.forEach(function(w) {
+        if (v !== w) {
+          results[v][w] = { distance: Number.POSITIVE_INFINITY };
+        }
+      });
+      edgeFn(v).forEach(function(edge) {
+        var w = edge.v === v ? edge.w : edge.v;
+        var d = weightFn(edge);
+        results[v][w] = { distance: d, predecessor: v };
+      });
+    });
+    nodes.forEach(function(k) {
+      var rowK = results[k];
+      nodes.forEach(function(i) {
+        var rowI = results[i];
+        nodes.forEach(function(j) {
+          var ik = rowI[k];
+          var kj = rowK[j];
+          var ij = rowI[j];
+          var altDistance = ik.distance + kj.distance;
+          if (altDistance < ij.distance) {
+            ij.distance = altDistance;
+            ij.predecessor = kj.predecessor;
+          }
+        });
+      });
+    });
+    return results;
+  }
+  return floydWarshall_1;
+}
+export {
+  requireFloydWarshall as __require
+};
+//# sourceMappingURL=floyd-warshall.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/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/.pnpm/@antv+layout@2.0.0/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":["requireLodash"],"mappings":";AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,uBAAwB;AAChC,MAAI,yBAA0B,QAAO;AACrC,6BAA2B;AAC3B,MAAI,IAAIA,gBAAa;AAErB,oBAAkB;AAElB,MAAI,sBAAsB,EAAE,SAAS,CAAC;AAEtC,WAAS,cAAc,GAAG,UAAU,QAAQ;AAC1C,WAAO;AAAA,MAAiB;AAAA,MACtB,YAAY;AAAA,MACZ,UAAU,SAAS,GAAG;AAAE,eAAO,EAAE,SAAS,CAAC;AAAA,MAAG;AAAA,IAAC;AAAA,EACnD;AAEA,WAAS,iBAAiB,GAAG,UAAU,QAAQ;AAC7C,QAAI,UAAU,CAAA;AACd,QAAI,QAAQ,EAAE,MAAK;AAEnB,UAAM,QAAQ,SAAS,GAAG;AACxB,cAAQ,CAAC,IAAI,CAAA;AACb,cAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,EAAC;AAC7B,YAAM,QAAQ,SAAS,GAAG;AACxB,YAAI,MAAM,GAAG;AACX,kBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,OAAO,kBAAiB;AAAA,QACtD;AAAA,MACF,CAAC;AACD,aAAO,CAAC,EAAE,QAAQ,SAAS,MAAM;AAC/B,YAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,YAAI,IAAI,SAAS,IAAI;AACrB,gBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,GAAG,aAAa,EAAC;AAAA,MAC/C,CAAC;AAAA,IACH,CAAC;AAED,UAAM,QAAQ,SAAS,GAAG;AACxB,UAAI,OAAO,QAAQ,CAAC;AACpB,YAAM,QAAQ,SAAS,GAAG;AACxB,YAAI,OAAO,QAAQ,CAAC;AACpB,cAAM,QAAQ,SAAS,GAAG;AACxB,cAAI,KAAK,KAAK,CAAC;AACf,cAAI,KAAK,KAAK,CAAC;AACf,cAAI,KAAK,KAAK,CAAC;AACf,cAAI,cAAc,GAAG,WAAW,GAAG;AACnC,cAAI,cAAc,GAAG,UAAU;AAC7B,eAAG,WAAW;AACd,eAAG,cAAc,GAAG;AAAA,UACtB;AAAA,QACF,CAAC;AAAA,MACH,CAAC;AAAA,IACH,CAAC;AAED,WAAO;AAAA,EACT;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/index.cjs

@@ -0,0 +1,35 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const components = require("./components.cjs");
+const dijkstra = require("./dijkstra.cjs");
+const dijkstraAll = require("./dijkstra-all.cjs");
+const findCycles = require("./find-cycles.cjs");
+const floydWarshall = require("./floyd-warshall.cjs");
+const isAcyclic = require("./is-acyclic.cjs");
+const postorder = require("./postorder.cjs");
+const preorder = require("./preorder.cjs");
+const prim = require("./prim.cjs");
+const tarjan = require("./tarjan.cjs");
+const topsort = require("./topsort.cjs");
+var alg;
+var hasRequiredAlg;
+function requireAlg() {
+  if (hasRequiredAlg) return alg;
+  hasRequiredAlg = 1;
+  alg = {
+    components: components.__require(),
+    dijkstra: dijkstra.__require(),
+    dijkstraAll: dijkstraAll.__require(),
+    findCycles: findCycles.__require(),
+    floydWarshall: floydWarshall.__require(),
+    isAcyclic: isAcyclic.__require(),
+    postorder: postorder.__require(),
+    preorder: preorder.__require(),
+    prim: prim.__require(),
+    tarjan: tarjan.__require(),
+    topsort: topsort.__require()
+  };
+  return alg;
+}
+exports.__require = requireAlg;
+//# sourceMappingURL=index.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["requireComponents","requireDijkstra","requireDijkstraAll","requireFindCycles","requireFloydWarshall","requireIsAcyclic","requirePostorder","requirePreorder","requirePrim","requireTarjan","requireTopsort"],"mappings":";;;;;;;;;;;;;AAYA,IAAI;AACJ,IAAI;AAEJ,SAAS,aAAc;AACtB,MAAI,eAAgB,QAAO;AAC3B,mBAAiB;AACjB,QAAM;AAAA,IACJ,YAAYA,WAAAA,UAAiB;AAAA,IAC7B,UAAUC,SAAAA,UAAe;AAAA,IACzB,aAAaC,YAAAA,UAAkB;AAAA,IAC/B,YAAYC,WAAAA,UAAiB;AAAA,IAC7B,eAAeC,cAAAA,UAAoB;AAAA,IACnC,WAAWC,UAAAA,UAAgB;AAAA,IAC3B,WAAWC,UAAAA,UAAgB;AAAA,IAC3B,UAAUC,SAAAA,UAAe;AAAA,IACzB,MAAMC,KAAAA,UAAW;AAAA,IACjB,QAAQC,OAAAA,UAAa;AAAA,IACrB,SAASC,QAAAA,UAAc;AAAA,EAC1B;AACC,SAAO;AACR;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,35 @@
+import { __require as requireComponents } from "./components.js";
+import { __require as requireDijkstra } from "./dijkstra.js";
+import { __require as requireDijkstraAll } from "./dijkstra-all.js";
+import { __require as requireFindCycles } from "./find-cycles.js";
+import { __require as requireFloydWarshall } from "./floyd-warshall.js";
+import { __require as requireIsAcyclic } from "./is-acyclic.js";
+import { __require as requirePostorder } from "./postorder.js";
+import { __require as requirePreorder } from "./preorder.js";
+import { __require as requirePrim } from "./prim.js";
+import { __require as requireTarjan } from "./tarjan.js";
+import { __require as requireTopsort } from "./topsort.js";
+var alg;
+var hasRequiredAlg;
+function requireAlg() {
+  if (hasRequiredAlg) return alg;
+  hasRequiredAlg = 1;
+  alg = {
+    components: requireComponents(),
+    dijkstra: requireDijkstra(),
+    dijkstraAll: requireDijkstraAll(),
+    findCycles: requireFindCycles(),
+    floydWarshall: requireFloydWarshall(),
+    isAcyclic: requireIsAcyclic(),
+    postorder: requirePostorder(),
+    preorder: requirePreorder(),
+    prim: requirePrim(),
+    tarjan: requireTarjan(),
+    topsort: requireTopsort()
+  };
+  return alg;
+}
+export {
+  requireAlg as __require
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":[],"mappings":";;;;;;;;;;;AAYA,IAAI;AACJ,IAAI;AAEJ,SAAS,aAAc;AACtB,MAAI,eAAgB,QAAO;AAC3B,mBAAiB;AACjB,QAAM;AAAA,IACJ,YAAY,kBAAiB;AAAA,IAC7B,UAAU,gBAAe;AAAA,IACzB,aAAa,mBAAkB;AAAA,IAC/B,YAAY,kBAAiB;AAAA,IAC7B,eAAe,qBAAoB;AAAA,IACnC,WAAW,iBAAgB;AAAA,IAC3B,WAAW,iBAAgB;AAAA,IAC3B,UAAU,gBAAe;AAAA,IACzB,MAAM,YAAW;AAAA,IACjB,QAAQ,cAAa;AAAA,IACrB,SAAS,eAAc;AAAA,EAC1B;AACC,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/is-acyclic.cjs

@@ -0,0 +1,25 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const topsort = require("./topsort.cjs");
+var isAcyclic_1;
+var hasRequiredIsAcyclic;
+function requireIsAcyclic() {
+  if (hasRequiredIsAcyclic) return isAcyclic_1;
+  hasRequiredIsAcyclic = 1;
+  var topsort$1 = topsort.__require();
+  isAcyclic_1 = isAcyclic;
+  function isAcyclic(g) {
+    try {
+      topsort$1(g);
+    } catch (e) {
+      if (e instanceof topsort$1.CycleException) {
+        return false;
+      }
+      throw e;
+    }
+    return true;
+  }
+  return isAcyclic_1;
+}
+exports.__require = requireIsAcyclic;
+//# sourceMappingURL=is-acyclic.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/is-acyclic.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"is-acyclic.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["topsort","requireTopsort"],"mappings":";;;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,mBAAoB;AAC5B,MAAI,qBAAsB,QAAO;AACjC,yBAAuB;AACvB,MAAIA,YAAUC,QAAAA,UAAc;AAE5B,gBAAc;AAEd,WAAS,UAAU,GAAG;AACpB,QAAI;AACFD,gBAAQ,CAAC;AAAA,IACX,SAAS,GAAG;AACV,UAAI,aAAaA,UAAQ,gBAAgB;AACvC,eAAO;AAAA,MACT;AACA,YAAM;AAAA,IACR;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,25 @@
+import { __require as requireTopsort } from "./topsort.js";
+var isAcyclic_1;
+var hasRequiredIsAcyclic;
+function requireIsAcyclic() {
+  if (hasRequiredIsAcyclic) return isAcyclic_1;
+  hasRequiredIsAcyclic = 1;
+  var topsort = requireTopsort();
+  isAcyclic_1 = isAcyclic;
+  function isAcyclic(g) {
+    try {
+      topsort(g);
+    } catch (e) {
+      if (e instanceof topsort.CycleException) {
+        return false;
+      }
+      throw e;
+    }
+    return true;
+  }
+  return isAcyclic_1;
+}
+export {
+  requireIsAcyclic as __require
+};
+//# sourceMappingURL=is-acyclic.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/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/.pnpm/@antv+layout@2.0.0/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":[],"mappings":";AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,mBAAoB;AAC5B,MAAI,qBAAsB,QAAO;AACjC,yBAAuB;AACvB,MAAI,UAAU,eAAc;AAE5B,gBAAc;AAEd,WAAS,UAAU,GAAG;AACpB,QAAI;AACF,cAAQ,CAAC;AAAA,IACX,SAAS,GAAG;AACV,UAAI,aAAa,QAAQ,gBAAgB;AACvC,eAAO;AAAA,MACT;AACA,YAAM;AAAA,IACR;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/postorder.cjs

@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const dfs = require("./dfs.cjs");
+var postorder_1;
+var hasRequiredPostorder;
+function requirePostorder() {
+  if (hasRequiredPostorder) return postorder_1;
+  hasRequiredPostorder = 1;
+  var dfs$1 = dfs.__require();
+  postorder_1 = postorder;
+  function postorder(g, vs) {
+    return dfs$1(g, vs, "post");
+  }
+  return postorder_1;
+}
+exports.__require = requirePostorder;
+//# sourceMappingURL=postorder.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/postorder.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"postorder.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["dfs","requireDfs"],"mappings":";;;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,mBAAoB;AAC5B,MAAI,qBAAsB,QAAO;AACjC,yBAAuB;AACvB,MAAIA,QAAMC,IAAAA,UAAU;AAEpB,gBAAc;AAEd,WAAS,UAAU,GAAG,IAAI;AACxB,WAAOD,MAAI,GAAG,IAAI,MAAM;AAAA,EAC1B;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,17 @@
+import { __require as requireDfs } from "./dfs.js";
+var postorder_1;
+var hasRequiredPostorder;
+function requirePostorder() {
+  if (hasRequiredPostorder) return postorder_1;
+  hasRequiredPostorder = 1;
+  var dfs = requireDfs();
+  postorder_1 = postorder;
+  function postorder(g, vs) {
+    return dfs(g, vs, "post");
+  }
+  return postorder_1;
+}
+export {
+  requirePostorder as __require
+};
+//# sourceMappingURL=postorder.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"postorder.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":[],"mappings":";AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,mBAAoB;AAC5B,MAAI,qBAAsB,QAAO;AACjC,yBAAuB;AACvB,MAAI,MAAM,WAAU;AAEpB,gBAAc;AAEd,WAAS,UAAU,GAAG,IAAI;AACxB,WAAO,IAAI,GAAG,IAAI,MAAM;AAAA,EAC1B;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/preorder.cjs

@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const dfs = require("./dfs.cjs");
+var preorder_1;
+var hasRequiredPreorder;
+function requirePreorder() {
+  if (hasRequiredPreorder) return preorder_1;
+  hasRequiredPreorder = 1;
+  var dfs$1 = dfs.__require();
+  preorder_1 = preorder;
+  function preorder(g, vs) {
+    return dfs$1(g, vs, "pre");
+  }
+  return preorder_1;
+}
+exports.__require = requirePreorder;
+//# sourceMappingURL=preorder.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/preorder.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"preorder.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["dfs","requireDfs"],"mappings":";;;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,kBAAmB;AAC3B,MAAI,oBAAqB,QAAO;AAChC,wBAAsB;AACtB,MAAIA,QAAMC,IAAAA,UAAU;AAEpB,eAAa;AAEb,WAAS,SAAS,GAAG,IAAI;AACvB,WAAOD,MAAI,GAAG,IAAI,KAAK;AAAA,EACzB;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,17 @@
+import { __require as requireDfs } from "./dfs.js";
+var preorder_1;
+var hasRequiredPreorder;
+function requirePreorder() {
+  if (hasRequiredPreorder) return preorder_1;
+  hasRequiredPreorder = 1;
+  var dfs = requireDfs();
+  preorder_1 = preorder;
+  function preorder(g, vs) {
+    return dfs(g, vs, "pre");
+  }
+  return preorder_1;
+}
+export {
+  requirePreorder as __require
+};
+//# sourceMappingURL=preorder.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"preorder.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":[],"mappings":";AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,kBAAmB;AAC3B,MAAI,oBAAqB,QAAO;AAChC,wBAAsB;AACtB,MAAI,MAAM,WAAU;AAEpB,eAAa;AAEb,WAAS,SAAS,GAAG,IAAI;AACvB,WAAO,IAAI,GAAG,IAAI,KAAK;AAAA,EACzB;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/prim.cjs

@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("../lodash.cjs");
+const graph = require("../graph.cjs");
+const priorityQueue = require("../data/priority-queue.cjs");
+var prim_1;
+var hasRequiredPrim;
+function requirePrim() {
+  if (hasRequiredPrim) return prim_1;
+  hasRequiredPrim = 1;
+  var _ = lodash.__require();
+  var Graph = graph.__require();
+  var PriorityQueue = priorityQueue.__require();
+  prim_1 = prim;
+  function prim(g, weightFunc) {
+    var result = new Graph();
+    var parents = {};
+    var pq = new PriorityQueue();
+    var v;
+    function updateNeighbors(edge) {
+      var w = edge.v === v ? edge.w : edge.v;
+      var pri = pq.priority(w);
+      if (pri !== void 0) {
+        var edgeWeight = weightFunc(edge);
+        if (edgeWeight < pri) {
+          parents[w] = v;
+          pq.decrease(w, edgeWeight);
+        }
+      }
+    }
+    if (g.nodeCount() === 0) {
+      return result;
+    }
+    _.each(g.nodes(), function(v2) {
+      pq.add(v2, Number.POSITIVE_INFINITY);
+      result.setNode(v2);
+    });
+    pq.decrease(g.nodes()[0], 0);
+    var init = false;
+    while (pq.size() > 0) {
+      v = pq.removeMin();
+      if (_.has(parents, v)) {
+        result.setEdge(v, parents[v]);
+      } else if (init) {
+        throw new Error("Input graph is not connected: " + g);
+      } else {
+        init = true;
+      }
+      g.nodeEdges(v).forEach(updateNeighbors);
+    }
+    return result;
+  }
+  return prim_1;
+}
+exports.__require = requirePrim;
+//# sourceMappingURL=prim.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/prim.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"prim.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["requireLodash","requireGraph","requirePriorityQueue","v"],"mappings":";;;;;AAIA,IAAI;AACJ,IAAI;AAEJ,SAAS,cAAe;AACvB,MAAI,gBAAiB,QAAO;AAC5B,oBAAkB;AAClB,MAAI,IAAIA,OAAAA,UAAa;AACrB,MAAI,QAAQC,MAAAA,UAAY;AACxB,MAAI,gBAAgBC,cAAAA,UAAoB;AAExC,WAAS;AAET,WAAS,KAAK,GAAG,YAAY;AAC3B,QAAI,SAAS,IAAI,MAAK;AACtB,QAAI,UAAU,CAAA;AACd,QAAI,KAAK,IAAI,cAAa;AAC1B,QAAI;AAEJ,aAAS,gBAAgB,MAAM;AAC7B,UAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,UAAI,MAAM,GAAG,SAAS,CAAC;AACvB,UAAI,QAAQ,QAAW;AACrB,YAAI,aAAa,WAAW,IAAI;AAChC,YAAI,aAAa,KAAK;AACpB,kBAAQ,CAAC,IAAI;AACb,aAAG,SAAS,GAAG,UAAU;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,QAAI,EAAE,UAAS,MAAO,GAAG;AACvB,aAAO;AAAA,IACT;AAEA,MAAE,KAAK,EAAE,MAAK,GAAI,SAASC,IAAG;AAC5B,SAAG,IAAIA,IAAG,OAAO,iBAAiB;AAClC,aAAO,QAAQA,EAAC;AAAA,IAClB,CAAC;AAGD,OAAG,SAAS,EAAE,MAAK,EAAG,CAAC,GAAG,CAAC;AAE3B,QAAI,OAAO;AACX,WAAO,GAAG,KAAI,IAAK,GAAG;AACpB,UAAI,GAAG,UAAS;AAChB,UAAI,EAAE,IAAI,SAAS,CAAC,GAAG;AACrB,eAAO,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAAA,MAC9B,WAAW,MAAM;AACf,cAAM,IAAI,MAAM,mCAAmC,CAAC;AAAA,MACtD,OAAO;AACL,eAAO;AAAA,MACT;AAEA,QAAE,UAAU,CAAC,EAAE,QAAQ,eAAe;AAAA,IACxC;AAEA,WAAO;AAAA,EACT;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,56 @@
+import { __require as requireLodash$1 } from "../lodash.js";
+import { __require as requireGraph } from "../graph.js";
+import { __require as requirePriorityQueue } from "../data/priority-queue.js";
+var prim_1;
+var hasRequiredPrim;
+function requirePrim() {
+  if (hasRequiredPrim) return prim_1;
+  hasRequiredPrim = 1;
+  var _ = requireLodash$1();
+  var Graph = requireGraph();
+  var PriorityQueue = requirePriorityQueue();
+  prim_1 = prim;
+  function prim(g, weightFunc) {
+    var result = new Graph();
+    var parents = {};
+    var pq = new PriorityQueue();
+    var v;
+    function updateNeighbors(edge) {
+      var w = edge.v === v ? edge.w : edge.v;
+      var pri = pq.priority(w);
+      if (pri !== void 0) {
+        var edgeWeight = weightFunc(edge);
+        if (edgeWeight < pri) {
+          parents[w] = v;
+          pq.decrease(w, edgeWeight);
+        }
+      }
+    }
+    if (g.nodeCount() === 0) {
+      return result;
+    }
+    _.each(g.nodes(), function(v2) {
+      pq.add(v2, Number.POSITIVE_INFINITY);
+      result.setNode(v2);
+    });
+    pq.decrease(g.nodes()[0], 0);
+    var init = false;
+    while (pq.size() > 0) {
+      v = pq.removeMin();
+      if (_.has(parents, v)) {
+        result.setEdge(v, parents[v]);
+      } else if (init) {
+        throw new Error("Input graph is not connected: " + g);
+      } else {
+        init = true;
+      }
+      g.nodeEdges(v).forEach(updateNeighbors);
+    }
+    return result;
+  }
+  return prim_1;
+}
+export {
+  requirePrim as __require
+};
+//# sourceMappingURL=prim.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"prim.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["requireLodash","v"],"mappings":";;;AAIA,IAAI;AACJ,IAAI;AAEJ,SAAS,cAAe;AACvB,MAAI,gBAAiB,QAAO;AAC5B,oBAAkB;AAClB,MAAI,IAAIA,gBAAa;AACrB,MAAI,QAAQ,aAAY;AACxB,MAAI,gBAAgB,qBAAoB;AAExC,WAAS;AAET,WAAS,KAAK,GAAG,YAAY;AAC3B,QAAI,SAAS,IAAI,MAAK;AACtB,QAAI,UAAU,CAAA;AACd,QAAI,KAAK,IAAI,cAAa;AAC1B,QAAI;AAEJ,aAAS,gBAAgB,MAAM;AAC7B,UAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,UAAI,MAAM,GAAG,SAAS,CAAC;AACvB,UAAI,QAAQ,QAAW;AACrB,YAAI,aAAa,WAAW,IAAI;AAChC,YAAI,aAAa,KAAK;AACpB,kBAAQ,CAAC,IAAI;AACb,aAAG,SAAS,GAAG,UAAU;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,QAAI,EAAE,UAAS,MAAO,GAAG;AACvB,aAAO;AAAA,IACT;AAEA,MAAE,KAAK,EAAE,MAAK,GAAI,SAASC,IAAG;AAC5B,SAAG,IAAIA,IAAG,OAAO,iBAAiB;AAClC,aAAO,QAAQA,EAAC;AAAA,IAClB,CAAC;AAGD,OAAG,SAAS,EAAE,MAAK,EAAG,CAAC,GAAG,CAAC;AAE3B,QAAI,OAAO;AACX,WAAO,GAAG,KAAI,IAAK,GAAG;AACpB,UAAI,GAAG,UAAS;AAChB,UAAI,EAAE,IAAI,SAAS,CAAC,GAAG;AACrB,eAAO,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAAA,MAC9B,WAAW,MAAM;AACf,cAAM,IAAI,MAAM,mCAAmC,CAAC;AAAA,MACtD,OAAO;AACL,eAAO;AAAA,MACT;AAEA,QAAE,UAAU,CAAC,EAAE,QAAQ,eAAe;AAAA,IACxC;AAEA,WAAO;AAAA,EACT;AACA,SAAO;AACR;","x_google_ignoreList":[0]}