@antv/layout 0.1.19-beta.4 → 0.1.21

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

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

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

@@ -0,0 +1,27 @@
+"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 = [];
+    for (var i = 0; i < maxRank + 1; i++) {
+        layers.push([]);
+    }
+    nodeOrder.forEach(function (n) {
+        var node = g.node(n);
+        // 只考虑原有节点，dummy节点需要按照后续算法排出
+        if (!node || node.dummy)
+            return;
+        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

@@ -0,0 +1 @@
+{"version":3,"file":"init-data-order.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/init-data-order.ts"],"names":[],"mappings":";;AAIA;;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,OAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAe,EAA1B,CAA0B,CAAC,CAAC;IACjE,IAAM,OAAO,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,KAAK,CAAC,CAAC;IACnC,IAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAG,EAAE;QACrC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACjB;IACD,SAAS,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,4BAA4B;QAC5B,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QAChC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAE,IAAI,CAAC,IAAe,CAAC,CAAC,MAAM,CAAC,CAAC,mBAAmB;QACzE,MAAM,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,aAAa,CAAC"}

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

@@ -0,0 +1,4 @@
+import { graphlib as IGraphLib } from "../../graphlib";
+declare type Graph = IGraphLib.Graph;
+declare const initOrder: (g: Graph) => any;
+export default initOrder;

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

@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/*
+ * Assigns an initial order value for each node by performing a DFS search
+ * starting from nodes in the first rank. Nodes are assigned an order in their
+ * rank as they are first visited.
+ *
+ * This approach comes from Gansner, et al., "A Technique for Drawing Directed
+ * Graphs."
+ *
+ * Returns a layering matrix with an array per layer and each layer sorted by
+ * the order of its nodes.
+ */
+var initOrder = function (g) {
+    var visited = {};
+    var simpleNodes = g.nodes().filter(function (v) {
+        var _a;
+        return !((_a = g.children(v)) === null || _a === void 0 ? void 0 : _a.length);
+    });
+    var nodeRanks = simpleNodes.map(function (v) { return g.node(v).rank; });
+    var maxRank = Math.max.apply(Math, nodeRanks);
+    var layers = [];
+    for (var i = 0; i < maxRank + 1; i++) {
+        layers.push([]);
+    }
+    // const layers = _.map(_.range(maxRank + 1), function() { return []; });
+    var dfs = function (v) {
+        var _a;
+        if (visited.hasOwnProperty(v))
+            return;
+        visited[v] = true;
+        var node = g.node(v);
+        layers[node.rank].push(v);
+        (_a = g.successors(v)) === null || _a === void 0 ? void 0 : _a.forEach(function (child) { return dfs(child); });
+    };
+    var orderedVs = simpleNodes.sort(function (a, b) { return g.node(a).rank - g.node(b).rank; });
+    // const orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });
+    // 有fixOrder的，直接排序好放进去
+    var beforeSort = orderedVs.filter(function (n) {
+        return g.node(n).fixorder !== undefined;
+    });
+    var fixOrderNodes = beforeSort.sort(function (a, b) { return g.node(a).fixorder - g.node(b).fixorder; });
+    fixOrderNodes.forEach(function (n) {
+        layers[g.node(n).rank].push(n);
+        visited[n] = true;
+    });
+    orderedVs.forEach(dfs);
+    return layers;
+};
+exports.default = initOrder;
+//# sourceMappingURL=init-order.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"init-order.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/init-order.ts"],"names":[],"mappings":";;AAGA;;;;;;;;;;GAUG;AACH,IAAM,SAAS,GAAG,UAAC,CAAQ;IACzB,IAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,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,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAe,EAA1B,CAA0B,CAAC,CAAC;IACrE,IAAM,OAAO,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,SAAS,CAAC,CAAC;IACvC,IAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACjB;IACD,yEAAyE;IAEzE,IAAM,GAAG,GAAG,UAAC,CAAS;;QACpB,IAAI,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC;YAAE,OAAO;QACtC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAClB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,MAAA,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,GAAG,CAAC,KAAY,CAAC,EAAjB,CAAiB,CAAC,CAAC;IACzD,CAAC,CAAC;IAEF,IAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAe,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAe,EAAvD,CAAuD,CAAC,CAAC;IACtG,mFAAmF;IAEnF,sBAAsB;IACtB,IAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,UAAC,CAAC;QACpC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC;IAC1C,CAAC,CAAC,CAAC;IACH,IAAM,aAAa,GAAG,UAAU,CAAC,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAmB,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAmB,EAA/D,CAA+D,CAAC,CAAC;IACjH,aAAa,CAAC,OAAO,CAAC,UAAC,CAAC;QACtB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACpB,CAAC,CAAC,CAAC;IAEH,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAEvB,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,kBAAe,SAAS,CAAC"}

package/lib/layout/dagre/src/order/resolve-conflicts.d.ts

@@ -0,0 +1,4 @@
+import { graphlib as IGraphLib } from "../../graphlib";
+declare type Graph = IGraphLib.Graph;
+declare const resolveConflicts: (entries: any, cg: Graph) => any[];
+export default resolveConflicts;

package/lib/layout/dagre/src/order/resolve-conflicts.js

@@ -0,0 +1,116 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/*
+ * Given a list of entries of the form {v, barycenter, weight} and a
+ * constraint graph this function will resolve any conflicts between the
+ * constraint graph and the barycenters for the entries. If the barycenters for
+ * an entry would violate a constraint in the constraint graph then we coalesce
+ * the nodes in the conflict into a new node that respects the contraint and
+ * aggregates barycenter and weight information.
+ *
+ * This implementation is based on the description in Forster, "A Fast and
+ * Simple Hueristic for Constrained Two-Level Crossing Reduction," thought it
+ * differs in some specific details.
+ *
+ * Pre-conditions:
+ *
+ *    1. Each entry has the form {v, barycenter, weight}, or if the node has
+ *       no barycenter, then {v}.
+ *
+ * Returns:
+ *
+ *    A new list of entries of the form {vs, i, barycenter, weight}. The list
+ *    `vs` may either be a singleton or it may be an aggregation of nodes
+ *    ordered such that they do not violate constraints from the constraint
+ *    graph. The property `i` is the lowest original index of any of the
+ *    elements in `vs`.
+ */
+var resolveConflicts = function (entries, cg) {
+    var _a, _b;
+    var mappedEntries = {};
+    entries.forEach(function (entry, i) {
+        var tmp = mappedEntries[entry.v] = {
+            i: i,
+            indegree: 0,
+            "in": [],
+            out: [],
+            vs: [entry.v],
+        };
+        if (entry.barycenter !== undefined) {
+            tmp.barycenter = entry.barycenter;
+            tmp.weight = entry.weight;
+        }
+    });
+    cg.edges().forEach(function (e) {
+        var entryV = mappedEntries[e.v];
+        var entryW = mappedEntries[e.w];
+        if (entryV !== undefined && entryW !== undefined) {
+            entryW.indegree++;
+            entryV.out.push(mappedEntries[e.w]);
+        }
+    });
+    // @ts-ignore
+    var sourceSet = (_b = (_a = Object.values(mappedEntries)).filter) === null || _b === void 0 ? void 0 : _b.call(_a, function (entry) { return !entry.indegree; });
+    return doResolveConflicts(sourceSet);
+};
+var doResolveConflicts = function (sourceSet) {
+    var entries = [];
+    var handleIn = function (vEntry) {
+        return function (uEntry) {
+            if (uEntry.merged)
+                return;
+            if (uEntry.barycenter !== undefined ||
+                vEntry.barycenter !== undefined ||
+                uEntry.barycenter >= vEntry.barycenter) {
+                mergeEntries(vEntry, uEntry);
+            }
+        };
+    };
+    var handleOut = function (vEntry) {
+        return function (wEntry) {
+            wEntry["in"].push(vEntry);
+            if (--wEntry.indegree === 0) {
+                sourceSet.push(wEntry);
+            }
+        };
+    };
+    var _loop_1 = function () {
+        var entry = sourceSet.pop();
+        entries.push(entry);
+        entry["in"].reverse().forEach(function (e) { return handleIn(entry); });
+        entry.out.forEach(function (e) { return handleOut(entry); });
+    };
+    while (sourceSet === null || sourceSet === void 0 ? void 0 : sourceSet.length) {
+        _loop_1();
+    }
+    var filtered = entries.filter(function (entry) { return !entry.merged; });
+    var keys = ["vs", "i", "barycenter", "weight"];
+    return filtered.map(function (entry) {
+        var picked = {};
+        keys.forEach(function (key) {
+            if (entry[key] === undefined)
+                return;
+            picked[key] = entry[key];
+        });
+        return picked;
+    });
+};
+var mergeEntries = function (target, source) {
+    var sum = 0;
+    var weight = 0;
+    if (target.weight) {
+        sum += target.barycenter * target.weight;
+        weight += target.weight;
+    }
+    if (source.weight) {
+        sum += source.barycenter * source.weight;
+        weight += source.weight;
+    }
+    target.vs = source.vs.concat(target.vs);
+    target.barycenter = sum / weight;
+    target.weight = weight;
+    target.i = Math.min(source.i, target.i);
+    source.merged = true;
+};
+exports.default = resolveConflicts;
+//# sourceMappingURL=resolve-conflicts.js.map

package/lib/layout/dagre/src/order/resolve-conflicts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve-conflicts.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/resolve-conflicts.ts"],"names":[],"mappings":";;AAIA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,IAAM,gBAAgB,GAAG,UAAC,OAAY,EAAE,EAAS;;IAC/C,IAAM,aAAa,GAAQ,EAAE,CAAC;IAC9B,OAAO,CAAC,OAAO,CAAC,UAAC,KAAU,EAAE,CAAS;QACpC,IAAM,GAAG,GAAQ,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG;YACxC,CAAC,GAAA;YACD,QAAQ,EAAE,CAAC;YACX,IAAI,EAAE,EAAE;YACR,GAAG,EAAE,EAAE;YACP,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;SACd,CAAC;QACF,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,EAAE;YAClC,GAAG,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;YAClC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;SAC3B;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QACnB,IAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;YAChD,MAAM,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACrC;IACH,CAAC,CAAC,CAAC;IAEH,aAAa;IACb,IAAM,SAAS,GAAG,MAAA,MAAA,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAC,MAAM,mDAAG,UAAC,KAAU,IAAK,OAAA,CAAC,KAAK,CAAC,QAAQ,EAAf,CAAe,CAAC,CAAC;IAEzF,OAAO,kBAAkB,CAAC,SAAS,CAAC,CAAC;AACvC,CAAC,CAAC;AAEF,IAAM,kBAAkB,GAAG,UAAC,SAAc;IACxC,IAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,IAAM,QAAQ,GAAG,UAAC,MAAW;QAC3B,OAAO,UAAC,MAAW;YACjB,IAAI,MAAM,CAAC,MAAM;gBAAE,OAAO;YAC1B,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS;gBAC/B,MAAM,CAAC,UAAU,KAAK,SAAS;gBAC/B,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,EAAE;gBAC1C,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;aAC9B;QACH,CAAC,CAAC;IACJ,CAAC,CAAC;IAEF,IAAM,SAAS,GAAG,UAAC,MAAW;QAC5B,OAAO,UAAC,MAAW;YACjB,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,IAAI,EAAE,MAAM,CAAC,QAAQ,KAAK,CAAC,EAAE;gBAC3B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aACxB;QACH,CAAC,CAAC;IACJ,CAAC,CAAC;;QAGA,IAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,UAAC,CAAM,IAAK,OAAA,QAAQ,CAAC,KAAK,CAAC,EAAf,CAAe,CAAC,CAAC;QAC3D,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,UAAC,CAAM,IAAK,OAAA,SAAS,CAAC,KAAK,CAAC,EAAhB,CAAgB,CAAC,CAAC;;IAJlD,OAAO,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,MAAM;;KAKvB;IAED,IAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,UAAC,KAAK,IAAK,OAAA,CAAC,KAAK,CAAC,MAAM,EAAb,CAAa,CAAC,CAAC;IAC1D,IAAM,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;IACjD,OAAO,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK;QACxB,IAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,UAAC,GAAG;YACf,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,OAAO;YACrC,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC,CAAC;AAEL,CAAC,CAAC;AAEF,IAAM,YAAY,GAAG,UAAC,MAAW,EAAE,MAAW;IAC5C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,IAAI,MAAM,CAAC,MAAM,EAAE;QACjB,GAAG,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC;QACzC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;KACzB;IAED,IAAI,MAAM,CAAC,MAAM,EAAE;QACjB,GAAG,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC;QACzC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;KACzB;IAED,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACxC,MAAM,CAAC,UAAU,GAAG,GAAG,GAAG,MAAM,CAAC;IACjC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC;AACvB,CAAC,CAAC;AAGF,kBAAe,gBAAgB,CAAC"}

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

@@ -0,0 +1,4 @@
+import { graphlib as IGraphLib } from '../../graphlib';
+declare type Graph = IGraphLib.Graph;
+declare const sortSubgraph: (g: Graph, v: string, cg: Graph, biasRight: any, usePrev?: any) => any;
+export default sortSubgraph;

package/lib/layout/dagre/src/order/sort-subgraph.js

@@ -0,0 +1,84 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var barycenter_1 = __importDefault(require("./barycenter"));
+var resolve_conflicts_1 = __importDefault(require("./resolve-conflicts"));
+var sort_1 = __importDefault(require("./sort"));
+var sortSubgraph = function (g, v, cg, biasRight, usePrev) {
+    var _a, _b, _c;
+    var movable = g.children(v);
+    // fixorder的点不参与排序（这个方案不合适，只排了新增节点，和原来的分离）
+    var node = g.node(v);
+    var bl = node ? node.borderLeft : undefined;
+    var br = node ? node.borderRight : undefined;
+    var subgraphs = {};
+    if (bl) {
+        movable = movable === null || movable === void 0 ? void 0 : movable.filter(function (w) {
+            return w !== bl && w !== br;
+        });
+    }
+    var barycenters = (0, barycenter_1.default)(g, movable || []);
+    barycenters.forEach(function (entry) {
+        var _a;
+        if ((_a = g.children(entry.v)) === null || _a === void 0 ? void 0 : _a.length) {
+            var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
+            subgraphs[entry.v] = subgraphResult;
+            if (subgraphResult.hasOwnProperty("barycenter")) {
+                mergeBarycenters(entry, subgraphResult);
+            }
+        }
+    });
+    var entries = (0, resolve_conflicts_1.default)(barycenters, cg);
+    expandSubgraphs(entries, subgraphs);
+    // 添加fixorder信息到entries里边
+    // TODO: 不考虑复合情况，只用第一个点的fixorder信息，后续考虑更完备的实现
+    entries.forEach(function (e) {
+        var node = g.node(e.vs[0]);
+        e.fixorder = node.fixorder;
+        e.order = node.order;
+    });
+    var result = (0, sort_1.default)(entries, biasRight, usePrev);
+    if (bl) {
+        // @ts-ignore
+        result.vs = [bl, result.vs, br].flat();
+        if ((_a = g.predecessors(bl)) === null || _a === void 0 ? void 0 : _a.length) {
+            var blPred = g.node(((_b = g.predecessors(bl)) === null || _b === void 0 ? void 0 : _b[0]) || {});
+            var brPred = g.node(((_c = g.predecessors(br)) === null || _c === void 0 ? void 0 : _c[0]) || {});
+            if (!result.hasOwnProperty("barycenter")) {
+                result.barycenter = 0;
+                result.weight = 0;
+            }
+            result.barycenter = (result.barycenter * result.weight +
+                blPred.order + brPred.order) / (result.weight + 2);
+            result.weight += 2;
+        }
+    }
+    return result;
+};
+var expandSubgraphs = function (entries, subgraphs) {
+    entries.forEach(function (entry) {
+        var vss = entry.vs.map(function (v) {
+            if (subgraphs[v]) {
+                return subgraphs[v].vs;
+            }
+            return v;
+        });
+        entry.vs = vss.flat();
+    });
+};
+var mergeBarycenters = function (target, other) {
+    if (target.barycenter !== undefined) {
+        target.barycenter = (target.barycenter * target.weight +
+            other.barycenter * other.weight) /
+            (target.weight + other.weight);
+        target.weight += other.weight;
+    }
+    else {
+        target.barycenter = other.barycenter;
+        target.weight = other.weight;
+    }
+};
+exports.default = sortSubgraph;
+//# sourceMappingURL=sort-subgraph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sort-subgraph.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/sort-subgraph.ts"],"names":[],"mappings":";;;;;AACA,4DAAsC;AACtC,0EAAmD;AACnD,gDAA0B;AAI1B,IAAM,YAAY,GAAG,UAAC,CAAQ,EAAE,CAAS,EAAE,EAAS,EAAE,SAAc,EAAE,OAAa;;IACjF,IAAI,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC5B,0CAA0C;IAC1C,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,IAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9C,IAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAA,CAAC,CAAC,SAAS,CAAC;IAC9C,IAAM,SAAS,GAAQ,EAAE,CAAC;IAE1B,IAAI,EAAE,EAAE;QACN,OAAO,GAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,CAAC,UAAC,CAAC;YAC1B,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,CAAC,CAAC,CAAC;KACJ;IAED,IAAM,WAAW,GAAG,IAAA,oBAAU,EAAC,CAAC,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;IACjD,WAAW,CAAC,OAAO,CAAC,UAAC,KAAK;;QACxB,IAAI,MAAA,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,MAAM,EAAE;YAC/B,IAAM,cAAc,GAAG,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YAC/D,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC;YACpC,IAAI,cAAc,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE;gBAC/C,gBAAgB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;aACzC;SACF;IACH,CAAC,CAAC,CAAC;IAEH,IAAM,OAAO,GAAG,IAAA,2BAAgB,EAAC,WAAW,EAAE,EAAE,CAAC,CAAC;IAClD,eAAe,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAEpC,yBAAyB;IACzB,6CAA6C;IAC7C,OAAO,CAAC,OAAO,CAAC,UAAC,CAAC;QAChB,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC3B,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAM,MAAM,GAAG,IAAA,cAAI,EAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAEjD,IAAI,EAAE,EAAE;QACN,aAAa;QACb,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,IAAI,MAAA,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,0CAAE,MAAM,EAAE;YAC9B,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA,MAAA,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,0CAAG,CAAC,CAAC,KAAI,EAAE,CAAC,CAAC;YACrD,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA,MAAA,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,0CAAG,CAAC,CAAC,KAAI,EAAE,CAAC,CAAC;YACrD,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE;gBACxC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;gBACtB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;aACnB;YACD,MAAM,CAAC,UAAU,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM;gBAChC,MAAM,CAAC,KAAgB,GAAI,MAAM,CAAC,KAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAChG,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;SACpB;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UAAC,OAAY,EAAE,SAAc;IACnD,OAAO,CAAC,OAAO,CAAC,UAAC,KAAU;QACzB,IAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,UAAC,CAAS;YACjC,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE;gBAChB,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;aACxB;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,gBAAgB,GAAG,UAAC,MAAW,EAAE,KAAU;IAC/C,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE;QACnC,MAAM,CAAC,UAAU,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM;YACjC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;YACjC,CAAC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC;KAC/B;SAAM;QACL,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QACrC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;KAC9B;AACH,CAAC,CAAC;AAEF,kBAAe,YAAY,CAAC"}

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

@@ -0,0 +1,2 @@
+declare const sort: (entries: any, biasRight: any, usePrev: any) => any;
+export default sort;

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

@@ -0,0 +1,72 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var util_1 = __importDefault(require("../util"));
+var sort = function (entries, biasRight, usePrev) {
+    var parts = util_1.default.partition(entries, function (entry) {
+        // NOTE: 有fixorder的也可以排
+        return (entry.hasOwnProperty("fixorder") && !isNaN(entry.fixorder)) || entry.hasOwnProperty("barycenter");
+    });
+    var sortable = parts.lhs;
+    var unsortable = parts.rhs.sort(function (a, b) { return -a.i - (-b.i); });
+    var vs = [];
+    var sum = 0;
+    var weight = 0;
+    var vsIndex = 0;
+    sortable.sort(compareWithBias(!!biasRight, !!usePrev));
+    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+    sortable.forEach(function (entry) {
+        vsIndex += entry.vs.length;
+        vs.push(entry.vs);
+        sum += entry.barycenter * entry.weight;
+        weight += entry.weight;
+        vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+    });
+    var result = { vs: vs.flat() };
+    if (weight) {
+        result.barycenter = sum / weight;
+        result.weight = weight;
+    }
+    return result;
+};
+var consumeUnsortable = function (vs, unsortable, index) {
+    var iindex = index;
+    var last;
+    while (unsortable.length && (last = unsortable[unsortable.length - 1]).i <= iindex) {
+        unsortable.pop();
+        vs.push(last.vs);
+        iindex++;
+    }
+    return iindex;
+};
+/**
+ * 配置是否考虑使用之前的布局结果
+ */
+var compareWithBias = function (bias, usePrev) {
+    return function (entryV, entryW) {
+        // 排序的时候先判断fixorder，不行再判断重心
+        if (entryV.fixorder !== undefined && entryW.fixorder !== undefined) {
+            return entryV.fixorder - entryW.fixorder;
+        }
+        if (entryV.barycenter < entryW.barycenter) {
+            return -1;
+        }
+        if (entryV.barycenter > entryW.barycenter) {
+            return 1;
+        }
+        // 重心相同，考虑之前排好的顺序
+        if (usePrev && entryV.order !== undefined && entryW.order !== undefined) {
+            if (entryV.order < entryW.order) {
+                return -1;
+            }
+            if (entryV.order > entryW.order) {
+                return 1;
+            }
+        }
+        return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
+    };
+};
+exports.default = sort;
+//# sourceMappingURL=sort.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sort.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/sort.ts"],"names":[],"mappings":";;;;;AAAA,iDAA2B;AAE3B,IAAM,IAAI,GAAG,UAAC,OAAY,EAAE,SAAc,EAAE,OAAY;IACtD,IAAM,KAAK,GAAG,cAAI,CAAC,SAAS,CAAC,OAAO,EAAE,UAAC,KAAU;QAC/C,uBAAuB;QACvB,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;IAC5G,CAAC,CAAC,CAAC;IACH,IAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;IAC3B,IAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAC,CAAM,EAAE,CAAM,IAAK,OAAA,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAb,CAAa,CAAC,CAAC;IACrE,IAAM,EAAE,GAAQ,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAEvD,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IAErD,QAAQ,CAAC,OAAO,CAAC,UAAC,KAAU;QAC1B,OAAO,IAAI,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC;QAC3B,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClB,GAAG,IAAI,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC;QACvB,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAM,MAAM,GAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;IACtC,IAAI,MAAM,EAAE;QACV,MAAM,CAAC,UAAU,GAAG,GAAG,GAAG,MAAM,CAAC;QACjC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC;KACxB;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UAAC,EAAO,EAAE,UAAe,EAAE,KAAa;IAChE,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,IAAI,CAAC;IACT,OAAO,UAAU,CAAC,MAAM,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE;QAClF,UAAU,CAAC,GAAG,EAAE,CAAC;QACjB,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,MAAM,EAAE,CAAC;KACV;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;GAEG;AACH,IAAM,eAAe,GAAG,UAAC,IAAS,EAAE,OAAY;IAC9C,OAAO,UAAC,MAAW,EAAE,MAAW;QAC9B,2BAA2B;QAC3B,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE;YAClE,OAAO,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;SAC1C;QACD,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,EAAE;YACzC,OAAO,CAAC,CAAC,CAAC;SACX;QACD,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,EAAE;YACzC,OAAO,CAAC,CAAC;SACV;QACD,iBAAiB;QACjB,IAAI,OAAO,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE;YACvE,IAAI,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE;gBAC/B,OAAO,CAAC,CAAC,CAAC;aACX;YACD,IAAI,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE;gBAC/B,OAAO,CAAC,CAAC;aACV;SACF;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC;AACJ,CAAC,CAAC;AAEF,kBAAe,IAAI,CAAC"}

package/lib/layout/dagre/src/parent-dummy-chains.d.ts

@@ -0,0 +1,4 @@
+import { graphlib } from '../graphlib';
+declare type Graph = graphlib.Graph;
+declare const parentDummyChains: (g: Graph) => void;
+export default parentDummyChains;

package/lib/layout/dagre/src/parent-dummy-chains.js

@@ -0,0 +1,80 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var parentDummyChains = function (g) {
+    var _a;
+    var postorderNums = postorder(g);
+    (_a = g.graph().dummyChains) === null || _a === void 0 ? void 0 : _a.forEach(function (v) {
+        var _a, _b;
+        var node = g.node(v);
+        var edgeObj = node.edgeObj;
+        if (!edgeObj)
+            return;
+        var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
+        var path = pathData.path;
+        var lca = pathData.lca;
+        var pathIdx = 0;
+        var pathV = path[pathIdx];
+        var ascending = true;
+        while (v !== edgeObj.w) {
+            node = g.node(v);
+            if (ascending) {
+                while ((pathV = path[pathIdx]) !== lca &&
+                    g.node(pathV).maxRank < node.rank) {
+                    pathIdx++;
+                }
+                if (pathV === lca) {
+                    ascending = false;
+                }
+            }
+            if (!ascending) {
+                while (pathIdx < path.length - 1 &&
+                    ((_a = g.node(pathV = path[pathIdx + 1])) === null || _a === void 0 ? void 0 : _a.minRank) <= node.rank) {
+                    pathIdx++;
+                }
+                pathV = path[pathIdx];
+            }
+            g.setParent(v, pathV);
+            // tslint:disable-next-line
+            v = (_b = g.successors(v)) === null || _b === void 0 ? void 0 : _b[0];
+        }
+    });
+};
+// Find a path from v to w through the lowest common ancestor (LCA). Return the
+// full path and the LCA.
+var findPath = function (g, postorderNums, v, w) {
+    var vPath = [];
+    var wPath = [];
+    var low = Math.min(postorderNums[v].low, postorderNums[w].low);
+    var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
+    var parent;
+    var lca;
+    // Traverse up from v to find the LCA
+    parent = v;
+    do {
+        parent = g.parent(parent);
+        vPath.push(parent);
+    } while (parent &&
+        (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
+    lca = parent;
+    // Traverse from w to LCA
+    parent = w;
+    while ((parent = g.parent(parent)) !== lca) {
+        wPath.push(parent);
+    }
+    return { lca: lca, path: vPath.concat(wPath.reverse()) };
+};
+var postorder = function (g) {
+    var _a;
+    var result = {};
+    var lim = 0;
+    var dfs = function (v) {
+        var _a;
+        var low = lim;
+        (_a = g.children(v)) === null || _a === void 0 ? void 0 : _a.forEach(dfs);
+        result[v] = { low: low, lim: lim++ };
+    };
+    (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach(dfs);
+    return result;
+};
+exports.default = parentDummyChains;
+//# sourceMappingURL=parent-dummy-chains.js.map

package/lib/layout/dagre/src/parent-dummy-chains.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parent-dummy-chains.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/parent-dummy-chains.ts"],"names":[],"mappings":";;AAIA,IAAM,iBAAiB,GAAG,UAAC,CAAQ;;IACjC,IAAM,aAAa,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAEnC,MAAA,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,0CAAE,OAAO,CAAC,UAAC,CAAM;;QACpC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,OAAO;YAAE,OAAO;QACrB,IAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QAClE,IAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,IAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC;QACzB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1B,IAAI,SAAS,GAAG,IAAI,CAAC;QAErB,OAAO,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE;YACtB,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEjB,IAAI,SAAS,EAAE;gBACb,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,GAAG;oBAC9B,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAkB,GAAI,IAAI,CAAC,IAAe,EAAE;oBAChE,OAAO,EAAE,CAAC;iBACX;gBAED,IAAI,KAAK,KAAK,GAAG,EAAE;oBACjB,SAAS,GAAG,KAAK,CAAC;iBACnB;aACF;YAED,IAAI,CAAC,SAAS,EAAE;gBACd,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;oBACzB,CAAC,MAAA,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,0CAAE,OAAkB,KAAK,IAAI,CAAC,IAAe,EAAE;oBACtF,OAAO,EAAE,CAAC;iBACX;gBACD,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;aACvB;YAED,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtB,2BAA2B;YAC3B,CAAC,GAAG,MAAA,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,0CAAG,CAAC,CAAC,CAAC;SAC1B;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,+EAA+E;AAC/E,yBAAyB;AACzB,IAAM,QAAQ,GAAG,UAAC,CAAQ,EAAE,aAAkB,EAAE,CAAS,EAAE,CAAS;IAClE,IAAM,KAAK,GAAG,EAAE,CAAC;IACjB,IAAM,KAAK,GAAG,EAAE,CAAC;IACjB,IAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,IAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,IAAI,MAAW,CAAC;IAChB,IAAI,GAAG,CAAC;IAER,qCAAqC;IACrC,MAAM,GAAG,CAAC,CAAC;IACX,GAAG;QACD,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KACpB,QAAQ,MAAM;QACN,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE;IAC/E,GAAG,GAAG,MAAM,CAAC;IAEb,yBAAyB;IACzB,MAAM,GAAG,CAAC,CAAC;IACX,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,GAAG,EAAE;QAC1C,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KACpB;IAED,OAAO,EAAE,GAAG,KAAA,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACtD,CAAC,CAAC;AAEF,IAAM,SAAS,GAAG,UAAC,CAAQ;;IACzB,IAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,IAAM,GAAG,GAAG,UAAC,CAAS;;QACpB,IAAM,GAAG,GAAG,GAAG,CAAC;QAChB,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,KAAA,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;IAClC,CAAC,CAAC;IACF,MAAA,CAAC,CAAC,QAAQ,EAAE,0CAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IAE3B,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,kBAAe,iBAAiB,CAAC"}

package/lib/layout/dagre/src/position/bk.d.ts

@@ -0,0 +1,32 @@
+import { graphlib as IGraphLib } from '../../graphlib';
+declare type IGraph = IGraphLib.Graph;
+declare const findType1Conflicts: (g: IGraph, layering?: any) => {};
+declare const findType2Conflicts: (g: IGraph, layering?: any) => {};
+declare const addConflict: (conflicts: any, v: number, w: number) => void;
+declare const hasConflict: (conflicts: any, v: number, w: number) => any;
+declare const verticalAlignment: (g: IGraph, layering: any, conflicts: any, neighborFn: (v: string) => unknown) => {
+    root: any;
+    align: any;
+};
+declare const horizontalCompaction: (g: IGraph, layering: any, root: string, align: string[], reverseSep: boolean) => any;
+declare const findSmallestWidthAlignment: (g: IGraph, xss: any) => undefined;
+declare function alignCoordinates(xss: any, alignTo: any): void;
+declare const balance: (xss: any, align: string) => any;
+declare const positionX: (g: IGraph) => any;
+export { positionX, findType1Conflicts, findType2Conflicts, addConflict, hasConflict, verticalAlignment, horizontalCompaction, alignCoordinates, findSmallestWidthAlignment, balance };
+declare const _default: {
+    positionX: (g: IGraph) => any;
+    findType1Conflicts: (g: IGraph, layering?: any) => {};
+    findType2Conflicts: (g: IGraph, layering?: any) => {};
+    addConflict: (conflicts: any, v: number, w: number) => void;
+    hasConflict: (conflicts: any, v: number, w: number) => any;
+    verticalAlignment: (g: IGraph, layering: any, conflicts: any, neighborFn: (v: string) => unknown) => {
+        root: any;
+        align: any;
+    };
+    horizontalCompaction: (g: IGraph, layering: any, root: string, align: string[], reverseSep: boolean) => any;
+    alignCoordinates: typeof alignCoordinates;
+    findSmallestWidthAlignment: (g: IGraph, xss: any) => undefined;
+    balance: (xss: any, align: string) => any;
+};
+export default _default;