@antv/layout 0.3.11 → 1.0.0-alpha.0

package/lib/layout/dagre/src/nesting-graph.js

@@ -1,119 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var 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
- * 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 _a;
-    var root = (0, util_1.addDummyNode)(g, "root", {}, "_root");
-    var depths = treeDepths(g);
-    var maxDepth = Math.max.apply(Math, 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.edges().forEach(function (e) {
-        g.edge(e).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
-    (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach(function (child) {
-        dfs(g, root, nodeSep, weight, height, depths, child);
-    });
-    // Save the multiplier for node layers for later removal of empty border
-    // layers.
-    g.graph().nodeRankFactor = nodeSep;
-};
-var dfs = function (g, root, nodeSep, weight, height, depths, v) {
-    var children = g.children(v);
-    if (!(children === null || children === void 0 ? void 0 : children.length)) {
-        if (v !== root) {
-            g.setEdge(root, v, { weight: 0, minlen: nodeSep });
-        }
-        return;
-    }
-    var top = (0, util_1.addBorderNode)(g, "_bt");
-    var bottom = (0, util_1.addBorderNode)(g, "_bb");
-    var label = g.node(v);
-    g.setParent(top, v);
-    label.borderTop = top;
-    g.setParent(bottom, v);
-    label.borderBottom = bottom;
-    children === null || children === void 0 ? void 0 : children.forEach(function (child) {
-        dfs(g, root, nodeSep, weight, height, depths, child);
-        var childNode = g.node(child);
-        var childTop = childNode.borderTop ? childNode.borderTop : child;
-        var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
-        var thisWeight = childNode.borderTop ? weight : 2 * weight;
-        var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
-        g.setEdge(top, childTop, {
-            minlen: minlen,
-            weight: thisWeight,
-            nestingEdge: true,
-        });
-        g.setEdge(childBottom, bottom, {
-            minlen: minlen,
-            weight: thisWeight,
-            nestingEdge: true,
-        });
-    });
-    if (!g.parent(v)) {
-        g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
-    }
-};
-var treeDepths = function (g) {
-    var _a;
-    var depths = {};
-    var dfs = function (v, depth) {
-        var children = g.children(v);
-        children === null || children === void 0 ? void 0 : children.forEach(function (child) { return dfs(child, depth + 1); });
-        depths[v] = depth;
-    };
-    (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach(function (v) { return dfs(v, 1); });
-    return depths;
-};
-var sumWeights = function (g) {
-    var result = 0;
-    g.edges().forEach(function (e) {
-        result += g.edge(e).weight;
-    });
-    return result;
-};
-var cleanup = function (g) {
-    var graphLabel = g.graph();
-    graphLabel.nestingRoot && g.removeNode(graphLabel.nestingRoot);
-    delete graphLabel.nestingRoot;
-    g.edges().forEach(function (e) {
-        var edge = g.edge(e);
-        if (edge.nestingEdge) {
-            g.removeEdgeObj(e);
-        }
-    });
-};
-exports.default = { run: run, cleanup: cleanup };
-//# sourceMappingURL=nesting-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"nesting-graph.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/nesting-graph.ts"],"names":[],"mappings":";;AACA,+BAAqD;AAErD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,IAAM,GAAG,GAAG,UAAC,CAAQ;;IACnB,IAAM,IAAI,GAAG,IAAA,mBAAY,EAAC,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,EAAQ,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,IAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,yCAAyC;IACtE,IAAM,OAAO,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IAE/B,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,IAAI,CAAC;IAE7B,iEAAiE;IACjE,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,MAAO,IAAI,OAAO,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,6EAA6E;IAC7E,IAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEjC,uCAAuC;IACvC,MAAA,CAAC,CAAC,QAAQ,EAAE,0CAAE,OAAO,CAAC,UAAC,KAAK;QAC1B,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,wEAAwE;IACxE,UAAU;IACV,CAAC,CAAC,KAAK,EAAE,CAAC,cAAc,GAAG,OAAO,CAAC;AACrC,CAAC,CAAC;AAEF,IAAM,GAAG,GAAG,UACV,CAAQ,EACR,IAAY,EACZ,OAAe,EACf,MAAc,EACd,MAAc,EACd,MAA6B,EAC7B,CAAS;IAET,IAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,CAAA,EAAE;QACrB,IAAI,CAAC,KAAK,IAAI,EAAE;YACd,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;SACpD;QACD,OAAO;KACR;IAED,IAAM,GAAG,GAAG,IAAA,oBAAa,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACpC,IAAM,MAAM,GAAG,IAAA,oBAAa,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACvC,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;IAEzB,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC;IACtB,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvB,KAAK,CAAC,YAAY,GAAG,MAAM,CAAC;IAE5B,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QAErD,IAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;QACjC,IAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;QACnE,IAAM,WAAW,GAAG,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;QAC5E,IAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QAC7D,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,GAAG,EAAE,QAAQ,EAAE;YACvB,MAAM,QAAA;YACN,MAAM,EAAE,UAAU;YAClB,WAAW,EAAE,IAAI;SAClB,CAAC,CAAC;QAEH,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE;YAC7B,MAAM,QAAA;YACN,MAAM,EAAE,UAAU;YAClB,WAAW,EAAE,IAAI;SAClB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QAChB,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACjE;AACH,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAQ;;IAC1B,IAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,IAAM,GAAG,GAAG,UAAC,CAAS,EAAE,KAAa;QACnC,IAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC/B,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,EAArB,CAAqB,CAAC,CAAC;QACpD,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACpB,CAAC,CAAC;IACF,MAAA,CAAC,CAAC,QAAQ,EAAE,0CAAE,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAT,CAAS,CAAC,CAAC;IACxC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAQ;IAC1B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,MAAO,CAAC;IAC/B,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,OAAO,GAAG,UAAC,CAAQ;IACvB,IAAM,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAC7B,UAAU,CAAC,WAAW,IAAI,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IAC/D,OAAO,UAAU,CAAC,WAAW,CAAC;IAC9B,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAM;QACvB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,IAAI,CAAC,WAAW,EAAE;YACpB,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;SACpB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,EAAE,GAAG,KAAA,EAAE,OAAO,SAAA,EAAE,CAAC"}

package/lib/layout/dagre/src/normalize.d.ts

@@ -1,6 +0,0 @@
-import { Graph } from "../graph";
-declare const _default: {
-    run: (g: Graph) => void;
-    undo: (g: Graph) => void;
-};
-export default _default;

package/lib/layout/dagre/src/normalize.js

@@ -1,91 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var 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.
- *
- * 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 run = function (g) {
-    g.graph().dummyChains = [];
-    g.edges().forEach(function (edge) { return normalizeEdge(g, edge); });
-};
-var normalizeEdge = function (g, e) {
-    var v = e.v;
-    var vRank = g.node(v).rank;
-    var w = e.w;
-    var wRank = g.node(w).rank;
-    var name = e.name;
-    var edgeLabel = g.edge(e);
-    var labelRank = edgeLabel.labelRank;
-    if (wRank === vRank + 1)
-        return;
-    g.removeEdgeObj(e);
-    var graph = g.graph();
-    var dummy;
-    var attrs;
-    var i;
-    for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
-        edgeLabel.points = [];
-        attrs = {
-            edgeLabel: edgeLabel,
-            width: 0,
-            height: 0,
-            edgeObj: e,
-            rank: vRank,
-        };
-        dummy = (0, util_1.addDummyNode)(g, "edge", attrs, "_d");
-        if (vRank === labelRank) {
-            attrs.width = edgeLabel.width;
-            attrs.height = edgeLabel.height;
-            attrs.dummy = "edge-label";
-            attrs.labelpos = edgeLabel.labelpos;
-        }
-        g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);
-        if (i === 0) {
-            if (!graph.dummyChains)
-                graph.dummyChains = [];
-            graph.dummyChains.push(dummy);
-        }
-        v = dummy;
-    }
-    g.setEdge(v, w, { weight: edgeLabel.weight }, name);
-};
-var undo = function (g) {
-    var _a;
-    (_a = g.graph().dummyChains) === null || _a === void 0 ? void 0 : _a.forEach(function (v) {
-        var node = g.node(v);
-        var origLabel = node.edgeLabel;
-        var w;
-        if (node.edgeObj) {
-            g.setEdgeObj(node.edgeObj, origLabel);
-        }
-        var currentV = v;
-        while (node.dummy) {
-            w = g.successors(currentV)[0];
-            g.removeNode(currentV);
-            origLabel.points.push({ x: node.x, y: node.y });
-            if (node.dummy === "edge-label") {
-                origLabel.x = node.x;
-                origLabel.y = node.y;
-                origLabel.width = node.width;
-                origLabel.height = node.height;
-            }
-            currentV = w;
-            node = g.node(currentV);
-        }
-    });
-};
-exports.default = { run: run, undo: undo };
-//# sourceMappingURL=normalize.js.map

package/lib/layout/dagre/src/normalize.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"normalize.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/normalize.ts"],"names":[],"mappings":";;AACA,+BAAsC;AAEtC;;;;;;;;;;;;;;;GAeG;AACH,IAAM,GAAG,GAAG,UAAC,CAAQ;IACnB,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,EAAE,CAAC;IAC3B,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI,IAAK,OAAA,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,EAAtB,CAAsB,CAAC,CAAC;AACtD,CAAC,CAAC;AAEF,IAAM,aAAa,GAAG,UAAC,CAAQ,EAAE,CAAO;IACtC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAc,CAAC;IACtC,IAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACd,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAc,CAAC;IACxC,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;IACpB,IAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;IAC7B,IAAM,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC;IAEtC,IAAI,KAAK,KAAK,KAAK,GAAG,CAAC;QAAE,OAAO;IAEhC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAEnB,IAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAExB,IAAI,KAAa,CAAC;IAClB,IAAI,KAAgC,CAAC;IACrC,IAAI,CAAC,CAAC;IACN,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE;QAChD,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC;QACtB,KAAK,GAAG;YACN,SAAS,WAAA;YACT,KAAK,EAAE,CAAC;YACR,MAAM,EAAE,CAAC;YACT,OAAO,EAAE,CAAC;YACV,IAAI,EAAE,KAAK;SACZ,CAAC;QACF,KAAK,GAAG,IAAA,mBAAY,EAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7C,IAAI,KAAK,KAAK,SAAS,EAAE;YACvB,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,KAAM,CAAC;YAC/B,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,MAAO,CAAC;YACjC,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC;YAC3B,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;SACrC;QACD,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,CAAC;QACxD,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,IAAI,CAAC,KAAK,CAAC,WAAW;gBAAE,KAAK,CAAC,WAAW,GAAG,EAAE,CAAC;YAC/C,KAAK,CAAC,WAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAChC;QACD,CAAC,GAAG,KAAK,CAAC;KACX;IAED,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,CAAC;AACtD,CAAC,CAAC;AAEF,IAAM,IAAI,GAAG,UAAC,CAAQ;;IACpB,MAAA,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,0CAAE,OAAO,CAAC,UAAC,CAAC;QAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACtB,IAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,IAAI,CAAC,CAAC;QACN,IAAI,IAAI,CAAC,OAAO,EAAE;YAChB,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;SACvC;QAED,IAAI,QAAQ,GAAI,CAAC,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,EAAE;YACjB,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACvB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;YAChD,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,EAAE;gBAC/B,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBACrB,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBACrB,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC7B,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;aAChC;YACD,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC;SAC1B;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,EAAE,GAAG,KAAA,EAAE,IAAI,MAAA,EAAE,CAAC"}

package/lib/layout/dagre/src/order/add-subgraph-constraints.d.ts

@@ -1,3 +0,0 @@
-import { Graph } from "../../graph";
-declare const addSubgraphConstraints: (g: Graph, cg: Graph, vs: string[]) => void;
-export default addSubgraphConstraints;

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

@@ -1,29 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var addSubgraphConstraints = function (g, cg, vs) {
-    var prev = {};
-    var rootPrev;
-    vs === null || vs === void 0 ? void 0 : vs.forEach(function (v) {
-        var child = g.parent(v);
-        var parent;
-        var prevChild;
-        while (child) {
-            parent = g.parent(child);
-            if (parent) {
-                prevChild = prev[parent];
-                prev[parent] = child;
-            }
-            else {
-                prevChild = rootPrev;
-                rootPrev = child;
-            }
-            if (prevChild && prevChild !== child) {
-                cg.setEdge(prevChild, child);
-                return;
-            }
-            child = parent;
-        }
-    });
-};
-exports.default = addSubgraphConstraints;
-//# sourceMappingURL=add-subgraph-constraints.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"add-subgraph-constraints.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/add-subgraph-constraints.ts"],"names":[],"mappings":";;AAEA,IAAM,sBAAsB,GAAG,UAAC,CAAQ,EAAE,EAAS,EAAE,EAAY;IAC/D,IAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,IAAI,QAAgB,CAAC;IAErB,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,OAAO,CAAC,UAAC,CAAC;QACZ,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,MAAM,CAAC;QACX,IAAI,SAAS,CAAC;QACd,OAAO,KAAK,EAAE;YACZ,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzB,IAAI,MAAM,EAAE;gBACV,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;aACtB;iBAAM;gBACL,SAAS,GAAG,QAAQ,CAAC;gBACrB,QAAQ,GAAG,KAAK,CAAC;aAClB;YACD,IAAI,SAAS,IAAI,SAAS,KAAK,KAAK,EAAE;gBACpC,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAC7B,OAAO;aACR;YACD,KAAK,GAAG,MAAM,CAAC;SAChB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,sBAAsB,CAAC"}

package/lib/layout/dagre/src/order/barycenter.d.ts

@@ -1,11 +0,0 @@
-import { Graph } from "../../graph";
-declare const barycenter: (g: Graph, movable: string[]) => ({
-    v: string;
-    barycenter?: undefined;
-    weight?: undefined;
-} | {
-    v: string;
-    barycenter: number;
-    weight: number;
-})[];
-export default barycenter;

package/lib/layout/dagre/src/order/barycenter.js

@@ -1,26 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var barycenter = function (g, movable) {
-    return movable.map(function (v) {
-        var inV = g.inEdges(v);
-        if (!(inV === null || inV === void 0 ? void 0 : inV.length)) {
-            return { v: v };
-        }
-        {
-            var result_1 = { sum: 0, weight: 0 };
-            inV === null || inV === void 0 ? void 0 : inV.forEach(function (e) {
-                var edge = g.edge(e);
-                var nodeU = g.node(e.v);
-                result_1.sum += (edge.weight * nodeU.order);
-                result_1.weight += edge.weight;
-            });
-            return {
-                v: v,
-                barycenter: result_1.sum / result_1.weight,
-                weight: result_1.weight
-            };
-        }
-    });
-};
-exports.default = barycenter;
-//# sourceMappingURL=barycenter.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"barycenter.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/barycenter.ts"],"names":[],"mappings":";;AAEA,IAAM,UAAU,GAAG,UAAC,CAAQ,EAAE,OAAiB;IAC7C,OAAO,OAAO,CAAC,GAAG,CAAC,UAAC,CAAC;QACnB,IAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,CAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,MAAM,CAAA,EAAE;YAChB,OAAO,EAAE,CAAC,GAAA,EAAE,CAAC;SACd;QAAE;YACD,IAAM,QAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;YACrC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,OAAO,CAAC,UAAC,CAAC;gBACb,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;gBACxB,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;gBAC3B,QAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,GAAI,KAAK,CAAC,KAAgB,CAAC,CAAC;gBACvD,QAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAO,CAAC;YAChC,CAAC,CAAC,CAAC;YACH,OAAO;gBACL,CAAC,GAAA;gBACD,UAAU,EAAE,QAAM,CAAC,GAAG,GAAG,QAAM,CAAC,MAAM;gBACtC,MAAM,EAAE,QAAM,CAAC,MAAM;aACtB,CAAC;SACH;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,UAAU,CAAC"}

package/lib/layout/dagre/src/order/build-layer-graph.d.ts

@@ -1,3 +0,0 @@
-import { Graph } from "../../graph";
-declare const buildLayerGraph: (g: Graph, rank: number, relationship: "inEdges" | "outEdges") => Graph;
-export default buildLayerGraph;

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

@@ -1,73 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var graph_1 = require("../../graph");
-/*
- * 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.
- */
-var buildLayerGraph = function (g, rank, relationship) {
-    var root = createRootNode(g);
-    var result = new graph_1.Graph({ compound: true })
-        .setGraph({ root: root })
-        .setDefaultNodeLabel(function (v) {
-        return g.node(v);
-    });
-    g.nodes().forEach(function (v) {
-        var _a;
-        var node = g.node(v);
-        var parent = g.parent(v);
-        if (node.rank === rank ||
-            (node.minRank <= rank && rank <= node.maxRank)) {
-            result.setNode(v);
-            result.setParent(v, parent || root);
-            // This assumes we have only short edges!
-            (_a = g[relationship](v)) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
-                var u = e.v === v ? e.w : e.v;
-                var edge = result.edgeFromArgs(u, v);
-                var weight = edge !== undefined ? edge.weight : 0;
-                result.setEdge(u, v, { weight: g.edge(e).weight + weight });
-            });
-            if (node.hasOwnProperty("minRank")) {
-                result.setNode(v, {
-                    borderLeft: node.borderLeft[rank],
-                    borderRight: node.borderRight[rank],
-                });
-            }
-        }
-    });
-    return result;
-};
-var createRootNode = function (g) {
-    var v;
-    while (g.hasNode((v = "_root".concat(Math.random()))))
-        ;
-    return v;
-};
-exports.default = buildLayerGraph;
-//# sourceMappingURL=build-layer-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"build-layer-graph.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/build-layer-graph.ts"],"names":[],"mappings":";;AAAA,qCAAoC;AAEpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,IAAM,eAAe,GAAG,UACtB,CAAQ,EACR,IAAY,EACZ,YAAoC;IAEpC,IAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAM,MAAM,GAAG,IAAI,aAAK,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;SACzC,QAAQ,CAAC,EAAE,IAAI,MAAA,EAAE,CAAC;SAClB,mBAAmB,CAAC,UAAC,CAAS;QAC7B,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;IACpB,CAAC,CAAC,CAAC;IAEL,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAE3B,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;YAClB,CAAE,IAAI,CAAC,OAAkB,IAAI,IAAI,IAAI,IAAI,IAAK,IAAI,CAAC,OAAkB,CAAC,EACtE;YACA,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC,CAAC;YAEpC,yCAAyC;YACzC,MAAA,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;gBAC5B,IAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChC,IAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvC,IAAM,MAAM,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,MAAO,GAAG,MAAO,EAAE,CAAC,CAAC;YACjE,CAAC,CAAC,CAAC;YAEH,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE;gBAClC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE;oBAChB,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;oBACjC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;iBACpC,CAAC,CAAC;aACJ;SACF;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,cAAc,GAAG,UAAC,CAAQ;IAC9B,IAAI,CAAC,CAAC;IACN,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,eAAQ,IAAI,CAAC,MAAM,EAAE,CAAE,CAAC,CAAC;QAAC,CAAC;IACjD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,kBAAe,eAAe,CAAC"}

package/lib/layout/dagre/src/order/cross-count.d.ts

@@ -1,3 +0,0 @@
-import { Graph } from "../../graph";
-declare const crossCount: (g: Graph, layering: string[][]) => number;
-export default crossCount;

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

@@ -1,67 +0,0 @@
-"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.
- *
- * 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."
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-var util_1 = require("../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 = (0, util_1.zipObject)(southLayer, southLayer.map(function (v, i) { return i; }));
-    var unflat = northLayer.map(function (v) {
-        var _a;
-        var unsort = (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.map(function (e) {
-            return { pos: southPos[e.w] || 0, weight: g.edge(e).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;
-};
-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;
-};
-exports.default = crossCount;
-//# sourceMappingURL=cross-count.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"cross-count.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/cross-count.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;AAGH,gCAAoC;AAEpC,IAAM,kBAAkB,GAAG,UACzB,CAAQ,EACR,UAAoB,EACpB,UAAoB;IAEpB,6EAA6E;IAC7E,4EAA4E;IAC5E,iCAAiC;IACjC,IAAM,QAAQ,GAAG,IAAA,gBAAS,EACxB,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,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,GAAG,CAAC,UAAC,CAAC;YAClC,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC;QAChE,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,IAAM,UAAU,GAAG,UAAC,CAAQ,EAAE,QAAoB;IAChD,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;AAEF,kBAAe,UAAU,CAAC"}

package/lib/layout/dagre/src/order/index.d.ts

@@ -1,3 +0,0 @@
-import { Graph } from "../../graph";
-declare const order: (g: Graph) => void;
-export default order;

package/lib/layout/dagre/src/order/index.js

@@ -1,96 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-var init_order_1 = __importDefault(require("./init-order"));
-var cross_count_1 = __importDefault(require("./cross-count"));
-var build_layer_graph_1 = __importDefault(require("./build-layer-graph"));
-var add_subgraph_constraints_1 = __importDefault(require("./add-subgraph-constraints"));
-var sort_subgraph_1 = __importDefault(require("./sort-subgraph"));
-var util_1 = require("../../../../util");
-var graph_1 = require("../../graph");
-var util_2 = require("../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.
- */
-var order = function (g) {
-    var mxRank = (0, util_2.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, "inEdges");
-    var upLayerGraphs = buildLayerGraphs(g, range2, "outEdges");
-    var layering = (0, init_order_1.default)(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);
-        layering = (0, util_2.buildLayerMatrix)(g);
-        var cc = (0, cross_count_1.default)(g, layering);
-        if (cc < bestCC) {
-            lastBest = 0;
-            best = (0, util_1.clone)(layering);
-            bestCC = cc;
-        }
-    }
-    // consider use previous result, maybe somewhat reduendant
-    layering = (0, init_order_1.default)(g);
-    assignOrder(g, layering);
-    for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
-        sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2, true);
-        layering = (0, util_2.buildLayerMatrix)(g);
-        var cc = (0, cross_count_1.default)(g, layering);
-        if (cc < bestCC) {
-            lastBest = 0;
-            best = (0, util_1.clone)(layering);
-            bestCC = cc;
-        }
-    }
-    assignOrder(g, best);
-};
-var buildLayerGraphs = function (g, ranks, relationship) {
-    return ranks.map(function (rank) {
-        return (0, build_layer_graph_1.default)(g, rank, relationship);
-    });
-};
-var sweepLayerGraphs = function (layerGraphs, biasRight, usePrev) {
-    var cg = new graph_1.Graph();
-    layerGraphs === null || layerGraphs === void 0 ? void 0 : layerGraphs.forEach(function (lg) {
-        var _a;
-        var root = lg.graph().root;
-        var sorted = (0, sort_subgraph_1.default)(lg, root, cg, biasRight, usePrev);
-        for (var i = 0; i < ((_a = sorted.vs) === null || _a === void 0 ? void 0 : _a.length) || 0; i++) {
-            var lnode = lg.node(sorted.vs[i]);
-            if (lnode) {
-                lnode.order = i;
-            }
-        }
-        (0, add_subgraph_constraints_1.default)(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.node(v).order = i;
-        });
-    });
-};
-exports.default = order;
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/index.ts"],"names":[],"mappings":";;;;;AAAA,4DAAqC;AACrC,8DAAuC;AACvC,0EAAkD;AAClD,wFAAgE;AAChE,kEAA2C;AAC3C,yCAAyC;AACzC,qCAAoC;AACpC,gCAAoD;AAEpD;;;;;;;;;;;;;;GAcG;AACH,IAAM,KAAK,GAAG,UAAC,CAAQ;IACrB,IAAM,MAAM,GAAG,IAAA,cAAO,EAAC,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,SAAS,CAAC,CAAC;IAC/D,IAAM,aAAa,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAE9D,IAAI,QAAQ,GAAG,IAAA,oBAAS,EAAC,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,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAEtE,QAAQ,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,CAAC;QAC/B,IAAM,EAAE,GAAG,IAAA,qBAAU,EAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACnC,IAAI,EAAE,GAAG,MAAM,EAAE;YACf,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,GAAG,IAAA,YAAK,EAAC,QAAQ,CAAC,CAAC;YACvB,MAAM,GAAG,EAAE,CAAC;SACb;KACF;IAED,0DAA0D;IAC1D,QAAQ,GAAG,IAAA,oBAAS,EAAC,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,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QAE5E,QAAQ,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,CAAC;QAC/B,IAAM,EAAE,GAAG,IAAA,qBAAU,EAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACnC,IAAI,EAAE,GAAG,MAAM,EAAE;YACf,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,GAAG,IAAA,YAAK,EAAC,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,CAAQ,EACR,KAAe,EACf,YAAoC;IAEpC,OAAO,KAAK,CAAC,GAAG,CAAC,UAAC,IAAI;QACpB,OAAO,IAAA,2BAAe,EAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,gBAAgB,GAAG,UACvB,WAAoB,EACpB,SAAkB,EAClB,OAAiB;IAEjB,IAAM,EAAE,GAAG,IAAI,aAAK,EAAE,CAAC;IACvB,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,OAAO,CAAC,UAAC,EAAE;;QACtB,IAAM,IAAI,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,IAAc,CAAC;QACvC,IAAM,MAAM,GAAG,IAAA,uBAAY,EAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9D,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,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,KAAK,EAAE;gBACT,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;aACjB;SACF;QACD,IAAA,kCAAsB,EAAC,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,WAAW,GAAG,UAAC,CAAQ,EAAE,QAAoB;IACjD,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAS,EAAE,CAAS;YAClC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,KAAK,GAAG,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,KAAK,CAAC"}

package/lib/layout/dagre/src/order/init-data-order.d.ts

@@ -1,6 +0,0 @@
-import { Graph } from "../../graph";
-/**
- * 按照数据中的结果设置fixorder
- */
-declare const initDataOrder: (g: Graph, nodeOrder: string[]) => void;
-export default initDataOrder;

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

@@ -1,27 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * 按照数据中的结果设置fixorder
- */
-var initDataOrder = function (g, nodeOrder) {
-    var simpleNodes = g.nodes().filter(function (v) {
-        var _a;
-        return !((_a = g.children(v)) === null || _a === void 0 ? void 0 : _a.length);
-    });
-    var ranks = simpleNodes.map(function (v) { return g.node(v).rank; });
-    var maxRank = Math.max.apply(Math, ranks);
-    var layers = Array(maxRank + 1).fill([]);
-    nodeOrder === null || nodeOrder === void 0 ? void 0 : nodeOrder.forEach(function (n) {
-        var node = g.node(n);
-        // 只考虑原有节点，dummy节点需要按照后续算法排出
-        if (!node || (node === null || node === void 0 ? void 0 : node.dummy)) {
-            return;
-        }
-        if (!isNaN(node.rank)) {
-            node.fixorder = layers[node.rank].length; // 设置fixorder为当层的顺序
-            layers[node.rank].push(n);
-        }
-    });
-};
-exports.default = initDataOrder;
-//# sourceMappingURL=init-data-order.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"init-data-order.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/init-data-order.ts"],"names":[],"mappings":";;AAEA;;GAEG;AACH,IAAM,aAAa,GAAG,UAAC,CAAQ,EAAE,SAAmB;IAClD,IAAM,WAAW,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,UAAC,CAAC;;QACrC,OAAO,CAAC,CAAA,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,MAAM,CAAA,CAAC;IAChC,CAAC,CAAC,CAAC;IACH,IAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAc,EAAzB,CAAyB,CAAC,CAAC;IAChE,IAAM,OAAO,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,KAAK,CAAC,CAAC;IACnC,IAAM,MAAM,GAAe,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEvD,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,OAAO,CAAC,UAAC,CAAC;QACnB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,4BAA4B;QAC5B,IAAI,CAAC,IAAI,KAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,KAAK,CAAA,EAAE;YACxB,OAAO;SACR;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAc,CAAC,EAAE;YAC/B,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC,MAAM,CAAC,CAAC,mBAAmB;YACvE,MAAM,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACrC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,aAAa,CAAC"}

package/lib/layout/dagre/src/order/init-order.d.ts

@@ -1,3 +0,0 @@
-import { Graph } from "../../graph";
-declare const initOrder: (g: Graph) => string[][];
-export default initOrder;