@antv/layout 0.1.19-beta.4 → 0.1.21

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

@@ -0,0 +1,49 @@
+/*
+ * 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.
+ */
+const initOrder = (g) => {
+    const visited = {};
+    const simpleNodes = g.nodes().filter((v) => {
+        var _a;
+        return !((_a = g.children(v)) === null || _a === void 0 ? void 0 : _a.length);
+    });
+    const nodeRanks = simpleNodes.map((v) => g.node(v).rank);
+    const maxRank = Math.max(...nodeRanks);
+    const layers = [];
+    for (let i = 0; i < maxRank + 1; i++) {
+        layers.push([]);
+    }
+    // const layers = _.map(_.range(maxRank + 1), function() { return []; });
+    const dfs = (v) => {
+        var _a;
+        if (visited.hasOwnProperty(v))
+            return;
+        visited[v] = true;
+        const node = g.node(v);
+        layers[node.rank].push(v);
+        (_a = g.successors(v)) === null || _a === void 0 ? void 0 : _a.forEach((child) => dfs(child));
+    };
+    const orderedVs = simpleNodes.sort((a, b) => g.node(a).rank - g.node(b).rank);
+    // const orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });
+    // 有fixOrder的，直接排序好放进去
+    const beforeSort = orderedVs.filter((n) => {
+        return g.node(n).fixorder !== undefined;
+    });
+    const fixOrderNodes = beforeSort.sort((a, b) => g.node(a).fixorder - g.node(b).fixorder);
+    fixOrderNodes.forEach((n) => {
+        layers[g.node(n).rank].push(n);
+        visited[n] = true;
+    });
+    orderedVs.forEach(dfs);
+    return layers;
+};
+export default initOrder;
+//# sourceMappingURL=init-order.js.map

package/es/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,MAAM,SAAS,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC7B,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;;QACzC,OAAO,CAAC,CAAA,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,MAAM,CAAA,CAAC;IAChC,CAAC,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAe,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IACvC,MAAM,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,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;;QACxB,IAAI,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC;YAAE,OAAO;QACtC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAClB,MAAM,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,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,KAAY,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAe,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAe,CAAC,CAAC;IACtG,mFAAmF;IAEnF,sBAAsB;IACtB,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACxC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC;IAC1C,CAAC,CAAC,CAAC;IACH,MAAM,aAAa,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAmB,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAmB,CAAC,CAAC;IACjH,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,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,eAAe,SAAS,CAAC"}

package/es/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/es/layout/dagre/src/order/resolve-conflicts.js

@@ -0,0 +1,111 @@
+/*
+ * 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`.
+ */
+const resolveConflicts = (entries, cg) => {
+    var _a, _b;
+    const mappedEntries = {};
+    entries.forEach((entry, i) => {
+        const tmp = mappedEntries[entry.v] = {
+            i,
+            indegree: 0,
+            "in": [],
+            out: [],
+            vs: [entry.v],
+        };
+        if (entry.barycenter !== undefined) {
+            tmp.barycenter = entry.barycenter;
+            tmp.weight = entry.weight;
+        }
+    });
+    cg.edges().forEach((e) => {
+        const entryV = mappedEntries[e.v];
+        const entryW = mappedEntries[e.w];
+        if (entryV !== undefined && entryW !== undefined) {
+            entryW.indegree++;
+            entryV.out.push(mappedEntries[e.w]);
+        }
+    });
+    // @ts-ignore
+    const sourceSet = (_b = (_a = Object.values(mappedEntries)).filter) === null || _b === void 0 ? void 0 : _b.call(_a, (entry) => !entry.indegree);
+    return doResolveConflicts(sourceSet);
+};
+const doResolveConflicts = (sourceSet) => {
+    const entries = [];
+    const handleIn = (vEntry) => {
+        return (uEntry) => {
+            if (uEntry.merged)
+                return;
+            if (uEntry.barycenter !== undefined ||
+                vEntry.barycenter !== undefined ||
+                uEntry.barycenter >= vEntry.barycenter) {
+                mergeEntries(vEntry, uEntry);
+            }
+        };
+    };
+    const handleOut = (vEntry) => {
+        return (wEntry) => {
+            wEntry["in"].push(vEntry);
+            if (--wEntry.indegree === 0) {
+                sourceSet.push(wEntry);
+            }
+        };
+    };
+    while (sourceSet === null || sourceSet === void 0 ? void 0 : sourceSet.length) {
+        const entry = sourceSet.pop();
+        entries.push(entry);
+        entry["in"].reverse().forEach((e) => handleIn(entry));
+        entry.out.forEach((e) => handleOut(entry));
+    }
+    const filtered = entries.filter((entry) => !entry.merged);
+    const keys = ["vs", "i", "barycenter", "weight"];
+    return filtered.map((entry) => {
+        const picked = {};
+        keys.forEach((key) => {
+            if (entry[key] === undefined)
+                return;
+            picked[key] = entry[key];
+        });
+        return picked;
+    });
+};
+const mergeEntries = (target, source) => {
+    let sum = 0;
+    let 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;
+};
+export default resolveConflicts;
+//# sourceMappingURL=resolve-conflicts.js.map

package/es/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,MAAM,gBAAgB,GAAG,CAAC,OAAY,EAAE,EAAS,EAAE,EAAE;;IACnD,MAAM,aAAa,GAAQ,EAAE,CAAC;IAC9B,OAAO,CAAC,OAAO,CAAC,CAAC,KAAU,EAAE,CAAS,EAAE,EAAE;QACxC,MAAM,GAAG,GAAQ,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG;YACxC,CAAC;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,CAAC,CAAC,EAAE,EAAE;QACvB,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,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,MAAM,SAAS,GAAG,MAAA,MAAA,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAC,MAAM,mDAAG,CAAC,KAAU,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAEzF,OAAO,kBAAkB,CAAC,SAAS,CAAC,CAAC;AACvC,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,SAAc,EAAE,EAAE;IAC5C,MAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,MAAM,QAAQ,GAAG,CAAC,MAAW,EAAE,EAAE;QAC/B,OAAO,CAAC,MAAW,EAAE,EAAE;YACrB,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,MAAM,SAAS,GAAG,CAAC,MAAW,EAAE,EAAE;QAChC,OAAO,CAAC,MAAW,EAAE,EAAE;YACrB,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;IAEF,OAAO,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,MAAM,EAAE;QACxB,MAAM,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,CAAC,CAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3D,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;KACjD;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;IACjD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC5B,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;YACnB,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,MAAM,YAAY,GAAG,CAAC,MAAW,EAAE,MAAW,EAAE,EAAE;IAChD,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,eAAe,gBAAgB,CAAC"}

package/es/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/es/layout/dagre/src/order/sort-subgraph.js

@@ -0,0 +1,79 @@
+import barycenter from './barycenter';
+import resolveConflicts from './resolve-conflicts';
+import sort from './sort';
+const sortSubgraph = (g, v, cg, biasRight, usePrev) => {
+    var _a, _b, _c;
+    let movable = g.children(v);
+    // fixorder的点不参与排序（这个方案不合适，只排了新增节点，和原来的分离）
+    const node = g.node(v);
+    const bl = node ? node.borderLeft : undefined;
+    const br = node ? node.borderRight : undefined;
+    const subgraphs = {};
+    if (bl) {
+        movable = movable === null || movable === void 0 ? void 0 : movable.filter((w) => {
+            return w !== bl && w !== br;
+        });
+    }
+    const barycenters = barycenter(g, movable || []);
+    barycenters.forEach((entry) => {
+        var _a;
+        if ((_a = g.children(entry.v)) === null || _a === void 0 ? void 0 : _a.length) {
+            const subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
+            subgraphs[entry.v] = subgraphResult;
+            if (subgraphResult.hasOwnProperty("barycenter")) {
+                mergeBarycenters(entry, subgraphResult);
+            }
+        }
+    });
+    const entries = resolveConflicts(barycenters, cg);
+    expandSubgraphs(entries, subgraphs);
+    // 添加fixorder信息到entries里边
+    // TODO: 不考虑复合情况，只用第一个点的fixorder信息，后续考虑更完备的实现
+    entries.forEach((e) => {
+        const node = g.node(e.vs[0]);
+        e.fixorder = node.fixorder;
+        e.order = node.order;
+    });
+    const result = sort(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) {
+            const blPred = g.node(((_b = g.predecessors(bl)) === null || _b === void 0 ? void 0 : _b[0]) || {});
+            const 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;
+};
+const expandSubgraphs = (entries, subgraphs) => {
+    entries.forEach((entry) => {
+        const vss = entry.vs.map((v) => {
+            if (subgraphs[v]) {
+                return subgraphs[v].vs;
+            }
+            return v;
+        });
+        entry.vs = vss.flat();
+    });
+};
+const mergeBarycenters = (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;
+    }
+};
+export default sortSubgraph;
+//# sourceMappingURL=sort-subgraph.js.map

package/es/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,OAAO,UAAU,MAAM,cAAc,CAAC;AACtC,OAAO,gBAAgB,MAAM,qBAAqB,CAAC;AACnD,OAAO,IAAI,MAAM,QAAQ,CAAC;AAI1B,MAAM,YAAY,GAAG,CAAC,CAAQ,EAAE,CAAS,EAAE,EAAS,EAAE,SAAc,EAAE,OAAa,EAAE,EAAE;;IACrF,IAAI,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC5B,0CAA0C;IAC1C,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAA,CAAC,CAAC,SAAS,CAAC;IAC9C,MAAM,SAAS,GAAQ,EAAE,CAAC;IAE1B,IAAI,EAAE,EAAE;QACN,OAAO,GAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9B,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,CAAC,CAAC,CAAC;KACJ;IAED,MAAM,WAAW,GAAG,UAAU,CAAC,CAAC,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;IACjD,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;;QAC5B,IAAI,MAAA,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,MAAM,EAAE;YAC/B,MAAM,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,MAAM,OAAO,GAAG,gBAAgB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;IAClD,eAAe,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAEpC,yBAAyB;IACzB,6CAA6C;IAC7C,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACpB,MAAM,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,MAAM,MAAM,GAAG,IAAI,CAAC,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,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA,MAAA,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,0CAAG,CAAC,CAAC,KAAI,EAAE,CAAC,CAAC;YACrD,MAAM,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,MAAM,eAAe,GAAG,CAAC,OAAY,EAAE,SAAc,EAAE,EAAE;IACvD,OAAO,CAAC,OAAO,CAAC,CAAC,KAAU,EAAE,EAAE;QAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE;YACrC,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,MAAM,gBAAgB,GAAG,CAAC,MAAW,EAAE,KAAU,EAAE,EAAE;IACnD,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,eAAe,YAAY,CAAC"}

package/es/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/es/layout/dagre/src/order/sort.js

@@ -0,0 +1,67 @@
+import util from '../util';
+const sort = (entries, biasRight, usePrev) => {
+    const parts = util.partition(entries, (entry) => {
+        // NOTE: 有fixorder的也可以排
+        return (entry.hasOwnProperty("fixorder") && !isNaN(entry.fixorder)) || entry.hasOwnProperty("barycenter");
+    });
+    const sortable = parts.lhs;
+    const unsortable = parts.rhs.sort((a, b) => -a.i - (-b.i));
+    const vs = [];
+    let sum = 0;
+    let weight = 0;
+    let vsIndex = 0;
+    sortable.sort(compareWithBias(!!biasRight, !!usePrev));
+    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+    sortable.forEach((entry) => {
+        vsIndex += entry.vs.length;
+        vs.push(entry.vs);
+        sum += entry.barycenter * entry.weight;
+        weight += entry.weight;
+        vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+    });
+    const result = { vs: vs.flat() };
+    if (weight) {
+        result.barycenter = sum / weight;
+        result.weight = weight;
+    }
+    return result;
+};
+const consumeUnsortable = (vs, unsortable, index) => {
+    let iindex = index;
+    let last;
+    while (unsortable.length && (last = unsortable[unsortable.length - 1]).i <= iindex) {
+        unsortable.pop();
+        vs.push(last.vs);
+        iindex++;
+    }
+    return iindex;
+};
+/**
+ * 配置是否考虑使用之前的布局结果
+ */
+const compareWithBias = (bias, usePrev) => {
+    return (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;
+    };
+};
+export default sort;
+//# sourceMappingURL=sort.js.map

package/es/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,OAAO,IAAI,MAAM,SAAS,CAAC;AAE3B,MAAM,IAAI,GAAG,CAAC,OAAY,EAAE,SAAc,EAAE,OAAY,EAAE,EAAE;IAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,KAAU,EAAE,EAAE;QACnD,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,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;IAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,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,CAAC,KAAU,EAAE,EAAE;QAC9B,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,MAAM,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,MAAM,iBAAiB,GAAG,CAAC,EAAO,EAAE,UAAe,EAAE,KAAa,EAAE,EAAE;IACpE,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,MAAM,eAAe,GAAG,CAAC,IAAS,EAAE,OAAY,EAAE,EAAE;IAClD,OAAO,CAAC,MAAW,EAAE,MAAW,EAAE,EAAE;QAClC,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,eAAe,IAAI,CAAC"}

package/es/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/es/layout/dagre/src/parent-dummy-chains.js

@@ -0,0 +1,78 @@
+const parentDummyChains = (g) => {
+    var _a;
+    const postorderNums = postorder(g);
+    (_a = g.graph().dummyChains) === null || _a === void 0 ? void 0 : _a.forEach((v) => {
+        var _a, _b;
+        let node = g.node(v);
+        const edgeObj = node.edgeObj;
+        if (!edgeObj)
+            return;
+        const pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
+        const path = pathData.path;
+        const lca = pathData.lca;
+        let pathIdx = 0;
+        let pathV = path[pathIdx];
+        let 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.
+const findPath = (g, postorderNums, v, w) => {
+    const vPath = [];
+    const wPath = [];
+    const low = Math.min(postorderNums[v].low, postorderNums[w].low);
+    const lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
+    let parent;
+    let 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, path: vPath.concat(wPath.reverse()) };
+};
+const postorder = (g) => {
+    var _a;
+    const result = {};
+    let lim = 0;
+    const dfs = (v) => {
+        var _a;
+        const low = lim;
+        (_a = g.children(v)) === null || _a === void 0 ? void 0 : _a.forEach(dfs);
+        result[v] = { low, lim: lim++ };
+    };
+    (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach(dfs);
+    return result;
+};
+export default parentDummyChains;
+//# sourceMappingURL=parent-dummy-chains.js.map

package/es/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,MAAM,iBAAiB,GAAG,CAAC,CAAQ,EAAE,EAAE;;IACrC,MAAM,aAAa,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAEnC,MAAA,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,0CAAE,OAAO,CAAC,CAAC,CAAM,EAAE,EAAE;;QACxC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,OAAO;YAAE,OAAO;QACrB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,MAAM,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,MAAM,QAAQ,GAAG,CAAC,CAAQ,EAAE,aAAkB,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;IACtE,MAAM,KAAK,GAAG,EAAE,CAAC;IACjB,MAAM,KAAK,GAAG,EAAE,CAAC;IACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,MAAM,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,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACtD,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,CAAQ,EAAE,EAAE;;IAC7B,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;;QACxB,MAAM,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,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,eAAe,iBAAiB,CAAC"}

package/es/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;