@antv/layout 1.2.12 → 1.2.14-beta.0

package/lib/{dagre → antv-dagre}/nesting-graph.js

@@ -1,5 +1,7 @@
-import { __read, __spreadArray } from "tslib";
-import { addBorderNode, addDummyNode } from './util';
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cleanup = exports.run = void 0;
+const util_1 = require("./util");
 /*
  * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,
  * adds appropriate edges to ensure that all cluster nodes are placed between
@@ -23,27 +25,27 @@ import { addBorderNode, addDummyNode } from './util';
  * The nesting graph idea comes from Sander, "Layout of Compound Directed
  * Graphs."
  */
-var run = function (g) {
-    var root = addDummyNode(g, 'root', {}, '_root');
-    var depths = treeDepths(g);
-    var maxDepth = Math.max.apply(Math, __spreadArray([], __read(Object.values(depths))));
+const run = (g) => {
+    const root = (0, util_1.addDummyNode)(g, 'root', {}, '_root');
+    const depths = treeDepths(g);
+    let maxDepth = Math.max(...Object.values(depths));
     if (Math.abs(maxDepth) === Infinity) {
         maxDepth = 1;
     }
-    var height = maxDepth - 1; // Note: depths is an Object not an array
-    var nodeSep = 2 * height + 1;
+    const height = maxDepth - 1; // Note: depths is an Object not an array
+    const nodeSep = 2 * height + 1;
     // g.graph().nestingRoot = root;
     // Multiply minlen by nodeSep to align nodes on non-border ranks.
-    g.getAllEdges().forEach(function (e) {
+    g.getAllEdges().forEach((e) => {
         e.data.minlen *= nodeSep;
     });
     // Calculate a weight that is sufficient to keep subgraphs vertically compact
-    var weight = sumWeights(g) + 1;
+    const weight = sumWeights(g) + 1;
     // Create border nodes and link them up
     // g.children()?.forEach((child) => {
     //   dfs(g, root, nodeSep, weight, height, depths, child);
     // });
-    g.getRoots().forEach(function (child) {
+    g.getRoots().forEach((child) => {
         dfs(g, root, nodeSep, weight, height, depths, child.id);
     });
     // Save the multiplier for node layers for later removal of empty border
@@ -54,13 +56,14 @@ var run = function (g) {
         nodeRankFactor: nodeSep,
     };
 };
-var dfs = function (g, root, nodeSep, weight, height, depths, v) {
-    var children = g.getChildren(v);
+exports.run = run;
+const dfs = (g, root, nodeSep, weight, height, depths, v) => {
+    const children = g.getChildren(v);
     if (!(children === null || children === void 0 ? void 0 : children.length)) {
         if (v !== root) {
             // g.setEdge(root, v, { weight: 0, minlen: nodeSep });
             g.addEdge({
-                id: "e" + Math.random(),
+                id: `e${Math.random()}`,
                 source: root,
                 target: v,
                 data: { weight: 0, minlen: nodeSep },
@@ -68,39 +71,39 @@ var dfs = function (g, root, nodeSep, weight, height, depths, v) {
         }
         return;
     }
-    var top = addBorderNode(g, '_bt');
-    var bottom = addBorderNode(g, '_bb');
-    var label = g.getNode(v);
+    const top = (0, util_1.addBorderNode)(g, '_bt');
+    const bottom = (0, util_1.addBorderNode)(g, '_bb');
+    const label = g.getNode(v);
     g.setParent(top, v);
     label.data.borderTop = top;
     g.setParent(bottom, v);
     label.data.borderBottom = bottom;
-    children === null || children === void 0 ? void 0 : children.forEach(function (childNode) {
+    children === null || children === void 0 ? void 0 : children.forEach((childNode) => {
         dfs(g, root, nodeSep, weight, height, depths, childNode.id);
-        var childTop = childNode.data.borderTop
+        const childTop = childNode.data.borderTop
             ? childNode.data.borderTop
             : childNode.id;
-        var childBottom = childNode.data.borderBottom
+        const childBottom = childNode.data.borderBottom
             ? childNode.data.borderBottom
             : childNode.id;
-        var thisWeight = childNode.data.borderTop ? weight : 2 * weight;
-        var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
+        const thisWeight = childNode.data.borderTop ? weight : 2 * weight;
+        const minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
         g.addEdge({
-            id: "e" + Math.random(),
+            id: `e${Math.random()}`,
             source: top,
             target: childTop,
             data: {
-                minlen: minlen,
+                minlen,
                 weight: thisWeight,
                 nestingEdge: true,
             },
         });
         g.addEdge({
-            id: "e" + Math.random(),
+            id: `e${Math.random()}`,
             source: childBottom,
             target: bottom,
             data: {
-                minlen: minlen,
+                minlen,
                 weight: thisWeight,
                 nestingEdge: true,
             },
@@ -108,7 +111,7 @@ var dfs = function (g, root, nodeSep, weight, height, depths, v) {
     });
     if (!g.getParent(v)) {
         g.addEdge({
-            id: "e" + Math.random(),
+            id: `e${Math.random()}`,
             source: root,
             target: top,
             data: {
@@ -118,36 +121,36 @@ var dfs = function (g, root, nodeSep, weight, height, depths, v) {
         });
     }
 };
-var treeDepths = function (g) {
-    var depths = {};
-    var dfs = function (v, depth) {
-        var children = g.getChildren(v);
-        children === null || children === void 0 ? void 0 : children.forEach(function (child) { return dfs(child.id, depth + 1); });
+const treeDepths = (g) => {
+    const depths = {};
+    const dfs = (v, depth) => {
+        const children = g.getChildren(v);
+        children === null || children === void 0 ? void 0 : children.forEach((child) => dfs(child.id, depth + 1));
         depths[v] = depth;
     };
     // g.children()?.forEach((v) => dfs(v, 1));
-    g.getRoots().forEach(function (v) { return dfs(v.id, 1); });
+    g.getRoots().forEach((v) => dfs(v.id, 1));
     return depths;
 };
-var sumWeights = function (g) {
-    var result = 0;
-    g.getAllEdges().forEach(function (e) {
+const sumWeights = (g) => {
+    let result = 0;
+    g.getAllEdges().forEach((e) => {
         result += e.data.weight;
     });
     return result;
 };
-var cleanup = function (g, nestingRoot) {
+const cleanup = (g, nestingRoot) => {
     // const graphLabel = g.graph();
     // graphLabel.nestingRoot && g.removeNode(graphLabel.nestingRoot);
     // delete graphLabel.nestingRoot;
     if (nestingRoot) {
         g.removeNode(nestingRoot);
     }
-    g.getAllEdges().forEach(function (e) {
+    g.getAllEdges().forEach((e) => {
         if (e.data.nestingEdge) {
             g.removeEdge(e.id);
         }
     });
 };
-export { run, cleanup };
+exports.cleanup = cleanup;
 //# sourceMappingURL=nesting-graph.js.map

package/lib/antv-dagre/nesting-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.js","sourceRoot":"","sources":["../../src/antv-dagre/nesting-graph.ts"],"names":[],"mappings":";;;AAEA,iCAAqD;AAErD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;IACxB,MAAM,IAAI,GAAG,IAAA,mBAAY,EAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAElD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,QAAQ,EAAE;QACnC,QAAQ,GAAG,CAAC,CAAC;KACd;IAED,MAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,yCAAyC;IACtE,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IAE/B,gCAAgC;IAEhC,iEAAiE;IACjE,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,OAAO,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,6EAA6E;IAC7E,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEjC,uCAAuC;IACvC,qCAAqC;IACrC,0DAA0D;IAC1D,MAAM;IACN,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC7B,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,wEAAwE;IACxE,UAAU;IACV,sCAAsC;IAEtC,OAAO;QACL,WAAW,EAAE,IAAI;QACjB,cAAc,EAAE,OAAO;KACxB,CAAC;AACJ,CAAC,CAAC;AAsHO,kBAAG;AApHZ,MAAM,GAAG,GAAG,CACV,CAAS,EACT,IAAQ,EACR,OAAe,EACf,MAAc,EACd,MAAc,EACd,MAA8B,EAC9B,CAAK,EACL,EAAE;IACF,MAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAClC,IAAI,CAAC,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,CAAA,EAAE;QACrB,IAAI,CAAC,KAAK,IAAI,EAAE;YACd,sDAAsD;YACtD,CAAC,CAAC,OAAO,CAAC;gBACR,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;gBACvB,MAAM,EAAE,IAAI;gBACZ,MAAM,EAAE,CAAC;gBACT,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE;aACrC,CAAC,CAAC;SACJ;QACD,OAAO;KACR;IAED,MAAM,GAAG,GAAG,IAAA,oBAAa,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,IAAA,oBAAa,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAE5B,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC;IAC3B,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvB,KAAK,CAAC,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC;IAEjC,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;QAC9B,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;QAE5D,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS;YACvC,CAAC,CAAE,SAAS,CAAC,IAAI,CAAC,SAAgB;YAClC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QACjB,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY;YAC7C,CAAC,CAAE,SAAS,CAAC,IAAI,CAAC,YAAmB;YACrC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QACjB,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QAClE,MAAM,MAAM,GAAG,QAAQ,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAErE,CAAC,CAAC,OAAO,CAAC;YACR,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACvB,MAAM,EAAE,GAAG;YACX,MAAM,EAAE,QAAQ;YAChB,IAAI,EAAE;gBACJ,MAAM;gBACN,MAAM,EAAE,UAAU;gBAClB,WAAW,EAAE,IAAI;aAClB;SACF,CAAC,CAAC;QAEH,CAAC,CAAC,OAAO,CAAC;YACR,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACvB,MAAM,EAAE,WAAW;YACnB,MAAM,EAAE,MAAM;YACd,IAAI,EAAE;gBACJ,MAAM;gBACN,MAAM,EAAE,UAAU;gBAClB,WAAW,EAAE,IAAI;aAClB;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;QACnB,CAAC,CAAC,OAAO,CAAC;YACR,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACvB,MAAM,EAAE,IAAI;YACZ,MAAM,EAAE,GAAG;YACX,IAAI,EAAE;gBACJ,MAAM,EAAE,CAAC;gBACT,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;aAC3B;SACF,CAAC,CAAC;KACJ;AACH,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,EAAE;IAC/B,MAAM,MAAM,GAAuB,EAAE,CAAC;IACtC,MAAM,GAAG,GAAG,CAAC,CAAK,EAAE,KAAa,EAAE,EAAE;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACpB,CAAC,CAAC;IACF,2CAA2C;IAE3C,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,EAAE;IAC/B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;IAC3B,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,WAAgB,EAAE,EAAE;IAC9C,gCAAgC;IAChC,kEAAkE;IAClE,iCAAiC;IACjC,IAAI,WAAW,EAAE;QACf,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;KAC3B;IAED,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE;YACtB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEY,0BAAO"}

package/lib/{dagre → antv-dagre}/normalize.d.ts

@@ -1,5 +1,5 @@
-import { ID } from "@antv/graphlib";
-import { Graph as IGraph } from "../types";
+import { ID } from '@antv/graphlib';
+import { Graph as IGraph } from '../types';
 declare const run: (g: IGraph, dummyChains: ID[]) => void;
 declare const undo: (g: IGraph, dummyChains: ID[]) => void;
 export { run, undo };

package/lib/{dagre → antv-dagre}/normalize.js

@@ -1,4 +1,7 @@
-import { addDummyNode } from "./util";
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.undo = exports.run = void 0;
+const util_1 = require("./util");
 /*
  * Breaks any long edges in the graph into short segments that span 1 layer
  * each. This operation is undoable with the denormalize function.
@@ -15,23 +18,24 @@ import { addDummyNode } from "./util";
  *    3. The graph is augmented with a "dummyChains" attribute which contains
  *       the first dummy in each chain of dummy nodes produced.
  */
-var DUMMY_NODE_EDGE = "edge";
-var DUMMY_NODE_EDGE_LABEL = "edge-label";
-var run = function (g, dummyChains) {
-    g.getAllEdges().forEach(function (edge) { return normalizeEdge(g, edge, dummyChains); });
+const DUMMY_NODE_EDGE = 'edge';
+const DUMMY_NODE_EDGE_LABEL = 'edge-label';
+const run = (g, dummyChains) => {
+    g.getAllEdges().forEach((edge) => normalizeEdge(g, edge, dummyChains));
 };
-var normalizeEdge = function (g, e, dummyChains) {
-    var v = e.source;
-    var vRank = g.getNode(v).data.rank;
-    var w = e.target;
-    var wRank = g.getNode(w).data.rank;
-    var labelRank = e.data.labelRank;
+exports.run = run;
+const normalizeEdge = (g, e, dummyChains) => {
+    let v = e.source;
+    let vRank = g.getNode(v).data.rank;
+    const w = e.target;
+    const wRank = g.getNode(w).data.rank;
+    const labelRank = e.data.labelRank;
     if (wRank === vRank + 1)
         return;
     g.removeEdge(e.id);
-    var dummy;
-    var nodeData;
-    var i;
+    let dummy;
+    let nodeData;
+    let i;
     for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
         e.data.points = [];
         nodeData = {
@@ -40,7 +44,7 @@ var normalizeEdge = function (g, e, dummyChains) {
             height: 0,
             rank: vRank,
         };
-        dummy = addDummyNode(g, DUMMY_NODE_EDGE, nodeData, "_d");
+        dummy = (0, util_1.addDummyNode)(g, DUMMY_NODE_EDGE, nodeData, '_d');
         if (vRank === labelRank) {
             nodeData.width = e.data.width;
             nodeData.height = e.data.height;
@@ -48,7 +52,7 @@ var normalizeEdge = function (g, e, dummyChains) {
             nodeData.labelpos = e.data.labelpos;
         }
         g.addEdge({
-            id: "e" + Math.random(),
+            id: `e${Math.random()}`,
             source: v,
             target: dummy,
             data: { weight: e.data.weight },
@@ -59,23 +63,23 @@ var normalizeEdge = function (g, e, dummyChains) {
         v = dummy;
     }
     g.addEdge({
-        id: "e" + Math.random(),
+        id: `e${Math.random()}`,
         source: v,
         target: w,
         data: { weight: e.data.weight },
     });
 };
-var undo = function (g, dummyChains) {
-    dummyChains.forEach(function (v) {
-        var node = g.getNode(v);
-        var data = node.data;
-        var originalEdge = data.originalEdge;
-        var w;
+const undo = (g, dummyChains) => {
+    dummyChains.forEach((v) => {
+        let node = g.getNode(v);
+        const { data } = node;
+        const originalEdge = data.originalEdge;
+        let w;
         // Restore original edge.
         if (originalEdge) {
             g.addEdge(originalEdge);
         }
-        var currentV = v;
+        let currentV = v;
         while (node.data.dummy) {
             w = g.getSuccessors(currentV)[0];
             g.removeNode(currentV);
@@ -94,5 +98,5 @@ var undo = function (g, dummyChains) {
         }
     });
 };
-export { run, undo };
+exports.undo = undo;
 //# sourceMappingURL=normalize.js.map

package/lib/antv-dagre/normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sourceRoot":"","sources":["../../src/antv-dagre/normalize.ts"],"names":[],"mappings":";;;AAEA,iCAAsC;AAEtC;;;;;;;;;;;;;;;GAeG;AAEH,MAAM,eAAe,GAAG,MAAM,CAAC;AAC/B,MAAM,qBAAqB,GAAG,YAAY,CAAC;AAE3C,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,WAAiB,EAAE,EAAE;IAC3C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;AACzE,CAAC,CAAC;AA6FO,kBAAG;AA3FZ,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAiB,EAAE,WAAiB,EAAE,EAAE;IACxE,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACjB,IAAI,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,IAAK,CAAC;IACrC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,IAAK,CAAC;IACvC,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;IAEnC,IAAI,KAAK,KAAK,KAAK,GAAG,CAAC;QAAE,OAAO;IAEhC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEnB,IAAI,KAAS,CAAC;IACd,IAAI,QAOH,CAAC;IACF,IAAI,CAAC,CAAC;IACN,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE;QAChD,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACnB,QAAQ,GAAG;YACT,YAAY,EAAE,CAAC;YACf,KAAK,EAAE,CAAC;YACR,MAAM,EAAE,CAAC;YACT,IAAI,EAAE,KAAK;SACZ,CAAC;QAEF,KAAK,GAAG,IAAA,mBAAY,EAAC,CAAC,EAAE,eAAe,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAEzD,IAAI,KAAK,KAAK,SAAS,EAAE;YACvB,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAM,CAAC;YAC/B,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;YACjC,QAAQ,CAAC,KAAK,GAAG,qBAAqB,CAAC;YACvC,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAkB,CAAC;SAC/C;QAED,CAAC,CAAC,OAAO,CAAC;YACR,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACvB,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;SAChC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACzB;QACD,CAAC,GAAG,KAAK,CAAC;KACX;IAED,CAAC,CAAC,OAAO,CAAC;QACR,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;QACvB,MAAM,EAAE,CAAC;QACT,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;KAChC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,WAAiB,EAAE,EAAE;IAC5C,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACxB,IAAI,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QACzB,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,MAAM,YAAY,GAAG,IAAI,CAAC,YAA8B,CAAC;QAEzD,IAAI,CAAC,CAAC;QACN,yBAAyB;QACzB,IAAI,YAAY,EAAE;YAChB,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;SACzB;QAED,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACtB,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACvB,YAAY,CAAC,IAAI,CAAC,MAAO,CAAC,IAAI,CAAC;gBAC7B,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE;gBACf,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE;aAChB,CAAC,CAAC;YACH,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,qBAAqB,EAAE;gBAC7C,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBAClC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBAClC,YAAY,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC1C,YAAY,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;aAC7C;YACD,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC;YAChB,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAE,CAAC;SAC7B;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEY,oBAAI"}

package/lib/{dagre → antv-dagre}/order/add-subgraph-constraints.js

@@ -1,10 +1,13 @@
-export var addSubgraphConstraints = function (g, cg, vs) {
-    var prev = {};
-    var rootPrev;
-    vs === null || vs === void 0 ? void 0 : vs.forEach(function (v) {
-        var child = g.getParent(v);
-        var parent;
-        var prevChild;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addSubgraphConstraints = void 0;
+const addSubgraphConstraints = (g, cg, vs) => {
+    const prev = {};
+    let rootPrev;
+    vs === null || vs === void 0 ? void 0 : vs.forEach((v) => {
+        let child = g.getParent(v);
+        let parent;
+        let prevChild;
         while (child) {
             parent = g.getParent(child.id);
             if (parent) {
@@ -28,9 +31,9 @@ export var addSubgraphConstraints = function (g, cg, vs) {
                         data: {},
                     });
                 }
-                if (!cg.hasEdge("e" + prevChild + "-" + child.id)) {
+                if (!cg.hasEdge(`e${prevChild}-${child.id}`)) {
                     cg.addEdge({
-                        id: "e" + prevChild + "-" + child.id,
+                        id: `e${prevChild}-${child.id}`,
                         source: prevChild,
                         target: child.id,
                         data: {},
@@ -42,4 +45,5 @@ export var addSubgraphConstraints = function (g, cg, vs) {
         }
     });
 };
+exports.addSubgraphConstraints = addSubgraphConstraints;
 //# sourceMappingURL=add-subgraph-constraints.js.map

package/lib/antv-dagre/order/add-subgraph-constraints.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-subgraph-constraints.js","sourceRoot":"","sources":["../../../src/antv-dagre/order/add-subgraph-constraints.ts"],"names":[],"mappings":";;;AAGO,MAAM,sBAAsB,GAAG,CAAC,CAAQ,EAAE,EAAS,EAAE,EAAQ,EAAE,EAAE;IACtE,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,QAAY,CAAC;IAEjB,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAChB,IAAI,KAAK,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,MAAM,CAAC;QACX,IAAI,SAAa,CAAC;QAClB,OAAO,KAAK,EAAE;YACZ,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC/B,IAAI,MAAM,EAAE;gBACV,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAC5B,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;aAC5B;iBAAM;gBACL,SAAS,GAAG,QAAQ,CAAC;gBACrB,QAAQ,GAAG,KAAK,CAAC,EAAE,CAAC;aACrB;YACD,IAAI,SAAS,IAAI,SAAS,KAAK,KAAK,CAAC,EAAE,EAAE;gBACvC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;oBAC1B,EAAE,CAAC,OAAO,CAAC;wBACT,EAAE,EAAE,SAAS;wBACb,IAAI,EAAE,EAAE;qBACT,CAAC,CAAC;iBACJ;gBACD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;oBACzB,EAAE,CAAC,OAAO,CAAC;wBACT,EAAE,EAAE,KAAK,CAAC,EAAE;wBACZ,IAAI,EAAE,EAAE;qBACT,CAAC,CAAC;iBACJ;gBACD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE;oBAC5C,EAAE,CAAC,OAAO,CAAC;wBACT,EAAE,EAAE,IAAI,SAAS,IAAI,KAAK,CAAC,EAAE,EAAE;wBAC/B,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,KAAK,CAAC,EAAE;wBAChB,IAAI,EAAE,EAAE;qBACT,CAAC,CAAC;iBACJ;gBACD,OAAO;aACR;YACD,KAAK,GAAG,MAAM,CAAC;SAChB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AA3CW,QAAA,sBAAsB,0BA2CjC"}

package/lib/{dagre → antv-dagre}/order/barycenter.d.ts

@@ -1,5 +1,5 @@
-import { ID } from "@antv/graphlib";
-import { Graph } from "../../types";
+import { ID } from '@antv/graphlib';
+import { Graph } from '../../types';
 /**
  * TODO: The median method consistently performs better than the barycenter method and has a slight theoretical advantage
  */

package/lib/antv-dagre/order/barycenter.js

@@ -0,0 +1,27 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.barycenter = void 0;
+/**
+ * TODO: The median method consistently performs better than the barycenter method and has a slight theoretical advantage
+ */
+const barycenter = (g, movable) => {
+    return movable.map((v) => {
+        const inV = g.getRelatedEdges(v, 'in');
+        if (!(inV === null || inV === void 0 ? void 0 : inV.length)) {
+            return { v };
+        }
+        const result = { sum: 0, weight: 0 };
+        inV === null || inV === void 0 ? void 0 : inV.forEach((e) => {
+            const nodeU = g.getNode(e.source);
+            result.sum += e.data.weight * nodeU.data.order;
+            result.weight += e.data.weight;
+        });
+        return {
+            v,
+            barycenter: result.sum / result.weight,
+            weight: result.weight,
+        };
+    });
+};
+exports.barycenter = barycenter;
+//# sourceMappingURL=barycenter.js.map

package/lib/antv-dagre/order/barycenter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"barycenter.js","sourceRoot":"","sources":["../../../src/antv-dagre/order/barycenter.ts"],"names":[],"mappings":";;;AAGA;;GAEG;AACI,MAAM,UAAU,GAAG,CAAC,CAAQ,EAAE,OAAa,EAAE,EAAE;IACpD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACvB,MAAM,GAAG,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,CAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,MAAM,CAAA,EAAE;YAChB,OAAO,EAAE,CAAC,EAAE,CAAC;SACd;QAED,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QACrC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACjB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC;YACnC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO,GAAG,KAAK,CAAC,IAAI,CAAC,KAAM,CAAC;YACjD,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,OAAO;YACL,CAAC;YACD,UAAU,EAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM;YACtC,MAAM,EAAE,MAAM,CAAC,MAAM;SACtB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAnBW,QAAA,UAAU,cAmBrB"}

package/lib/{dagre → antv-dagre}/order/build-layer-graph.js

@@ -1,5 +1,7 @@
-import { __assign } from "tslib";
-import { Graph } from '@antv/graphlib';
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildLayerGraph = void 0;
+const graphlib_1 = require("@antv/graphlib");
 /*
  * Constructs a graph that can be used to sort a layer of nodes. The graph will
  * contain all base and subgraph nodes from the request layer in their original
@@ -30,9 +32,9 @@ import { Graph } from '@antv/graphlib';
  *    5. The weights for copied edges are aggregated as need, since the output
  *       graph is not a multi-graph.
  */
-export var buildLayerGraph = function (g, rank, direction) {
-    var root = createRootNode(g);
-    var result = new Graph({
+const buildLayerGraph = (g, rank, direction) => {
+    const root = createRootNode(g);
+    const result = new graphlib_1.Graph({
         tree: [
             {
                 id: root,
@@ -41,30 +43,27 @@ export var buildLayerGraph = function (g, rank, direction) {
             },
         ],
     });
-    g.getAllNodes().forEach(function (v) {
-        var parent = g.getParent(v.id);
+    g.getAllNodes().forEach((v) => {
+        const parent = g.getParent(v.id);
         if (v.data.rank === rank ||
             (v.data.minRank <= rank && rank <= v.data.maxRank)) {
             if (!result.hasNode(v.id)) {
-                result.addNode(__assign({}, v));
+                result.addNode(Object.assign({}, v));
             }
             if ((parent === null || parent === void 0 ? void 0 : parent.id) && !result.hasNode(parent === null || parent === void 0 ? void 0 : parent.id)) {
-                result.addNode(__assign({}, parent));
+                result.addNode(Object.assign({}, parent));
             }
             result.setParent(v.id, (parent === null || parent === void 0 ? void 0 : parent.id) || root);
             // This assumes we have only short edges!
-            g.getRelatedEdges(v.id, direction).forEach(function (e) {
-                var u = e.source === v.id ? e.target : e.source;
+            g.getRelatedEdges(v.id, direction).forEach((e) => {
+                const u = e.source === v.id ? e.target : e.source;
                 if (!result.hasNode(u)) {
-                    result.addNode(__assign({}, g.getNode(u)));
+                    result.addNode(Object.assign({}, g.getNode(u)));
                 }
-                var edge = result
+                const edge = result
                     .getRelatedEdges(u, 'out')
-                    .find(function (_a) {
-                    var target = _a.target;
-                    return target === v.id;
-                });
-                var weight = edge !== undefined ? edge.data.weight : 0;
+                    .find(({ target }) => target === v.id);
+                const weight = edge !== undefined ? edge.data.weight : 0;
                 if (!edge) {
                     result.addEdge({
                         id: e.id,
@@ -76,20 +75,21 @@ export var buildLayerGraph = function (g, rank, direction) {
                     });
                 }
                 else {
-                    result.updateEdgeData(edge.id, __assign(__assign({}, edge.data), { weight: e.data.weight + weight }));
+                    result.updateEdgeData(edge.id, Object.assign(Object.assign({}, edge.data), { weight: e.data.weight + weight }));
                 }
             });
             // console.log(v);
             if (v.data.hasOwnProperty('minRank')) {
-                result.updateNodeData(v.id, __assign(__assign({}, v.data), { borderLeft: v.data.borderLeft[rank], borderRight: v.data.borderRight[rank] }));
+                result.updateNodeData(v.id, Object.assign(Object.assign({}, v.data), { borderLeft: v.data.borderLeft[rank], borderRight: v.data.borderRight[rank] }));
             }
         }
     });
     return result;
 };
-var createRootNode = function (g) {
-    var v;
-    while (g.hasNode((v = "_root" + Math.random())))
+exports.buildLayerGraph = buildLayerGraph;
+const createRootNode = (g) => {
+    let v;
+    while (g.hasNode((v = `_root${Math.random()}`)))
         ;
     return v;
 };

package/lib/antv-dagre/order/build-layer-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-layer-graph.js","sourceRoot":"","sources":["../../../src/antv-dagre/order/build-layer-graph.ts"],"names":[],"mappings":";;;AAAA,6CAA2C;AAG3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACI,MAAM,eAAe,GAAG,CAC7B,CAAS,EACT,IAAY,EACZ,SAAuB,EACvB,EAAE;IACF,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,MAAM,GAAG,IAAI,gBAAK,CAAqB;QAC3C,IAAI,EAAE;YACJ;gBACE,EAAE,EAAE,IAAI;gBACR,QAAQ,EAAE,EAAE;gBACZ,IAAI,EAAE,EAAE;aACT;SACF;KACF,CAAC,CAAC;IAEH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAEjC,IACE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI;YACpB,CAAC,CAAC,CAAC,IAAI,CAAC,OAAQ,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,OAAQ,CAAC,EACpD;YACA,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;gBACzB,MAAM,CAAC,OAAO,mBAAM,CAAC,EAAG,CAAC;aAC1B;YAED,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,KAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,CAAC,EAAE;gBAC7C,MAAM,CAAC,OAAO,mBAAM,MAAM,EAAG,CAAC;aAC/B;YAED,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,KAAI,IAAI,CAAC,CAAC;YAE3C,yCAAyC;YACzC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC/C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAClD,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;oBACtB,MAAM,CAAC,OAAO,mBAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAG,CAAC;iBACrC;gBAED,MAAM,IAAI,GAAG,MAAM;qBAChB,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC;qBACzB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;gBACzC,MAAM,MAAM,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE1D,IAAI,CAAC,IAAI,EAAE;oBACT,MAAM,CAAC,OAAO,CAAC;wBACb,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,MAAM,EAAE,CAAC;wBACT,MAAM,EAAE,CAAC,CAAC,EAAE;wBACZ,IAAI,EAAE;4BACJ,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,GAAG,MAAM;yBAChC;qBACF,CAAC,CAAC;iBACJ;qBAAM;oBACL,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,kCACxB,IAAI,CAAC,IAAI,KACZ,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,GAAG,MAAM,IAC/B,CAAC;iBACJ;YACH,CAAC,CAAC,CAAC;YAEH,kBAAkB;YAElB,IAAI,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE;gBACpC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,kCACrB,CAAC,CAAC,IAAI,KACT,UAAU,EAAG,CAAC,CAAC,IAAI,CAAC,UAAmB,CAAC,IAAI,CAAC,EAC7C,WAAW,EAAG,CAAC,CAAC,IAAI,CAAC,WAAoB,CAAC,IAAI,CAAC,IAC/C,CAAC;aACJ;SACF;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AA3EW,QAAA,eAAe,mBA2E1B;AAEF,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,EAAE;IACnC,IAAI,CAAC,CAAC;IACN,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAAC,CAAC;IACjD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC"}

package/lib/antv-dagre/order/cross-count.d.ts

@@ -0,0 +1,3 @@
+import { ID } from '@antv/graphlib';
+import { Graph } from '../../types';
+export declare const crossCount: (g: Graph, layering: ID[][]) => number;

package/lib/{dagre → antv-dagre}/order/cross-count.js

@@ -1,3 +1,4 @@
+"use strict";
 /*
  * A function that takes a layering (an array of layers, each with an array of
  * ordererd nodes) and a graph and returns a weighted crossing count.
@@ -14,33 +15,35 @@
  *
  * This algorithm is derived from Barth, et al., "Bilayer Cross Counting."
  */
-import { zipObject } from "../util";
-var twoLayerCrossCount = function (g, northLayer, southLayer) {
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.crossCount = void 0;
+const util_1 = require("../util");
+const twoLayerCrossCount = (g, northLayer, southLayer) => {
     // Sort all of the edges between the north and south layers by their position
     // in the north layer and then the south. Map these edges to the position of
     // their head in the south layer.
-    var southPos = zipObject(southLayer, southLayer.map(function (v, i) { return i; }));
-    var unflat = northLayer.map(function (v) {
-        var unsort = g.getRelatedEdges(v, "out").map(function (e) {
+    const southPos = (0, util_1.zipObject)(southLayer, southLayer.map((v, i) => i));
+    const unflat = northLayer.map((v) => {
+        const unsort = g.getRelatedEdges(v, 'out').map((e) => {
             return { pos: southPos[e.target] || 0, weight: e.data.weight };
         });
-        return unsort === null || unsort === void 0 ? void 0 : unsort.sort(function (a, b) { return a.pos - b.pos; });
+        return unsort === null || unsort === void 0 ? void 0 : unsort.sort((a, b) => a.pos - b.pos);
     });
-    var southEntries = unflat.flat().filter(function (entry) { return entry !== undefined; });
+    const southEntries = unflat.flat().filter((entry) => entry !== undefined);
     // Build the accumulator tree
-    var firstIndex = 1;
+    let firstIndex = 1;
     while (firstIndex < southLayer.length)
         firstIndex <<= 1;
-    var treeSize = 2 * firstIndex - 1;
+    const treeSize = 2 * firstIndex - 1;
     firstIndex -= 1;
-    var tree = Array(treeSize).fill(0, 0, treeSize);
+    const tree = Array(treeSize).fill(0, 0, treeSize);
     // Calculate the weighted crossings
-    var cc = 0;
-    southEntries === null || southEntries === void 0 ? void 0 : southEntries.forEach(function (entry) {
+    let cc = 0;
+    southEntries === null || southEntries === void 0 ? void 0 : southEntries.forEach((entry) => {
         if (entry) {
-            var index = entry.pos + firstIndex;
+            let index = entry.pos + firstIndex;
             tree[index] += entry.weight;
-            var weightSum = 0;
+            let weightSum = 0;
             while (index > 0) {
                 if (index % 2) {
                     weightSum += tree[index + 1];
@@ -53,11 +56,12 @@ var twoLayerCrossCount = function (g, northLayer, southLayer) {
     });
     return cc;
 };
-export var crossCount = function (g, layering) {
-    var cc = 0;
-    for (var i = 1; i < (layering === null || layering === void 0 ? void 0 : layering.length); i += 1) {
+const crossCount = (g, layering) => {
+    let cc = 0;
+    for (let i = 1; i < (layering === null || layering === void 0 ? void 0 : layering.length); i += 1) {
         cc += twoLayerCrossCount(g, layering[i - 1], layering[i]);
     }
     return cc;
 };
+exports.crossCount = crossCount;
 //# sourceMappingURL=cross-count.js.map

package/lib/antv-dagre/order/cross-count.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-count.js","sourceRoot":"","sources":["../../../src/antv-dagre/order/cross-count.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;;AAIH,kCAAoC;AAEpC,MAAM,kBAAkB,GAAG,CAAC,CAAQ,EAAE,UAAgB,EAAE,UAAgB,EAAE,EAAE;IAC1E,6EAA6E;IAC7E,4EAA4E;IAC5E,iCAAiC;IACjC,MAAM,QAAQ,GAAG,IAAA,gBAAS,EACxB,UAAU,EACV,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAC5B,CAAC;IACF,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,MAAM,MAAM,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACnD,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACjE,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IACH,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;IAE1E,6BAA6B;IAC7B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,UAAU,GAAG,UAAU,CAAC,MAAM;QAAE,UAAU,KAAK,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC;IACpC,UAAU,IAAI,CAAC,CAAC;IAChB,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAElD,mCAAmC;IACnC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC9B,IAAI,KAAK,EAAE;YACT,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,UAAU,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;YAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,OAAO,KAAK,GAAG,CAAC,EAAE;gBAChB,IAAI,KAAK,GAAG,CAAC,EAAE;oBACb,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;iBAC9B;gBACD,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;aAC7B;YACD,EAAE,IAAI,KAAK,CAAC,MAAO,GAAG,SAAS,CAAC;SACjC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AAEK,MAAM,UAAU,GAAG,CAAC,CAAQ,EAAE,QAAgB,EAAE,EAAE;IACvD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAG,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,CAAA,EAAE,CAAC,IAAI,CAAC,EAAE;QAC5C,EAAE,IAAI,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;KAC3D;IACD,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AANW,QAAA,UAAU,cAMrB"}

package/lib/{dagre → antv-dagre}/order/index.d.ts

@@ -1,2 +1,2 @@
-import { Graph as IGraph } from "../../types";
+import { Graph as IGraph } from '../../types';
 export declare const order: (g: IGraph, keepNodeOrder?: boolean) => void;