@antv/layout 0.3.11 → 1.0.0-alpha.0

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

@@ -1,54 +0,0 @@
-"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([]);
-    }
-    var dfs = function (v) {
-        var _a;
-        if (visited.hasOwnProperty(v))
-            return;
-        visited[v] = true;
-        var node = g.node(v);
-        if (!isNaN(node.rank)) {
-            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 === null || fixOrderNodes === void 0 ? void 0 : fixOrderNodes.forEach(function (n) {
-        if (!isNaN(g.node(n).rank)) {
-            layers[g.node(n).rank].push(n);
-        }
-        visited[n] = true;
-    });
-    orderedVs === null || orderedVs === void 0 ? void 0 : orderedVs.forEach(dfs);
-    return layers;
-};
-exports.default = initOrder;
-//# sourceMappingURL=init-order.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"init-order.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/init-order.ts"],"names":[],"mappings":";;AAEA;;;;;;;;;;GAUG;AACH,IAAM,SAAS,GAAG,UAAC,CAAQ;IACzB,IAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,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,CAAE,CAAC,IAAe,EAA3B,CAA2B,CAAC,CAAC;IACtE,IAAM,OAAO,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,SAAS,CAAC,CAAC;IACvC,IAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACjB;IAED,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,CAAE,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAc,CAAC,EAAE;YAC/B,MAAM,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACrC;QACD,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,CAAE,CAAC,IAAe,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAe,EAAzD,CAAyD,CAAC,CAAC;IACxG,oFAAoF;IAEpF,sBAAsB;IACtB,IAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,UAAC,CAAC;QACpC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,QAAQ,KAAK,SAAS,CAAC;IAC3C,CAAC,CAAC,CAAC;IACH,IAAM,aAAa,GAAG,UAAU,CAAC,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,QAAmB,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,QAAmB,EAAjE,CAAiE,CAAC,CAAC;IACnH,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,OAAO,CAAC,UAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAc,CAAC,EAAE;YACrC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAC3C;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACpB,CAAC,CAAC,CAAC;IAEH,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IAExB,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,kBAAe,SAAS,CAAC"}

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

@@ -1,19 +0,0 @@
-import { Graph } from "../../graph";
-export type ConflictEntry = {
-    i: number;
-    indegree?: number;
-    in?: ConflictEntry[];
-    out?: ConflictEntry[];
-    vs: string[];
-    barycenter?: number;
-    weight?: number;
-    merged?: boolean;
-    fixorder?: number;
-    order?: number;
-};
-declare const resolveConflicts: (entries: {
-    v: string;
-    barycenter?: number;
-    weight?: number;
-}[], cg: Graph) => ConflictEntry[];
-export default resolveConflicts;

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

@@ -1,98 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var resolveConflicts = function (entries, cg) {
-    var _a, _b, _c;
-    var mappedEntries = {};
-    entries === null || entries === void 0 ? void 0 : entries.forEach(function (entry, i) {
-        mappedEntries[entry.v] = {
-            i: i,
-            indegree: 0,
-            in: [],
-            out: [],
-            vs: [entry.v],
-        };
-        var tmp = mappedEntries[entry.v];
-        if (entry.barycenter !== undefined) {
-            tmp.barycenter = entry.barycenter;
-            tmp.weight = entry.weight;
-        }
-    });
-    (_a = cg.edges()) === null || _a === void 0 ? void 0 : _a.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]);
-        }
-    });
-    var sourceSet = (_c = (_b = Object.values(mappedEntries)).filter) === null || _c === void 0 ? void 0 : _c.call(_b, function (entry) { return !entry.indegree; });
-    return doResolveConflicts(sourceSet);
-};
-var doResolveConflicts = function (sourceSet) {
-    var _a, _b;
-    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);
-        (_a = entry["in"].reverse()) === null || _a === void 0 ? void 0 : _a.forEach(function (e) { return handleIn(entry)(e); });
-        (_b = entry.out) === null || _b === void 0 ? void 0 : _b.forEach(function (e) { return handleOut(entry)(e); });
-    };
-    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 === null || keys === void 0 ? void 0 : keys.forEach(function (key) {
-            if (entry[key] === undefined)
-                return;
-            picked[key] = entry[key];
-        });
-        return picked;
-    });
-};
-var mergeEntries = function (target, source) {
-    var _a;
-    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 = (_a = source.vs) === null || _a === void 0 ? void 0 : _a.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

@@ -1 +0,0 @@
-{"version":3,"file":"resolve-conflicts.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/resolve-conflicts.ts"],"names":[],"mappings":";;AAyCA,IAAM,gBAAgB,GAAG,UACvB,OAIG,EACH,EAAS;;IAET,IAAM,aAAa,GAAkC,EAAE,CAAC;IACxD,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,CAAC,UAAC,KAAK,EAAE,CAAS;QAChC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG;YACvB,CAAC,GAAA;YACD,QAAQ,EAAE,CAAC;YACX,EAAE,EAAE,EAAE;YACN,GAAG,EAAE,EAAE;YACP,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;SACd,CAAC;QACF,IAAM,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnC,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,MAAA,EAAE,CAAC,KAAK,EAAE,0CAAE,OAAO,CAAC,UAAC,CAAC;QACpB,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,QAAS,EAAE,CAAC;YACnB,MAAM,CAAC,GAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACtC;IACH,CAAC,CAAC,CAAC;IAEH,IAAM,SAAS,GAAG,MAAA,MAAA,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAC,MAAM,mDACnD,UAAC,KAAoB,IAAK,OAAA,CAAC,KAAK,CAAC,QAAQ,EAAf,CAAe,CAC1C,CAAC;IAEF,OAAO,kBAAkB,CAAC,SAAS,CAAC,CAAC;AACvC,CAAC,CAAC;AAEF,IAAM,kBAAkB,GAAG,UAAC,SAA0B;;IACpD,IAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,IAAM,QAAQ,GAAG,UAAC,MAAqB;QACrC,OAAO,UAAC,MAAqB;YAC3B,IAAI,MAAM,CAAC,MAAM;gBAAE,OAAO;YAC1B,IACE,MAAM,CAAC,UAAU,KAAK,SAAS;gBAC/B,MAAM,CAAC,UAAU,KAAK,SAAS;gBAC/B,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,EACtC;gBACA,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;aAC9B;QACH,CAAC,CAAC;IACJ,CAAC,CAAC;IAEF,IAAM,SAAS,GAAG,UAAC,MAAqB;QACtC,OAAO,UAAC,MAAqB;YAC3B,MAAM,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,IAAI,EAAE,MAAM,CAAC,QAAS,KAAK,CAAC,EAAE;gBAC5B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aACxB;QACH,CAAC,CAAC;IACJ,CAAC,CAAC;;QAGA,IAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAG,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,MAAA,KAAK,CAAC,IAAI,CAAE,CAAC,OAAO,EAAE,0CAAE,OAAO,CAAC,UAAC,CAAgB,IAAK,OAAA,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAlB,CAAkB,CAAC,CAAC;QAC1E,MAAA,KAAK,CAAC,GAAG,0CAAE,OAAO,CAAC,UAAC,CAAgB,IAAK,OAAA,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAnB,CAAmB,CAAC,CAAC;;IAJhE,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,GAA6C;QACrD,IAAI;QACJ,GAAG;QACH,YAAY;QACZ,QAAQ;KACT,CAAC;IACF,OAAO,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK;QACxB,IAAM,MAAM,GAAwB,EAAE,CAAC;QACvC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,OAAO,CAAC,UAAC,GAAG;YAChB,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,MAAuB,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,YAAY,GAAG,UAAC,MAAqB,EAAE,MAAqB;;IAChE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,IAAI,MAAM,CAAC,MAAM,EAAE;QACjB,GAAG,IAAI,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,MAAM,CAAC;QAC1C,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;KACzB;IAED,IAAI,MAAM,CAAC,MAAM,EAAE;QACjB,GAAG,IAAI,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,MAAM,CAAC;QAC1C,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;KACzB;IAED,MAAM,CAAC,EAAE,GAAG,MAAA,MAAM,CAAC,EAAE,0CAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACzC,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;AAEF,kBAAe,gBAAgB,CAAC"}

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

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

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

@@ -1,90 +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 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, _d;
-    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 === null || barycenters === void 0 ? void 0 : 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信息，后续考虑更完备的实现
-    (_a = entries
-        .filter(function (e) { return e.vs.length > 0; })) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
-        var node = g.node(e.vs[0]);
-        if (node) {
-            e.fixorder = node.fixorder;
-            e.order = node.order;
-        }
-    });
-    var result = (0, sort_1.default)(entries, biasRight, usePrev);
-    if (bl) {
-        result.vs = [bl, result.vs, br].flat();
-        if ((_b = g.predecessors(bl)) === null || _b === void 0 ? void 0 : _b.length) {
-            var blPred = g.node(((_c = g.predecessors(bl)) === null || _c === void 0 ? void 0 : _c[0]) || "");
-            var brPred = g.node(((_d = g.predecessors(br)) === null || _d === void 0 ? void 0 : _d[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 === null || entries === void 0 ? void 0 : entries.forEach(function (entry) {
-        var _a;
-        var vss = (_a = entry.vs) === null || _a === void 0 ? void 0 : _a.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

@@ -1 +0,0 @@
-{"version":3,"file":"sort-subgraph.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/sort-subgraph.ts"],"names":[],"mappings":";;;;;AACA,4DAAsC;AACtC,0EAAsE;AACtE,gDAA0B;AAE1B,IAAM,YAAY,GAAG,UACnB,CAAQ,EACR,CAAS,EACT,EAAS,EACT,SAAmB,EACnB,OAAiB;;IAEjB,IAAI,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC5B,0CAA0C;IAC1C,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;IACxB,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,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/C,IAAM,SAAS,GAA2C,EAAE,CAAC;IAE7D,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,aAAX,WAAW,uBAAX,WAAW,CAAE,OAAO,CAAC,UAAC,KAAK;;QACzB,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,MAAA,OAAO;SACJ,MAAM,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,EAAf,CAAe,CAAC,0CAC7B,OAAO,CAAC,UAAC,CAAC;QACV,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;QAC9B,IAAI,IAAI,EAAE;YACR,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC3B,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;SACtB;IACH,CAAC,CAAC,CAAC;IAEL,IAAM,MAAM,GAAG,IAAA,cAAI,EAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAEjD,IAAI,EAAE,EAAE;QACN,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,CAAE,CAAC;YACtD,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA,MAAA,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,0CAAG,CAAC,CAAC,KAAI,EAAE,CAAE,CAAC;YACtD,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;gBACf,CAAC,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,MAAO;oBACjC,MAAM,CAAC,KAAgB;oBACvB,MAAM,CAAC,KAAgB,CAAC;oBAC3B,CAAC,MAAM,CAAC,MAAO,GAAG,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,MAAO,IAAI,CAAC,CAAC;SACrB;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UACtB,OAAwB,EACxB,SAAiD;IAEjD,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,CAAC,UAAC,KAAK;;QACrB,IAAM,GAAG,GAAG,MAAA,KAAK,CAAC,EAAE,0CAAE,GAAG,CAAC,UAAC,CAAS;YAClC,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE;gBAChB,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,EAAG,CAAC;aACzB;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,UACvB,MAAgD,EAChD,KAA+C;IAE/C,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE;QACnC,MAAM,CAAC,UAAU;YACf,CAAC,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAO,GAAG,KAAK,CAAC,UAAW,GAAG,KAAK,CAAC,MAAO,CAAC;gBACxE,CAAC,MAAM,CAAC,MAAO,GAAG,KAAK,CAAC,MAAO,CAAC,CAAC;QACnC,MAAM,CAAC,MAAO,IAAI,KAAK,CAAC,MAAO,CAAC;KACjC;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

@@ -1,7 +0,0 @@
-import { ConflictEntry } from "./resolve-conflicts";
-declare const sort: (entries: ConflictEntry[], biasRight?: boolean, usePrev?: boolean) => {
-    vs: string[];
-    barycenter?: number | undefined;
-    weight?: number | undefined;
-};
-export default sort;

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

@@ -1,70 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var util_1 = require("../util");
-var sort = function (entries, biasRight, usePrev) {
-    var parts = (0, util_1.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 === null || sortable === void 0 ? void 0 : sortable.sort(compareWithBias(!!biasRight, !!usePrev));
-    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
-    sortable === null || sortable === void 0 ? void 0 : sortable.forEach(function (entry) {
-        var _a;
-        vsIndex += (_a = entry.vs) === null || _a === void 0 ? void 0 : _a.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 === null || vs === void 0 ? void 0 : 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

@@ -1 +0,0 @@
-{"version":3,"file":"sort.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/order/sort.ts"],"names":[],"mappings":";;AAAA,gCAAoC;AAGpC,IAAM,IAAI,GAAG,UAAC,OAAwB,EAAE,SAAmB,EAAE,OAAiB;IAC5E,IAAM,KAAK,GAAG,IAAA,gBAAS,EAAC,OAAO,EAAE,UAAC,KAAK;QACrC,uBAAuB;QACvB,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAS,CAAC,CAAC,IAAI,KAAK,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;IAC7G,CAAC,CAAC,CAAC;IACH,IAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;IAC3B,IAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAb,CAAa,CAAC,CAAC;IAC3D,IAAM,EAAE,GAAe,EAAE,CAAC;IAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAExD,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IAErD,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;;QACtB,OAAO,IAAI,MAAA,KAAK,CAAC,EAAE,0CAAE,MAAM,CAAC;QAC5B,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClB,GAAG,IAAI,KAAK,CAAC,UAAW,GAAG,KAAK,CAAC,MAAO,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,MAAO,CAAC;QACxB,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAM,MAAM,GAA2D,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;IACzF,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,EAAc,EAAE,UAA2B,EAAE,KAAa;IACnF,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,aAAF,EAAE,uBAAF,EAAE,CAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,MAAM,EAAE,CAAC;KACV;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;GAEG;AACH,IAAM,eAAe,GAAG,UAAC,IAAa,EAAE,OAAgB;IACtD,OAAO,UAAC,MAAqB,EAAE,MAAqB;QAClD,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,UAAW,GAAG,MAAM,CAAC,UAAW,EAAE;YAC3C,OAAO,CAAC,CAAC,CAAC;SACX;QACD,IAAI,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,UAAW,EAAE;YAC3C,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

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

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

@@ -1,83 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-// deep first search with both order low for pre, lim for post
-var dfsBothOrder = 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;
-};
-// 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 && parent !== lca) {
-        wPath.push(parent);
-        parent = g.parent(parent);
-    }
-    return { lca: lca, path: vPath.concat(wPath.reverse()) };
-};
-var parentDummyChains = function (g) {
-    var _a;
-    var postorderNums = dfsBothOrder(g);
-    (_a = g.graph().dummyChains) === null || _a === void 0 ? void 0 : _a.forEach(function (startV) {
-        var _a, _b;
-        var v = startV;
-        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 !== lca && ((_a = g.node(pathV)) === null || _a === void 0 ? void 0 : _a.maxRank) < node.rank) {
-                    pathIdx++;
-                    pathV = path[pathIdx];
-                }
-                if (pathV === lca) {
-                    ascending = false;
-                }
-            }
-            if (!ascending) {
-                while (pathIdx < path.length - 1 &&
-                    ((_b = g.node(path[pathIdx + 1])) === null || _b === void 0 ? void 0 : _b.minRank) <=
-                        node.rank) {
-                    pathIdx++;
-                }
-                pathV = path[pathIdx];
-            }
-            g.setParent(v, pathV);
-            v = g.successors(v)[0];
-        }
-    });
-};
-exports.default = parentDummyChains;
-//# sourceMappingURL=parent-dummy-chains.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"parent-dummy-chains.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/parent-dummy-chains.ts"],"names":[],"mappings":";;AAIA,8DAA8D;AAC9D,IAAM,YAAY,GAAG,UAAC,CAAQ;;IAC5B,IAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,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,+EAA+E;AAC/E,yBAAyB;AACzB,IAAM,QAAQ,GAAG,UACf,CAAQ,EACR,aAAwC,EACxC,CAAS,EACT,CAAS;IAET,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,MAA0B,CAAC;IAC/B,IAAI,GAAuB,CAAC;IAE5B,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,QACC,MAAM;QACN,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EACpE;IACF,GAAG,GAAG,MAAM,CAAC;IAEb,yBAAyB;IACzB,MAAM,GAAG,CAAC,CAAC;IACX,OAAO,MAAM,IAAI,MAAM,KAAK,GAAG,EAAE;QAC/B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnB,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;KAC3B;IAED,OAAO,EAAE,GAAG,KAAA,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACtD,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UAAC,CAAQ;;IACjC,IAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAEtC,MAAA,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,0CAAE,OAAO,CAAC,UAAC,MAAM;;QACpC,IAAI,CAAC,GAAG,MAAM,CAAC;QACf,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACtB,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,CAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,IAAI,CAAC;QAErB,OAAO,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE;YACtB,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;YAElB,IAAI,SAAS,EAAE;gBACb,OAAO,KAAK,KAAK,GAAG,IAAI,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,0CAAE,OAAQ,IAAG,IAAI,CAAC,IAAK,EAAE;oBAC5D,OAAO,EAAE,CAAC;oBACV,KAAK,GAAG,IAAI,CAAC,OAAO,CAAE,CAAC;iBACxB;gBAED,IAAI,KAAK,KAAK,GAAG,EAAE;oBACjB,SAAS,GAAG,KAAK,CAAC;iBACnB;aACF;YAED,IAAI,CAAC,SAAS,EAAE;gBACd,OACE,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;oBACzB,CAAC,MAAA,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAE,CAAC,0CAAE,OAAkB;wBAC5C,IAAI,CAAC,IAAe,EACvB;oBACA,OAAO,EAAE,CAAC;iBACX;gBACD,KAAK,GAAG,IAAI,CAAC,OAAO,CAAE,CAAC;aACxB;YAED,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtB,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC;SACzB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,iBAAiB,CAAC"}

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

@@ -1,23 +0,0 @@
-import { Graph as RawGraph } from "@antv/graphlib";
-import { Graph } from "../../graph";
-declare class BlockGraph extends RawGraph<string, string, number> {
-}
-type Conflicts = Record<string, Record<string, boolean>>;
-export declare const findType1Conflicts: (g: Graph, layering?: string[][]) => {};
-export declare const findType2Conflicts: (g: Graph, layering?: string[][]) => {};
-export declare const findOtherInnerSegmentNode: (g: Graph, v: string) => string | undefined;
-export declare const addConflict: (conflicts: Conflicts, v: string, w: string) => void;
-export declare const hasConflict: (conflicts: Conflicts, v: string, w: string) => boolean;
-export declare const verticalAlignment: (g: Graph, layering: string[][], conflicts: Conflicts, neighborFn: (v: string) => string[]) => {
-    root: Record<string, string>;
-    align: Record<string, string>;
-};
-export declare const horizontalCompaction: (g: Graph, layering: string[][], root: Record<string, string>, align: Record<string, string>, reverseSep?: boolean) => Record<string, number>;
-export declare const buildBlockGraph: (g: Graph, layering: string[][], root: Record<string, string>, reverseSep?: boolean) => BlockGraph;
-export declare const findSmallestWidthAlignment: (g: Graph, xss: Record<string, Record<string, number>>) => Record<string, number>;
-export declare function alignCoordinates(xss: Record<string, Record<string, number>>, alignTo: Record<string, number>): void;
-export declare const balance: (xss: Record<string, Record<string, number>>, align?: string) => Record<string, number>;
-export declare const positionX: (g: Graph) => Record<string, number>;
-export declare const sep: (nodeSep: number, edgeSep: number, reverseSep: boolean) => (g: Graph, v: string, w: string) => number;
-export declare const width: (g: Graph, v: string) => number;
-export {};