@antv/layout 1.2.0 → 1.2.2

package/lib/dagre/nesting-graph.js

@@ -0,0 +1,153 @@
+import { __read, __spreadArray } from "tslib";
+import { addBorderNode, addDummyNode } from "./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
+ * these boundries, and ensures that the graph is connected.
+ *
+ * In addition we ensure, through the use of the minlen property, that nodes
+ * and subgraph border nodes to not end up on the same rank.
+ *
+ * Preconditions:
+ *
+ *    1. Input graph is a DAG
+ *    2. Nodes in the input graph has a minlen attribute
+ *
+ * Postconditions:
+ *
+ *    1. Input graph is connected.
+ *    2. Dummy nodes are added for the tops and bottoms of subgraphs.
+ *    3. The minlen attribute for nodes is adjusted to ensure nodes do not
+ *       get placed on the same rank as subgraph border nodes.
+ *
+ * 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))));
+    if (Math.abs(maxDepth) === Infinity) {
+        maxDepth = 1;
+    }
+    var height = maxDepth - 1; // Note: depths is an Object not an array
+    var nodeSep = 2 * height + 1;
+    // g.graph().nestingRoot = root;
+    // Multiply minlen by nodeSep to align nodes on non-border ranks.
+    g.getAllEdges().forEach(function (e) {
+        e.data.minlen *= nodeSep;
+    });
+    // Calculate a weight that is sufficient to keep subgraphs vertically compact
+    var 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) {
+        dfs(g, root, nodeSep, weight, height, depths, child.id);
+    });
+    // Save the multiplier for node layers for later removal of empty border
+    // layers.
+    // g.graph().nodeRankFactor = nodeSep;
+    return {
+        nestingRoot: root,
+        nodeRankFactor: nodeSep,
+    };
+};
+var dfs = function (g, root, nodeSep, weight, height, depths, v) {
+    var 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(),
+                source: root,
+                target: v,
+                data: { weight: 0, minlen: nodeSep },
+            });
+        }
+        return;
+    }
+    var top = addBorderNode(g, "_bt");
+    var bottom = addBorderNode(g, "_bb");
+    var 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) {
+        dfs(g, root, nodeSep, weight, height, depths, childNode.id);
+        var childTop = childNode.data.borderTop
+            ? childNode.data.borderTop
+            : childNode.id;
+        var 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;
+        g.addEdge({
+            id: "e" + Math.random(),
+            source: top,
+            target: childTop,
+            data: {
+                minlen: minlen,
+                weight: thisWeight,
+                nestingEdge: true,
+            },
+        });
+        g.addEdge({
+            id: "e" + Math.random(),
+            source: childBottom,
+            target: bottom,
+            data: {
+                minlen: minlen,
+                weight: thisWeight,
+                nestingEdge: true,
+            },
+        });
+    });
+    if (!g.getParent(v)) {
+        g.addEdge({
+            id: "e" + Math.random(),
+            source: root,
+            target: top,
+            data: {
+                weight: 0,
+                minlen: 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); });
+        depths[v] = depth;
+    };
+    // g.children()?.forEach((v) => dfs(v, 1));
+    g.getRoots().forEach(function (v) { return dfs(v.id, 1); });
+    return depths;
+};
+var sumWeights = function (g) {
+    var result = 0;
+    g.getAllEdges().forEach(function (e) {
+        result += e.data.weight;
+    });
+    return result;
+};
+var cleanup = function (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) {
+        if (e.data.nestingEdge) {
+            g.removeEdge(e.id);
+        }
+    });
+};
+export { run, cleanup };
+//# sourceMappingURL=nesting-graph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.js","sourceRoot":"","sources":["../../src/dagre/nesting-graph.ts"],"names":[],"mappings":";AAEA,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,IAAM,GAAG,GAAG,UAAC,CAAS;IACpB,IAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IAClD,IAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAC,CAAC;IAElD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,QAAQ,EAAE;QACnC,QAAQ,GAAG,CAAC,CAAC;KACd;IAED,IAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,yCAAyC;IACtE,IAAM,OAAO,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IAE/B,gCAAgC;IAEhC,iEAAiE;IACjE,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,OAAO,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,6EAA6E;IAC7E,IAAM,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,UAAC,KAAK;QACzB,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;AAEF,IAAM,GAAG,GAAG,UACV,CAAS,EACT,IAAQ,EACR,OAAe,EACf,MAAc,EACd,MAAc,EACd,MAA8B,EAC9B,CAAK;IAEL,IAAM,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,MAAI,IAAI,CAAC,MAAM,EAAI;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,IAAM,GAAG,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACpC,IAAM,MAAM,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACvC,IAAM,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,UAAC,SAAS;QAC1B,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;QAE5D,IAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS;YACvC,CAAC,CAAE,SAAS,CAAC,IAAI,CAAC,SAAgB;YAClC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QACjB,IAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY;YAC7C,CAAC,CAAE,SAAS,CAAC,IAAI,CAAC,YAAmB;YACrC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QACjB,IAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QAClE,IAAM,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,MAAI,IAAI,CAAC,MAAM,EAAI;YACvB,MAAM,EAAE,GAAG;YACX,MAAM,EAAE,QAAQ;YAChB,IAAI,EAAE;gBACJ,MAAM,QAAA;gBACN,MAAM,EAAE,UAAU;gBAClB,WAAW,EAAE,IAAI;aAClB;SACF,CAAC,CAAC;QAEH,CAAC,CAAC,OAAO,CAAC;YACR,EAAE,EAAE,MAAI,IAAI,CAAC,MAAM,EAAI;YACvB,MAAM,EAAE,WAAW;YACnB,MAAM,EAAE,MAAM;YACd,IAAI,EAAE;gBACJ,MAAM,QAAA;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,MAAI,IAAI,CAAC,MAAM,EAAI;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,IAAM,UAAU,GAAG,UAAC,CAAS;IAC3B,IAAM,MAAM,GAAuB,EAAE,CAAC;IACtC,IAAM,GAAG,GAAG,UAAC,CAAK,EAAE,KAAa;QAC/B,IAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,EAAxB,CAAwB,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACpB,CAAC,CAAC;IACF,2CAA2C;IAE3C,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAZ,CAAY,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAS;IAC3B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACxB,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;IAC3B,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,OAAO,GAAG,UAAC,CAAS,EAAE,WAAgB;IAC1C,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,UAAC,CAAC;QACxB,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;AAEF,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC"}

package/lib/dagre/normalize.js

@@ -0,0 +1,98 @@
+import { addDummyNode } from "./util";
+/*
+ * Breaks any long edges in the graph into short segments that span 1 layer
+ * each. This operation is undoable with the denormalize function.
+ *
+ * Pre-conditions:
+ *
+ *    1. The input graph is a DAG.
+ *    2. Each node in the graph has a "rank" property.
+ *
+ * Post-condition:
+ *
+ *    1. All edges in the graph have a length of 1.
+ *    2. Dummy nodes are added where edges have been split into segments.
+ *    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); });
+};
+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;
+    if (wRank === vRank + 1)
+        return;
+    g.removeEdge(e.id);
+    var dummy;
+    var nodeData;
+    var i;
+    for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
+        e.data.points = [];
+        nodeData = {
+            originalEdge: e,
+            width: 0,
+            height: 0,
+            rank: vRank,
+        };
+        dummy = addDummyNode(g, DUMMY_NODE_EDGE, nodeData, "_d");
+        if (vRank === labelRank) {
+            nodeData.width = e.data.width;
+            nodeData.height = e.data.height;
+            nodeData.dummy = DUMMY_NODE_EDGE_LABEL;
+            nodeData.labelpos = e.data.labelpos;
+        }
+        g.addEdge({
+            id: "e" + Math.random(),
+            source: v,
+            target: dummy,
+            data: { weight: e.data.weight },
+        });
+        if (i === 0) {
+            dummyChains.push(dummy);
+        }
+        v = dummy;
+    }
+    g.addEdge({
+        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;
+        // Restore original edge.
+        if (originalEdge) {
+            g.addEdge(originalEdge);
+        }
+        var currentV = v;
+        while (node.data.dummy) {
+            w = g.getSuccessors(currentV)[0];
+            g.removeNode(currentV);
+            originalEdge.data.points.push({
+                x: node.data.x,
+                y: node.data.y,
+            });
+            if (node.data.dummy === DUMMY_NODE_EDGE_LABEL) {
+                originalEdge.data.x = node.data.x;
+                originalEdge.data.y = node.data.y;
+                originalEdge.data.width = node.data.width;
+                originalEdge.data.height = node.data.height;
+            }
+            currentV = w.id;
+            node = g.getNode(currentV);
+        }
+    });
+};
+export { run, undo };
+//# sourceMappingURL=normalize.js.map

package/lib/dagre/normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sourceRoot":"","sources":["../../src/dagre/normalize.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC;AAEtC;;;;;;;;;;;;;;;GAeG;AAEH,IAAM,eAAe,GAAG,MAAM,CAAC;AAC/B,IAAM,qBAAqB,GAAG,YAAY,CAAC;AAE3C,IAAM,GAAG,GAAG,UAAC,CAAS,EAAE,WAAiB;IACvC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI,IAAK,OAAA,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,EAAnC,CAAmC,CAAC,CAAC;AACzE,CAAC,CAAC;AAEF,IAAM,aAAa,GAAG,UAAC,CAAS,EAAE,CAAiB,EAAE,WAAiB;IACpE,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACjB,IAAI,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,IAAK,CAAC;IACrC,IAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,IAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,IAAK,CAAC;IACvC,IAAM,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,YAAY,CAAC,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,MAAI,IAAI,CAAC,MAAM,EAAI;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,MAAI,IAAI,CAAC,MAAM,EAAI;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,IAAM,IAAI,GAAG,UAAC,CAAS,EAAE,WAAiB;IACxC,WAAW,CAAC,OAAO,CAAC,UAAC,CAAC;QACpB,IAAI,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QACjB,IAAA,IAAI,GAAK,IAAI,KAAT,CAAU;QACtB,IAAM,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;AAEF,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC"}

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

@@ -0,0 +1,41 @@
+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;
+        while (child) {
+            parent = g.getParent(child.id);
+            if (parent) {
+                prevChild = prev[parent.id];
+                prev[parent.id] = child.id;
+            }
+            else {
+                prevChild = rootPrev;
+                rootPrev = child.id;
+            }
+            if (prevChild && prevChild !== child.id) {
+                cg.addNodes([
+                    {
+                        id: prevChild,
+                        data: {},
+                    },
+                    {
+                        id: child.id,
+                        data: {},
+                    },
+                ]);
+                cg.addEdge({
+                    id: "e" + prevChild + "-" + child.id,
+                    source: prevChild,
+                    target: child.id,
+                    data: {},
+                });
+                return;
+            }
+            child = parent;
+        }
+    });
+};
+//# sourceMappingURL=add-subgraph-constraints.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"add-subgraph-constraints.js","sourceRoot":"","sources":["../../../src/dagre/order/add-subgraph-constraints.ts"],"names":[],"mappings":"AAGA,MAAM,CAAC,IAAM,sBAAsB,GAAG,UAAC,CAAQ,EAAE,EAAS,EAAE,EAAQ;IAClE,IAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,QAAY,CAAC;IAEjB,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,OAAO,CAAC,UAAC,CAAC;QACZ,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,EAAE,CAAC,QAAQ,CAAC;oBACV;wBACE,EAAE,EAAE,SAAS;wBACb,IAAI,EAAE,EAAE;qBACT;oBACD;wBACE,EAAE,EAAE,KAAK,CAAC,EAAE;wBACZ,IAAI,EAAE,EAAE;qBACT;iBACF,CAAC,CAAC;gBACH,EAAE,CAAC,OAAO,CAAC;oBACT,EAAE,EAAE,MAAI,SAAS,SAAI,KAAK,CAAC,EAAI;oBAC/B,MAAM,EAAE,SAAS;oBACjB,MAAM,EAAE,KAAK,CAAC,EAAE;oBAChB,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,OAAO;aACR;YACD,KAAK,GAAG,MAAM,CAAC;SAChB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/lib/dagre/order/barycenter.js

@@ -0,0 +1,23 @@
+/**
+ * TODO: The median method consistently performs better than the barycenter method and has a slight theoretical advantage
+ */
+export var barycenter = function (g, movable) {
+    return movable.map(function (v) {
+        var inV = g.getRelatedEdges(v, "in");
+        if (!(inV === null || inV === void 0 ? void 0 : inV.length)) {
+            return { v: v };
+        }
+        var result = { sum: 0, weight: 0 };
+        inV === null || inV === void 0 ? void 0 : inV.forEach(function (e) {
+            var nodeU = g.getNode(e.source);
+            result.sum += e.data.weight * nodeU.data.order;
+            result.weight += e.data.weight;
+        });
+        return {
+            v: v,
+            barycenter: result.sum / result.weight,
+            weight: result.weight,
+        };
+    });
+};
+//# sourceMappingURL=barycenter.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"barycenter.js","sourceRoot":"","sources":["../../../src/dagre/order/barycenter.ts"],"names":[],"mappings":"AAGA;;GAEG;AACH,MAAM,CAAC,IAAM,UAAU,GAAG,UAAC,CAAQ,EAAE,OAAa;IAChD,OAAO,OAAO,CAAC,GAAG,CAAC,UAAC,CAAC;QACnB,IAAM,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,GAAA,EAAE,CAAC;SACd;QAED,IAAM,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QACrC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,OAAO,CAAC,UAAC,CAAC;YACb,IAAM,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,GAAA;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"}

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

@@ -0,0 +1,96 @@
+import { __assign } from "tslib";
+import { Graph } from "@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
+ * hierarchy and any edges that are incident on these nodes and are of the type
+ * requested by the "relationship" parameter.
+ *
+ * Nodes from the requested rank that do not have parents are assigned a root
+ * node in the output graph, which is set in the root graph attribute. This
+ * makes it easy to walk the hierarchy of movable nodes during ordering.
+ *
+ * Pre-conditions:
+ *
+ *    1. Input graph is a DAG
+ *    2. Base nodes in the input graph have a rank attribute
+ *    3. Subgraph nodes in the input graph has minRank and maxRank attributes
+ *    4. Edges have an assigned weight
+ *
+ * Post-conditions:
+ *
+ *    1. Output graph has all nodes in the movable rank with preserved
+ *       hierarchy.
+ *    2. Root nodes in the movable layer are made children of the node
+ *       indicated by the root attribute of the graph.
+ *    3. Non-movable nodes incident on movable nodes, selected by the
+ *       relationship parameter, are included in the graph (without hierarchy).
+ *    4. Edges incident on movable nodes, selected by the relationship
+ *       parameter, are added to the output graph.
+ *    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({
+        tree: [
+            {
+                id: root,
+                children: [],
+                data: {},
+            },
+        ],
+    });
+    g.getAllNodes().forEach(function (v) {
+        var 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));
+            }
+            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.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;
+                if (!result.hasNode(u)) {
+                    result.addNode(__assign({}, g.getNode(u)));
+                }
+                var edge = result
+                    .getRelatedEdges(u, "out")
+                    .find(function (_a) {
+                    var target = _a.target;
+                    return target === v.id;
+                });
+                var weight = edge !== undefined ? edge.data.weight : 0;
+                if (!edge) {
+                    result.addEdge({
+                        id: e.id,
+                        source: u,
+                        target: v.id,
+                        data: {
+                            weight: e.data.weight + weight,
+                        },
+                    });
+                }
+                else {
+                    result.updateEdgeData(edge.id, __assign(__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] }));
+            }
+        }
+    });
+    return result;
+};
+var createRootNode = function (g) {
+    var v;
+    while (g.hasNode((v = "_root" + Math.random())))
+        ;
+    return v;
+};
+//# sourceMappingURL=build-layer-graph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"build-layer-graph.js","sourceRoot":"","sources":["../../../src/dagre/order/build-layer-graph.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,KAAK,EAAM,MAAM,gBAAgB,CAAC;AAG3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,CAAC,IAAM,eAAe,GAAG,UAC7B,CAAS,EACT,IAAY,EACZ,SAAuB;IAEvB,IAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAM,MAAM,GAAG,IAAI,KAAK,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,UAAC,CAAC;QACxB,IAAM,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,cAAM,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,cAAM,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,UAAC,CAAC;gBAC3C,IAAM,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,cAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAG,CAAC;iBACrC;gBAED,IAAM,IAAI,GAAG,MAAM;qBAChB,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC;qBACzB,IAAI,CAAC,UAAC,EAAU;wBAAR,MAAM,YAAA;oBAAO,OAAA,MAAM,KAAK,CAAC,CAAC,EAAE;gBAAf,CAAe,CAAC,CAAC;gBACzC,IAAM,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,wBACxB,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,wBACrB,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;AAEF,IAAM,cAAc,GAAG,UAAC,CAAS;IAC/B,IAAI,CAAC,CAAC;IACN,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,UAAQ,IAAI,CAAC,MAAM,EAAI,CAAC,CAAC;QAAC,CAAC;IACjD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC"}

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

@@ -0,0 +1,63 @@
+/*
+ * 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.
+ *
+ * Pre-conditions:
+ *
+ *    1. Input graph must be simple (not a multigraph), directed, and include
+ *       only simple edges.
+ *    2. Edges in the input graph must have assigned weights.
+ *
+ * Post-conditions:
+ *
+ *    1. The graph and layering matrix are left unchanged.
+ *
+ * This algorithm is derived from Barth, et al., "Bilayer Cross Counting."
+ */
+import { zipObject } from "../util";
+var twoLayerCrossCount = function (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) {
+            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; });
+    });
+    var southEntries = unflat.flat().filter(function (entry) { return entry !== undefined; });
+    // Build the accumulator tree
+    var firstIndex = 1;
+    while (firstIndex < southLayer.length)
+        firstIndex <<= 1;
+    var treeSize = 2 * firstIndex - 1;
+    firstIndex -= 1;
+    var 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) {
+        if (entry) {
+            var index = entry.pos + firstIndex;
+            tree[index] += entry.weight;
+            var weightSum = 0;
+            while (index > 0) {
+                if (index % 2) {
+                    weightSum += tree[index + 1];
+                }
+                index = (index - 1) >> 1;
+                tree[index] += entry.weight;
+            }
+            cc += entry.weight * weightSum;
+        }
+    });
+    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) {
+        cc += twoLayerCrossCount(g, layering[i - 1], layering[i]);
+    }
+    return cc;
+};
+//# sourceMappingURL=cross-count.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cross-count.js","sourceRoot":"","sources":["../../../src/dagre/order/cross-count.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEpC,IAAM,kBAAkB,GAAG,UAAC,CAAQ,EAAE,UAAgB,EAAE,UAAgB;IACtE,6EAA6E;IAC7E,4EAA4E;IAC5E,iCAAiC;IACjC,IAAM,QAAQ,GAAG,SAAS,CACxB,UAAU,EACV,UAAU,CAAC,GAAG,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,EAAD,CAAC,CAAC,CAC5B,CAAC;IACF,IAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,UAAC,CAAC;QAC9B,IAAM,MAAM,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,UAAC,CAAC;YAC/C,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,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAb,CAAa,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IACH,IAAM,YAAY,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,UAAC,KAAK,IAAK,OAAA,KAAK,KAAK,SAAS,EAAnB,CAAmB,CAAC,CAAC;IAE1E,6BAA6B;IAC7B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,UAAU,GAAG,UAAU,CAAC,MAAM;QAAE,UAAU,KAAK,CAAC,CAAC;IACxD,IAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC;IACpC,UAAU,IAAI,CAAC,CAAC;IAChB,IAAM,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,UAAC,KAAK;QAC1B,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;AAEF,MAAM,CAAC,IAAM,UAAU,GAAG,UAAC,CAAQ,EAAE,QAAgB;IACnD,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"}

package/lib/dagre/order/index.js

@@ -0,0 +1,91 @@
+import { initOrder } from "./init-order";
+import { crossCount } from "./cross-count";
+import { buildLayerGraph } from "./build-layer-graph";
+import { addSubgraphConstraints } from "./add-subgraph-constraints";
+import { sortSubgraph } from "./sort-subgraph";
+import { buildLayerMatrix, maxRank } from "../util";
+import { Graph } from "@antv/graphlib";
+import { clone } from "@antv/util";
+/*
+ * Applies heuristics to minimize edge crossings in the graph and sets the best
+ * order solution as an order attribute on each node.
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be DAG
+ *    2. Graph nodes must be objects with a "rank" attribute
+ *    3. Graph edges must have the "weight" attribute
+ *
+ * Post-conditions:
+ *
+ *    1. Graph nodes will have an "order" attribute based on the results of the
+ *       algorithm.
+ */
+export var order = function (g, keepNodeOrder) {
+    var mxRank = maxRank(g);
+    var range1 = [];
+    var range2 = [];
+    for (var i = 1; i < mxRank + 1; i++)
+        range1.push(i);
+    for (var i = mxRank - 1; i > -1; i--)
+        range2.push(i);
+    var downLayerGraphs = buildLayerGraphs(g, range1, "in");
+    var upLayerGraphs = buildLayerGraphs(g, range2, "out");
+    var layering = initOrder(g);
+    assignOrder(g, layering);
+    var bestCC = Number.POSITIVE_INFINITY;
+    var best;
+    for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
+        sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2, false, keepNodeOrder);
+        layering = buildLayerMatrix(g);
+        var cc = crossCount(g, layering);
+        if (cc < bestCC) {
+            lastBest = 0;
+            best = clone(layering);
+            bestCC = cc;
+        }
+    }
+    // consider use previous result, maybe somewhat reduendant
+    layering = initOrder(g);
+    assignOrder(g, layering);
+    for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
+        sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2, true, keepNodeOrder);
+        layering = buildLayerMatrix(g);
+        var cc = crossCount(g, layering);
+        if (cc < bestCC) {
+            lastBest = 0;
+            best = clone(layering);
+            bestCC = cc;
+        }
+    }
+    assignOrder(g, best);
+};
+var buildLayerGraphs = function (g, ranks, direction) {
+    return ranks.map(function (rank) {
+        return buildLayerGraph(g, rank, direction);
+    });
+};
+var sweepLayerGraphs = function (layerGraphs, biasRight, usePrev, keepNodeOrder) {
+    var cg = new Graph();
+    layerGraphs === null || layerGraphs === void 0 ? void 0 : layerGraphs.forEach(function (lg) {
+        var _a;
+        // const root = lg.graph().root as string;
+        var root = lg.getRoots()[0].id;
+        var sorted = sortSubgraph(lg, root, cg, biasRight, usePrev, keepNodeOrder);
+        for (var i = 0; i < ((_a = sorted.vs) === null || _a === void 0 ? void 0 : _a.length) || 0; i++) {
+            var lnode = lg.getNode(sorted.vs[i]);
+            if (lnode) {
+                lnode.data.order = i;
+            }
+        }
+        addSubgraphConstraints(lg, cg, sorted.vs);
+    });
+};
+var assignOrder = function (g, layering) {
+    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
+        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v, i) {
+            g.getNode(v).data.order = i;
+        });
+    });
+};
+//# sourceMappingURL=index.js.map

package/lib/dagre/order/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/dagre/order/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAEpD,OAAO,EAAE,KAAK,EAAM,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,IAAM,KAAK,GAAG,UAAC,CAAS,EAAE,aAAuB;IACtD,IAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAM,MAAM,GAAG,EAAE,CAAC;IAClB,IAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrD,IAAM,eAAe,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IAC1D,IAAM,aAAa,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAEzD,IAAI,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC5B,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAEzB,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACtC,IAAI,IAAgB,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE;QAC3D,gBAAgB,CACd,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,aAAa,EACvC,CAAC,GAAG,CAAC,IAAI,CAAC,EACV,KAAK,EACL,aAAa,CACd,CAAC;QAEF,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAM,EAAE,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACnC,IAAI,EAAE,GAAG,MAAM,EAAE;YACf,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvB,MAAM,GAAG,EAAE,CAAC;SACb;KACF;IAED,0DAA0D;IAC1D,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE;QAC3D,gBAAgB,CACd,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,aAAa,EACvC,CAAC,GAAG,CAAC,IAAI,CAAC,EACV,IAAI,EACJ,aAAa,CACd,CAAC;QAEF,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAM,EAAE,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACnC,IAAI,EAAE,GAAG,MAAM,EAAE;YACf,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvB,MAAM,GAAG,EAAE,CAAC;SACb;KACF;IACD,WAAW,CAAC,CAAC,EAAE,IAAK,CAAC,CAAC;AACxB,CAAC,CAAC;AAEF,IAAM,gBAAgB,GAAG,UACvB,CAAS,EACT,KAAe,EACf,SAAuB;IAEvB,OAAO,KAAK,CAAC,GAAG,CAAC,UAAC,IAAI;QACpB,OAAO,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,gBAAgB,GAAG,UACvB,WAAqB,EACrB,SAAkB,EAClB,OAAiB,EACjB,aAAuB;IAEvB,IAAM,EAAE,GAAG,IAAI,KAAK,EAAE,CAAC;IACvB,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,OAAO,CAAC,UAAC,EAAE;;QACtB,0CAA0C;QAC1C,IAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,IAAM,MAAM,GAAG,YAAY,CACzB,EAAE,EACF,IAAI,EACJ,EAAE,EACF,SAAS,EACT,OAAO,EACP,aAAa,CACd,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAG,MAAA,MAAM,CAAC,EAAE,0CAAE,MAAM,CAAA,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAC/C,IAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACvC,IAAI,KAAK,EAAE;gBACT,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;aACtB;SACF;QACD,sBAAsB,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,WAAW,GAAG,UAAC,CAAS,EAAE,QAAgB;IAC9C,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAK,EAAE,CAAS;YAC9B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/lib/dagre/order/init-data-order.js

@@ -0,0 +1,28 @@
+import { __read, __spreadArray } from "tslib";
+/**
+ * 按照数据中的结果设置fixorder
+ */
+export var initDataOrder = function (g, nodeOrder) {
+    var simpleNodes = g.getAllNodes().filter(function (v) {
+        var _a;
+        return !((_a = g.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length);
+    });
+    var ranks = simpleNodes.map(function (v) { return v.data.rank; });
+    var maxRank = Math.max.apply(Math, __spreadArray([], __read(ranks)));
+    var layers = [];
+    for (var i = 0; i < maxRank + 1; i++) {
+        layers[i] = [];
+    }
+    nodeOrder === null || nodeOrder === void 0 ? void 0 : nodeOrder.forEach(function (n) {
+        var node = g.getNode(n);
+        // 只考虑原有节点，dummy节点需要按照后续算法排出
+        if (!node || node.data.dummy) {
+            return;
+        }
+        if (!isNaN(node.data.rank)) {
+            node.data.fixorder = layers[node.data.rank].length; // 设置fixorder为当层的顺序
+            layers[node.data.rank].push(n);
+        }
+    });
+};
+//# sourceMappingURL=init-data-order.js.map

package/lib/dagre/order/init-data-order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"init-data-order.js","sourceRoot":"","sources":["../../../src/dagre/order/init-data-order.ts"],"names":[],"mappings":";AAGA;;GAEG;AACH,MAAM,CAAC,IAAM,aAAa,GAAG,UAAC,CAAQ,EAAE,SAAgB;IACtD,IAAM,WAAW,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,UAAC,CAAC;;QAC3C,OAAO,CAAC,CAAA,MAAA,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,0CAAE,MAAM,CAAA,CAAC;IACtC,CAAC,CAAC,CAAC;IACH,IAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,IAAK,EAAZ,CAAY,CAAC,CAAC;IACnD,IAAM,OAAO,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,KAAK,GAAC,CAAC;IACnC,IAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;KAChB;IAED,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,OAAO,CAAC,UAAC,CAAC;QACnB,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,4BAA4B;QAC5B,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC5B,OAAO;SACR;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,EAAE;YAC3B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,MAAM,CAAC,CAAC,mBAAmB;YACxE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACjC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}