@antv/layout 1.2.14-beta.9 → 2.0.0-alpha.2

package/lib/algorithm/antv-dagre/position/bk.js

@@ -0,0 +1,366 @@
+import { DagreGraph } from '../graph.js';
+import { minBy } from '../util.js';
+
+const findType1Conflicts = (g, layering) => {
+    const conflicts = {};
+    const visitLayer = (prevLayer, layer) => {
+        // last visited node in the previous layer that is incident on an inner
+        // segment.
+        let k0 = 0;
+        // Tracks the last node in this layer scanned for crossings with a type-1
+        // segment.
+        let scanPos = 0;
+        const prevLayerLength = prevLayer.length;
+        const lastNode = layer === null || layer === void 0 ? void 0 : layer[(layer === null || layer === void 0 ? void 0 : layer.length) - 1];
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {
+            var _a;
+            const w = findOtherInnerSegmentNode(g, v);
+            const k1 = w ? g.getNode(w.id).data.order : prevLayerLength;
+            if (w || v === lastNode) {
+                (_a = layer.slice(scanPos, i + 1)) === null || _a === void 0 ? void 0 : _a.forEach((scanNode) => {
+                    var _a;
+                    (_a = g.getPredecessors(scanNode)) === null || _a === void 0 ? void 0 : _a.forEach((u) => {
+                        var _a;
+                        const uLabel = g.getNode(u.id);
+                        const uPos = uLabel.data.order;
+                        if ((uPos < k0 || k1 < uPos) &&
+                            !(uLabel.data.dummy && ((_a = g.getNode(scanNode)) === null || _a === void 0 ? void 0 : _a.data.dummy))) {
+                            addConflict(conflicts, u.id, scanNode);
+                        }
+                    });
+                });
+                scanPos = i + 1;
+                k0 = k1;
+            }
+        });
+        return layer;
+    };
+    if (layering === null || layering === void 0 ? void 0 : layering.length) {
+        layering.reduce(visitLayer);
+    }
+    return conflicts;
+};
+const findType2Conflicts = (g, layering) => {
+    const conflicts = {};
+    function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
+        var _a, _b;
+        let v;
+        for (let i = southPos; i < southEnd; i++) {
+            v = south[i];
+            if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {
+                (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.forEach((u) => {
+                    const uNode = g.getNode(u.id);
+                    if (uNode.data.dummy &&
+                        (uNode.data.order < prevNorthBorder ||
+                            uNode.data.order > nextNorthBorder)) {
+                        addConflict(conflicts, u.id, v);
+                    }
+                });
+            }
+        }
+    }
+    function getScannedKey(params) {
+        // south数组可能很大，不适合做key
+        return JSON.stringify(params.slice(1));
+    }
+    function scanIfNeeded(params, scanCache) {
+        const cacheKey = getScannedKey(params);
+        if (scanCache.get(cacheKey))
+            return;
+        scan(...params);
+        scanCache.set(cacheKey, true);
+    }
+    const visitLayer = (north, south) => {
+        let prevNorthPos = -1;
+        let nextNorthPos;
+        let southPos = 0;
+        const scanned = new Map();
+        south === null || south === void 0 ? void 0 : south.forEach((v, southLookahead) => {
+            var _a;
+            if (((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) === 'border') {
+                const predecessors = g.getPredecessors(v) || [];
+                if (predecessors.length) {
+                    nextNorthPos = g.getNode(predecessors[0].id).data.order;
+                    scanIfNeeded([south, southPos, southLookahead, prevNorthPos, nextNorthPos], scanned);
+                    southPos = southLookahead;
+                    prevNorthPos = nextNorthPos;
+                }
+            }
+            scanIfNeeded([south, southPos, south.length, nextNorthPos, north.length], scanned);
+        });
+        return south;
+    };
+    if (layering === null || layering === void 0 ? void 0 : layering.length) {
+        layering.reduce(visitLayer);
+    }
+    return conflicts;
+};
+const findOtherInnerSegmentNode = (g, v) => {
+    var _a, _b;
+    if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {
+        return (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.find((u) => g.getNode(u.id).data.dummy);
+    }
+};
+const addConflict = (conflicts, v, w) => {
+    let vv = v;
+    let ww = w;
+    if (vv > ww) {
+        const tmp = vv;
+        vv = ww;
+        ww = tmp;
+    }
+    let conflictsV = conflicts[vv];
+    if (!conflictsV) {
+        conflicts[vv] = conflictsV = {};
+    }
+    conflictsV[ww] = true;
+};
+const hasConflict = (conflicts, v, w) => {
+    let vv = v;
+    let ww = w;
+    if (vv > ww) {
+        const tmp = v;
+        vv = ww;
+        ww = tmp;
+    }
+    return !!conflicts[vv];
+};
+/*
+ * Try to align nodes into vertical "blocks" where possible. This algorithm
+ * attempts to align a node with one of its median neighbors. If the edge
+ * connecting a neighbor is a type-1 conflict then we ignore that possibility.
+ * If a previous node has already formed a block with a node after the node
+ * we're trying to form a block with, we also ignore that possibility - our
+ * blocks would be split in that scenario.
+ */
+const verticalAlignment = (g, layering, conflicts, neighborFn) => {
+    const root = {};
+    const align = {};
+    const pos = {};
+    // We cache the position here based on the layering because the graph and
+    // layering may be out of sync. The layering matrix is manipulated to
+    // generate different extreme alignments.
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v, order) => {
+            root[v] = v;
+            align[v] = v;
+            pos[v] = order;
+        });
+    });
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        let prevIdx = -1;
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {
+            let ws = neighborFn(v).map((n) => n.id);
+            if (ws.length) {
+                ws = ws.sort((a, b) => pos[a] - pos[b]);
+                const mp = (ws.length - 1) / 2;
+                for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
+                    const w = ws[i];
+                    if (align[v] === v &&
+                        prevIdx < pos[w] &&
+                        !hasConflict(conflicts, v, w)) {
+                        align[w] = v;
+                        align[v] = root[v] = root[w];
+                        prevIdx = pos[w];
+                    }
+                }
+            }
+        });
+    });
+    return { root, align };
+};
+const horizontalCompaction = (g, layering, root, align, nodesep, edgesep, reverseSep) => {
+    var _a;
+    // This portion of the algorithm differs from BK due to a number of problems.
+    // Instead of their algorithm we construct a new block graph and do two
+    // sweeps. The first sweep places blocks with the smallest possible
+    // coordinates. The second sweep removes unused space by moving blocks to the
+    // greatest coordinates without violating separation.
+    const xs = {};
+    const blockG = buildBlockGraph(g, layering, root, nodesep, edgesep, reverseSep);
+    const borderType = reverseSep ? 'borderLeft' : 'borderRight';
+    const iterate = (setXsFunc, nextNodesFunc) => {
+        let stack = blockG.getAllNodes();
+        let elem = stack.pop();
+        const visited = {};
+        while (elem) {
+            if (visited[elem.id]) {
+                setXsFunc(elem.id);
+            }
+            else {
+                visited[elem.id] = true;
+                stack.push(elem);
+                stack = stack.concat(nextNodesFunc(elem.id));
+            }
+            elem = stack.pop();
+        }
+    };
+    // First pass, assign smallest coordinates
+    const pass1 = (elem) => {
+        xs[elem] = (blockG.getRelatedEdges(elem, 'in') || []).reduce((acc, e) => {
+            return Math.max(acc, (xs[e.source] || 0) + e.data.weight);
+        }, 0);
+    };
+    // Second pass, assign greatest coordinates
+    const pass2 = (elem) => {
+        const min = (blockG.getRelatedEdges(elem, 'out') || []).reduce((acc, e) => {
+            return Math.min(acc, (xs[e.target] || 0) - e.data.weight);
+        }, Number.POSITIVE_INFINITY);
+        const node = g.getNode(elem);
+        if (min !== Number.POSITIVE_INFINITY &&
+            node.data.borderType !== borderType) {
+            xs[elem] = Math.max(xs[elem], min);
+        }
+    };
+    iterate(pass1, blockG.getPredecessors.bind(blockG));
+    iterate(pass2, blockG.getSuccessors.bind(blockG));
+    // Assign x coordinates to all nodes
+    (_a = Object.values(align)) === null || _a === void 0 ? void 0 : _a.forEach((v) => {
+        xs[v] = xs[root[v]];
+    });
+    return xs;
+};
+const buildBlockGraph = (g, layering, root, nodesep, edgesep, reverseSep) => {
+    const blockGraph = new DagreGraph();
+    const sepFn = sep(nodesep, edgesep, reverseSep);
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        let u;
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {
+            const vRoot = root[v];
+            if (!blockGraph.hasNode(vRoot)) {
+                blockGraph.addNode({
+                    id: vRoot,
+                    data: {},
+                });
+            }
+            if (u) {
+                const uRoot = root[u];
+                const edge = blockGraph
+                    .getRelatedEdges(uRoot, 'out')
+                    .find((edge) => edge.target === vRoot);
+                if (!edge) {
+                    blockGraph.addEdge({
+                        id: `e${Math.random()}`,
+                        source: uRoot,
+                        target: vRoot,
+                        data: {
+                            weight: Math.max(sepFn(g, v, u), 0),
+                        },
+                    });
+                }
+                else {
+                    blockGraph.updateEdgeData(edge.id, Object.assign(Object.assign({}, edge.data), { weight: Math.max(sepFn(g, v, u), edge.data.weight || 0) }));
+                }
+            }
+            u = v;
+        });
+    });
+    return blockGraph;
+};
+/*
+ * Returns the alignment that has the smallest width of the given alignments.
+ */
+const findSmallestWidthAlignment = (g, xss) => {
+    return minBy(Object.values(xss), (xs) => {
+        var _a;
+        let max = Number.NEGATIVE_INFINITY;
+        let min = Number.POSITIVE_INFINITY;
+        (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach((v) => {
+            const x = xs[v];
+            const halfWidth = width(g, v) / 2;
+            max = Math.max(x + halfWidth, max);
+            min = Math.min(x - halfWidth, min);
+        });
+        return max - min;
+    });
+};
+/*
+ * Align the coordinates of each of the layout alignments such that
+ * left-biased alignments have their minimum coordinate at the same point as
+ * the minimum coordinate of the smallest width alignment and right-biased
+ * alignments have their maximum coordinate at the same point as the maximum
+ * coordinate of the smallest width alignment.
+ */
+function alignCoordinates(xss, alignTo) {
+    const alignToVals = Object.values(alignTo);
+    const alignToMin = Math.min(...alignToVals);
+    const alignToMax = Math.max(...alignToVals);
+    ['u', 'd'].forEach((vert) => {
+        ['l', 'r'].forEach((horiz) => {
+            const alignment = vert + horiz;
+            const xs = xss[alignment];
+            let delta;
+            if (xs === alignTo)
+                return;
+            const xsVals = Object.values(xs);
+            delta =
+                horiz === 'l'
+                    ? alignToMin - Math.min(...xsVals)
+                    : alignToMax - Math.max(...xsVals);
+            if (delta) {
+                xss[alignment] = {};
+                Object.keys(xs).forEach((key) => {
+                    xss[alignment][key] = xs[key] + delta;
+                });
+            }
+        });
+    });
+}
+const balance = (xss, align) => {
+    const result = {};
+    Object.keys(xss.ul).forEach((key) => {
+        if (align) {
+            result[key] = xss[align.toLowerCase()][key];
+        }
+        else {
+            const values = Object.values(xss).map((x) => x[key]);
+            result[key] = (values[0] + values[1]) / 2; // (ur + ul) / 2
+        }
+    });
+    return result;
+};
+const sep = (nodeSep, edgeSep, reverseSep) => {
+    return (g, v, w) => {
+        const vLabel = g.getNode(v);
+        const wLabel = g.getNode(w);
+        let sum = 0;
+        let delta = 0;
+        sum += vLabel.data.width / 2;
+        if (vLabel.data.hasOwnProperty('labelpos')) {
+            switch ((vLabel.data.labelpos || '').toLowerCase()) {
+                case 'l':
+                    delta = -vLabel.data.width / 2;
+                    break;
+                case 'r':
+                    delta = vLabel.data.width / 2;
+                    break;
+            }
+        }
+        if (delta) {
+            sum += reverseSep ? delta : -delta;
+        }
+        delta = 0;
+        sum += (vLabel.data.dummy ? edgeSep : nodeSep) / 2;
+        sum += (wLabel.data.dummy ? edgeSep : nodeSep) / 2;
+        sum += wLabel.data.width / 2;
+        if (wLabel.data.labelpos) {
+            switch ((wLabel.data.labelpos || '').toLowerCase()) {
+                case 'l':
+                    delta = wLabel.data.width / 2;
+                    break;
+                case 'r':
+                    delta = -wLabel.data.width / 2;
+                    break;
+            }
+        }
+        if (delta) {
+            sum += reverseSep ? delta : -delta;
+        }
+        delta = 0;
+        return sum;
+    };
+};
+const width = (g, v) => g.getNode(v).data.width || 0;
+
+export { addConflict, alignCoordinates, balance, buildBlockGraph, findOtherInnerSegmentNode, findSmallestWidthAlignment, findType1Conflicts, findType2Conflicts, hasConflict, horizontalCompaction, sep, verticalAlignment, width };
+//# sourceMappingURL=bk.js.map

package/lib/algorithm/antv-dagre/position/bk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bk.js","sources":["../../../../src/algorithm/antv-dagre/position/src/algorithm/antv-dagre/position/bk.ts"],"sourcesContent":[null],"names":[],"mappings":";;;MA8Ba,kBAAkB,GAAG,CAAC,CAAa,EAAE,QAAiB,KAAI;IACrE,MAAM,SAAS,GAAG,EAAE;AAEpB,IAAA,MAAM,UAAU,GAAG,CAAC,SAAe,EAAE,KAAW,KAAI;;;QAGlD,IAAI,EAAE,GAAG,CAAC;;;QAGV,IAAI,OAAO,GAAG,CAAC;AACf,QAAA,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM;AACxC,QAAA,MAAM,QAAQ,GAAG,KAAK,aAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAG,CAAA,KAAK,KAAA,IAAA,IAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,IAAG,CAAC,CAAC;AAE3C,QAAA,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAK,EAAE,CAAS,KAAI;;YAClC,MAAM,CAAC,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC;YACzC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,KAAM,GAAG,eAAe;AAE7D,YAAA,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;AACvB,gBAAA,CAAA,EAAA,GAAA,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,QAAQ,KAAI;;AAChD,oBAAA,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;;wBACzC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;AAC/B,wBAAA,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM;wBAC/B,IACE,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI;4BACvB,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,KAAI,MAAA,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,IAAI,CAAC,KAAK,CAAA,CAAC,EACvD;4BACA,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC;AACvC,wBAAA;AACH,oBAAA,CAAC,CAAC;AACJ,gBAAA,CAAC,CAAC;AACF,gBAAA,OAAO,GAAG,CAAC,GAAG,CAAC;gBACf,EAAE,GAAG,EAAE;AACR,YAAA;AACH,QAAA,CAAC,CAAC;AAEF,QAAA,OAAO,KAAK;AACd,IAAA,CAAC;AAED,IAAA,IAAI,QAAQ,KAAA,IAAA,IAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;AACpB,QAAA,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC;AAC5B,IAAA;AACD,IAAA,OAAO,SAAS;AAClB;MAEa,kBAAkB,GAAG,CAAC,CAAa,EAAE,QAAiB,KAAI;IACrE,MAAM,SAAS,GAAG,EAAE;IAEpB,SAAS,IAAI,CACX,KAAW,EACX,QAAgB,EAChB,QAAgB,EAChB,eAAuB,EACvB,eAAuB,EAAA;;AAEvB,QAAA,IAAI,CAAK;QACT,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;AACxC,YAAA,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACZ,IAAI,CAAA,EAAA,GAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,IAAI,CAAC,KAAK,EAAE;AAC5B,gBAAA,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;oBAClC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;AAC9B,oBAAA,IACE,KAAK,CAAC,IAAI,CAAC,KAAK;AAChB,yBAAC,KAAK,CAAC,IAAI,CAAC,KAAM,GAAG,eAAe;AAClC,4BAAA,KAAK,CAAC,IAAI,CAAC,KAAM,GAAG,eAAe,CAAC,EACtC;wBACA,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAChC,oBAAA;AACH,gBAAA,CAAC,CAAC;AACH,YAAA;AACF,QAAA;IACH;IAEA,SAAS,aAAa,CAAC,MAA+B,EAAA;;QAEpD,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxC;AAEA,IAAA,SAAS,YAAY,CACnB,MAA+B,EAC/B,SAA2B,EAAA;AAE3B,QAAA,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC;AAEtC,QAAA,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE;AAE7B,QAAA,IAAI,CAAC,GAAG,MAAM,CAAC;AACf,QAAA,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC;IAC/B;AAEA,IAAA,MAAM,UAAU,GAAG,CAAC,KAAW,EAAE,KAAW,KAAI;AAC9C,QAAA,IAAI,YAAY,GAAG,EAAE;AACrB,QAAA,IAAI,YAAoB;QACxB,IAAI,QAAQ,GAAG,CAAC;AAEhB,QAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAe;AAEtC,QAAA,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAK,EAAE,cAAsB,KAAI;;AAC/C,YAAA,IAAI,CAAA,CAAA,EAAA,GAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,IAAI,CAAC,KAAK,MAAK,QAAQ,EAAE;gBACzC,MAAM,YAAY,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE;gBAC/C,IAAI,YAAY,CAAC,MAAM,EAAE;AACvB,oBAAA,YAAY,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,KAAM;AACzD,oBAAA,YAAY,CACV,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,YAAY,EAAE,YAAY,CAAC,EAC7D,OAAO,CACR;oBACD,QAAQ,GAAG,cAAc;oBACzB,YAAY,GAAG,YAAY;AAC5B,gBAAA;AACF,YAAA;AACD,YAAA,YAAY,CACV,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,CAAC,EAC3D,OAAO,CACR;AACH,QAAA,CAAC,CAAC;AAEF,QAAA,OAAO,KAAK;AACd,IAAA,CAAC;AAED,IAAA,IAAI,QAAQ,KAAA,IAAA,IAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;AACpB,QAAA,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC;AAC5B,IAAA;AACD,IAAA,OAAO,SAAS;AAClB;MAEa,yBAAyB,GAAG,CAAC,CAAa,EAAE,CAAK,KAAI;;IAChE,IAAI,CAAA,EAAA,GAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,IAAI,CAAC,KAAK,EAAE;AAC5B,QAAA,OAAO,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;AACrE,IAAA;AACH;AAEO,MAAM,WAAW,GAAG,CAAC,SAAoB,EAAE,CAAK,EAAE,CAAK,KAAI;IAChE,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,EAAE,EAAE;QACX,MAAM,GAAG,GAAG,EAAE;QACd,EAAE,GAAG,EAAE;QACP,EAAE,GAAG,GAAG;AACT,IAAA;AAED,IAAA,IAAI,UAAU,GAAG,SAAS,CAAC,EAAE,CAAC;IAC9B,IAAI,CAAC,UAAU,EAAE;AACf,QAAA,SAAS,CAAC,EAAE,CAAC,GAAG,UAAU,GAAG,EAAE;AAChC,IAAA;AACD,IAAA,UAAU,CAAC,EAAE,CAAC,GAAG,IAAI;AACvB;AAEO,MAAM,WAAW,GAAG,CAAC,SAAoB,EAAE,CAAK,EAAE,CAAK,KAAI;IAChE,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,CAAC;IACV,IAAI,EAAE,GAAG,EAAE,EAAE;QACX,MAAM,GAAG,GAAG,CAAC;QACb,EAAE,GAAG,EAAE;QACP,EAAE,GAAG,GAAG;AACT,IAAA;AACD,IAAA,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;AACxB;AAEA;;;;;;;AAOG;AACI,MAAM,iBAAiB,GAAG,CAC/B,CAAa,EACb,QAAgB,EAChB,SAAoB,EACpB,UAAiC,KAC/B;IACF,MAAM,IAAI,GAAmB,EAAE;IAC/B,MAAM,KAAK,GAAmB,EAAE;IAChC,MAAM,GAAG,GAAuB,EAAE;;;;IAKlC,QAAQ,KAAA,IAAA,IAAR,QAAQ,KAAA,MAAA,GAAA,MAAA,GAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,KAAI;AAC1B,QAAA,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAa,KAAI;AAClC,YAAA,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;AACX,YAAA,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;AACZ,YAAA,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK;AAChB,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC,CAAC;IAEF,QAAQ,KAAA,IAAA,IAAR,QAAQ,KAAA,MAAA,GAAA,MAAA,GAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,KAAI;AAC1B,QAAA,IAAI,OAAO,GAAG,EAAE;QAChB,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;AACnB,YAAA,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAEvC,IAAI,EAAE,CAAC,MAAM,EAAE;gBACb,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAK,EAAE,CAAK,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/C,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC;gBAC9B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE;AAC7D,oBAAA,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACf,oBAAA,IACE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AACd,wBAAA,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;wBAChB,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,EAC7B;AACA,wBAAA,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;AACZ,wBAAA,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAC5B,wBAAA,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;AACjB,oBAAA;AACF,gBAAA;AACF,YAAA;AACH,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE;AACxB;AAEO,MAAM,oBAAoB,GAAG,CAClC,CAAa,EACb,QAAgB,EAChB,IAAoB,EACpB,KAAqB,EACrB,OAAe,EACf,OAAe,EACf,UAAoB,KAClB;;;;;;;IAMF,MAAM,EAAE,GAAuB,EAAE;AACjC,IAAA,MAAM,MAAM,GAAG,eAAe,CAC5B,CAAC,EACD,QAAQ,EACR,IAAI,EACJ,OAAO,EACP,OAAO,EACP,UAAU,CACX;IACD,MAAM,UAAU,GAAG,UAAU,GAAG,YAAY,GAAG,aAAa;AAE5D,IAAA,MAAM,OAAO,GAAG,CACd,SAA8B,EAC9B,aAAmD,KACjD;AACF,QAAA,IAAI,KAAK,GAAG,MAAM,CAAC,WAAW,EAAE;AAChC,QAAA,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE;QACtB,MAAM,OAAO,GAAwB,EAAE;AACvC,QAAA,OAAO,IAAI,EAAE;AACX,YAAA,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;AACpB,gBAAA,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;AACnB,YAAA;AAAM,iBAAA;AACL,gBAAA,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI;AACvB,gBAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAChB,gBAAA,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7C,YAAA;AAED,YAAA,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE;AACnB,QAAA;AACH,IAAA,CAAC;;AAGD,IAAA,MAAM,KAAK,GAAG,CAAC,IAAQ,KAAI;QACzB,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,MAAM,CAC1D,CAAC,GAAW,EAAE,CAAC,KAAI;YACjB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;QAC5D,CAAC,EACD,CAAC,CACF;AACH,IAAA,CAAC;;AAGD,IAAA,MAAM,KAAK,GAAG,CAAC,IAAQ,KAAI;QACzB,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,MAAM,CAC5D,CAAC,GAAW,EAAE,CAAC,KAAI;YACjB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;AAC5D,QAAA,CAAC,EACD,MAAM,CAAC,iBAAiB,CACzB;QAED,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAE;AAC7B,QAAA,IACE,GAAG,KAAK,MAAM,CAAC,iBAAiB;AAChC,YAAA,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,UAAU,EACnC;AACA,YAAA,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;AACnC,QAAA;AACH,IAAA,CAAC;AAED,IAAA,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACnD,IAAA,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;;AAGjD,IAAA,CAAA,EAAA,GAAA,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;QAClC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACrB,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,EAAE;AACX;AAEO,MAAM,eAAe,GAAG,CAC7B,CAAa,EACb,QAAgB,EAChB,IAAoB,EACpB,OAAe,EACf,OAAe,EACf,UAAoB,KACc;AAClC,IAAA,MAAM,UAAU,GAAG,IAAI,UAAU,EAAsB;IACvD,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,UAAqB,CAAC;IAE1D,QAAQ,KAAA,IAAA,IAAR,QAAQ,KAAA,MAAA,GAAA,MAAA,GAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,KAAI;AAC1B,QAAA,IAAI,CAAK;QACT,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;AACnB,YAAA,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;AACrB,YAAA,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;gBAC9B,UAAU,CAAC,OAAO,CAAC;AACjB,oBAAA,EAAE,EAAE,KAAK;AACT,oBAAA,IAAI,EAAE,EAAE;AACT,iBAAA,CAAC;AACH,YAAA;AACD,YAAA,IAAI,CAAC,EAAE;AACL,gBAAA,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;gBAErB,MAAM,IAAI,GAAG;AACV,qBAAA,eAAe,CAAC,KAAK,EAAE,KAAK;AAC5B,qBAAA,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC;gBACxC,IAAI,CAAC,IAAI,EAAE;oBACT,UAAU,CAAC,OAAO,CAAC;AACjB,wBAAA,EAAE,EAAE,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;AACvB,wBAAA,MAAM,EAAE,KAAK;AACb,wBAAA,MAAM,EAAE,KAAK;AACb,wBAAA,IAAI,EAAE;AACJ,4BAAA,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AACpC,yBAAA;AACF,qBAAA,CAAC;AACH,gBAAA;AAAM,qBAAA;AACL,oBAAA,UAAU,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAC5B,IAAI,CAAC,IAAI,CAAA,EAAA,EACZ,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,CAAC,IACxD;AACH,gBAAA;AACF,YAAA;YACD,CAAC,GAAG,CAAC;AACP,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,UAAU;AACnB;AACA;;AAEG;MACU,0BAA0B,GAAG,CACxC,CAAa,EACb,GAA2C,KACzC;AACF,IAAA,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAI;;AACtC,QAAA,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB;AAClC,QAAA,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB;AAElC,QAAA,CAAA,EAAA,GAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAS,KAAI;AACrC,YAAA,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACf,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;YAEjC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC;YAClC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC;AACpC,QAAA,CAAC,CAAC;QAEF,OAAO,GAAG,GAAG,GAAG;AAClB,IAAA,CAAC,CAAC;AACJ;AAEA;;;;;;AAMG;AACG,SAAU,gBAAgB,CAC9B,GAA2C,EAC3C,OAA+B,EAAA;IAE/B,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;IAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;IAE3C,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;QAC1B,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,KAAI;AAC3B,YAAA,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AAC9B,YAAA,MAAM,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC;AACzB,YAAA,IAAI,KAAa;YACjB,IAAI,EAAE,KAAK,OAAO;gBAAE;YAEpB,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YAChC,KAAK;AACH,gBAAA,KAAK,KAAK;sBACN,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM;sBAC/B,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;AAEtC,YAAA,IAAI,KAAK,EAAE;AACT,gBAAA,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE;gBACnB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,KAAI;AAC9B,oBAAA,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK;AACvC,gBAAA,CAAC,CAAC;AACH,YAAA;AACH,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC,CAAC;AACJ;MAEa,OAAO,GAAG,CACrB,GAA2C,EAC3C,KAAkB,KAChB;IACF,MAAM,MAAM,GAA2B,EAAE;AACzC,IAAA,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,KAAI;AAClC,QAAA,IAAI,KAAK,EAAE;AACT,YAAA,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,GAAG,CAAC;AAC5C,QAAA;AAAM,aAAA;YACL,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;AACpD,YAAA,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC3C,QAAA;AACH,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,MAAM;AACf;AA8DO,MAAM,GAAG,GAAG,CAAC,OAAe,EAAE,OAAe,EAAE,UAAmB,KAAI;AAC3E,IAAA,OAAO,CAAC,CAAa,EAAE,CAAK,EAAE,CAAK,KAAI;QACrC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;QAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;QAC5B,IAAI,GAAG,GAAG,CAAC;QACX,IAAI,KAAK,GAAW,CAAC;QAErB,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC;QAC7B,IAAI,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE;AAC1C,YAAA,QAAQ,CAAE,MAAM,CAAC,IAAI,CAAC,QAAmB,IAAI,EAAE,EAAE,WAAW,EAAE;AAC5D,gBAAA,KAAK,GAAG;oBACN,KAAK,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC;oBAC/B;AACF,gBAAA,KAAK,GAAG;oBACN,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC;oBAC9B;AACH;AACF,QAAA;AACD,QAAA,IAAI,KAAK,EAAE;YACT,GAAG,IAAI,UAAU,GAAG,KAAK,GAAG,CAAC,KAAK;AACnC,QAAA;QACD,KAAK,GAAG,CAAC;AAET,QAAA,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,GAAG,OAAO,IAAI,CAAC;AAClD,QAAA,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,GAAG,OAAO,IAAI,CAAC;QAElD,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC;AAC7B,QAAA,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE;AACxB,YAAA,QAAQ,CAAE,MAAM,CAAC,IAAI,CAAC,QAAmB,IAAI,EAAE,EAAE,WAAW,EAAE;AAC5D,gBAAA,KAAK,GAAG;oBACN,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC;oBAC9B;AACF,gBAAA,KAAK,GAAG;oBACN,KAAK,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC;oBAC/B;AACH;AACF,QAAA;AACD,QAAA,IAAI,KAAK,EAAE;YACT,GAAG,IAAI,UAAU,GAAG,KAAK,GAAG,CAAC,KAAK;AACnC,QAAA;QACD,KAAK,GAAG,CAAC;AAET,QAAA,OAAO,GAAG;AACZ,IAAA,CAAC;AACH;MAEa,KAAK,GAAG,CAAC,CAAa,EAAE,CAAK,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,KAAM,IAAI;;;;"}

package/lib/algorithm/antv-dagre/position/index.js

@@ -0,0 +1,54 @@
+import { asNonCompoundGraph, buildLayerMatrix } from '../util.js';
+import { findType1Conflicts, findType2Conflicts, verticalAlignment, horizontalCompaction, findSmallestWidthAlignment, alignCoordinates, balance } from './bk.js';
+
+const positionY = (g, options) => {
+    const { ranksep = 0 } = options || {};
+    const layering = buildLayerMatrix(g);
+    let prevY = 0;
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        const heights = layer.map((v) => g.getNode(v).data.height);
+        const maxHeight = Math.max(...heights, 0);
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {
+            g.getNode(v).data.y = prevY + maxHeight / 2;
+        });
+        prevY += maxHeight + ranksep;
+    });
+};
+const positionX = (g, options) => {
+    const { align: graphAlign, nodesep = 0, edgesep = 0 } = options || {};
+    const layering = buildLayerMatrix(g);
+    const conflicts = Object.assign(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
+    const xss = {};
+    let adjustedLayering = [];
+    ['u', 'd'].forEach((vert) => {
+        adjustedLayering =
+            vert === 'u' ? layering : Object.values(layering).reverse();
+        ['l', 'r'].forEach((horiz) => {
+            if (horiz === 'r') {
+                adjustedLayering = adjustedLayering.map((inner) => Object.values(inner).reverse());
+            }
+            const neighborFn = (vert === 'u' ? g.getPredecessors : g.getSuccessors).bind(g);
+            const align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+            const xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, nodesep, edgesep, horiz === 'r');
+            if (horiz === 'r') {
+                Object.keys(xs).forEach((xsKey) => (xs[xsKey] = -xs[xsKey]));
+            }
+            xss[vert + horiz] = xs;
+        });
+    });
+    const smallestWidth = findSmallestWidthAlignment(g, xss);
+    smallestWidth && alignCoordinates(xss, smallestWidth);
+    return balance(xss, graphAlign);
+};
+const position = (g, options) => {
+    var _a;
+    const ng = asNonCompoundGraph(g);
+    positionY(ng, options);
+    const xs = positionX(ng, options);
+    (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach((key) => {
+        ng.getNode(key).data.x = xs[key];
+    });
+};
+
+export { position };
+//# sourceMappingURL=index.js.map

package/lib/algorithm/antv-dagre/position/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../src/algorithm/antv-dagre/position/src/algorithm/antv-dagre/position/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;AAcA,MAAM,SAAS,GAAG,CAChB,CAAa,EACb,OAEE,KACA;IACF,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,OAAO,IAAI,EAAE;AACrC,IAAA,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC;IAEpC,IAAI,KAAK,GAAG,CAAC;IACb,QAAQ,KAAA,IAAA,IAAR,QAAQ,KAAA,MAAA,GAAA,MAAA,GAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,KAAI;QAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;QAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC;QACzC,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAK,KAAI;AACvB,YAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,CAAC;AAC7C,QAAA,CAAC,CAAC;AACF,QAAA,KAAK,IAAI,SAAS,GAAG,OAAO;AAC9B,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,SAAS,GAAG,CAChB,CAAa,EACb,OAIE,KACoB;AACtB,IAAA,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,OAAO,IAAI,EAAE;AAErE,IAAA,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC;IACpC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAChC;IAED,MAAM,GAAG,GAA2C,EAAE;IACtD,IAAI,gBAAgB,GAAW,EAAE;IACjC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;QAC1B,gBAAgB;AACd,YAAA,IAAI,KAAK,GAAG,GAAG,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE;QAC7D,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,KAAI;YAC3B,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,KAAK,KAC5C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAC/B;AACF,YAAA;YAED,MAAM,UAAU,GAAG,CACjB,IAAI,KAAK,GAAG,GAAG,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,aAAa,EAClD,IAAI,CAAC,CAAC,CAAC;AACT,YAAA,MAAM,KAAK,GAAG,iBAAiB,CAC7B,CAAC,EACD,gBAAgB,EAChB,SAAS,EACT,UAAU,CACX;YACD,MAAM,EAAE,GAAG,oBAAoB,CAC7B,CAAC,EACD,gBAAgB,EAChB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,KAAK,EACX,OAAO,EACP,OAAO,EACP,KAAK,KAAK,GAAG,CACd;YACD,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;AAC7D,YAAA;AACD,YAAA,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE;AACxB,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,0BAA0B,CAAC,CAAC,EAAE,GAAG,CAAC;AACxD,IAAA,aAAa,IAAI,gBAAgB,CAAC,GAAG,EAAE,aAAa,CAAC;AACrD,IAAA,OAAO,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC;AACjC,CAAC;MAEY,QAAQ,GAAG,CACtB,CAAa,EACb,OAKE,KACA;;AACF,IAAA,MAAM,EAAE,GAAG,kBAAkB,CAAC,CAAC,CAAC;AAEhC,IAAA,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC;IACtB,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC;AACjC,IAAA,CAAA,EAAA,GAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,GAAO,KAAI;AACnC,QAAA,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;AAClC,IAAA,CAAC,CAAC;AACJ;;;;"}

package/lib/algorithm/antv-dagre/rank/feasible-tree.js

@@ -0,0 +1,166 @@
+import { DagreGraph } from '../graph.js';
+import { minBy } from '../util.js';
+import { slack } from './util.js';
+
+/*
+ * Constructs a spanning tree with tight edges and adjusted the input node's
+ * ranks to achieve this. A tight edge is one that is has a length that matches
+ * its "minlen" attribute.
+ *
+ * The basic structure for this function is derived from Gansner, et al., "A
+ * Technique for Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be a DAG.
+ *    2. Graph must be connected.
+ *    3. Graph must have at least one node.
+ *    5. Graph nodes must have been previously assigned a "rank" property that
+ *       respects the "minlen" property of incident edges.
+ *    6. Graph edges must have a "minlen" property.
+ *
+ * Post-conditions:
+ *
+ *    - Graph nodes will have their rank adjusted to ensure that all edges are
+ *      tight.
+ *
+ * Returns a tree (undirected graph) that is constructed using only "tight"
+ * edges.
+ */
+const feasibleTree = (g) => {
+    const t = new DagreGraph({
+        tree: [],
+    });
+    // Choose arbitrary node from which to start our tree
+    const start = g.getAllNodes()[0];
+    const size = g.getAllNodes().length;
+    t.addNode(start);
+    let edge;
+    let delta;
+    while (tightTree(t, g) < size) {
+        edge = findMinSlackEdge(t, g);
+        delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);
+        shiftRanks(t, g, delta);
+    }
+    return t;
+};
+/*
+ * Finds a maximal tree of tight edges and returns the number of nodes in the
+ * tree.
+ */
+const tightTree = (t, g) => {
+    const dfs = (v) => {
+        g.getRelatedEdges(v, 'both').forEach((e) => {
+            const edgeV = e.source;
+            const w = v === edgeV ? e.target : edgeV;
+            if (!t.hasNode(w) && !slack(g, e)) {
+                t.addNode({
+                    id: w,
+                    data: {},
+                });
+                t.addEdge({
+                    id: e.id,
+                    source: v,
+                    target: w,
+                    data: {},
+                });
+                dfs(w);
+            }
+        });
+    };
+    t.getAllNodes().forEach((n) => dfs(n.id));
+    return t.getAllNodes().length;
+};
+/*
+ * Constructs a spanning tree with tight edges and adjusted the input node's
+ * ranks to achieve this. A tight edge is one that is has a length that matches
+ * its "minlen" attribute.
+ *
+ * The basic structure for this function is derived from Gansner, et al., "A
+ * Technique for Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be a DAG.
+ *    2. Graph must be connected.
+ *    3. Graph must have at least one node.
+ *    5. Graph nodes must have been previously assigned a "rank" property that
+ *       respects the "minlen" property of incident edges.
+ *    6. Graph edges must have a "minlen" property.
+ *
+ * Post-conditions:
+ *
+ *    - Graph nodes will have their rank adjusted to ensure that all edges are
+ *      tight.
+ *
+ * Returns a tree (undirected graph) that is constructed using only "tight"
+ * edges.
+ */
+const feasibleTreeWithLayer = (g) => {
+    const t = new DagreGraph({ tree: [] });
+    // Choose arbitrary node from which to start our tree
+    const start = g.getAllNodes()[0];
+    const size = g.getAllNodes().length;
+    t.addNode(start);
+    let edge;
+    let delta;
+    while (tightTreeWithLayer(t, g) < size) {
+        edge = findMinSlackEdge(t, g);
+        delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);
+        shiftRanks(t, g, delta);
+    }
+    return t;
+};
+/*
+ * Finds a maximal tree of tight edges and returns the number of nodes in the
+ * tree.
+ */
+const tightTreeWithLayer = (t, g) => {
+    const dfs = (v) => {
+        var _a;
+        (_a = g.getRelatedEdges(v, 'both')) === null || _a === void 0 ? void 0 : _a.forEach((e) => {
+            const edgeV = e.source;
+            const w = v === edgeV ? e.target : edgeV;
+            // 对于指定layer的，直接加入tight-tree，不参与调整
+            if (!t.hasNode(w) &&
+                (g.getNode(w).data.layer !== undefined || !slack(g, e))) {
+                t.addNode({
+                    id: w,
+                    data: {},
+                });
+                t.addEdge({
+                    id: e.id,
+                    source: v,
+                    target: w,
+                    data: {},
+                });
+                dfs(w);
+            }
+        });
+    };
+    t.getAllNodes().forEach((n) => dfs(n.id));
+    return t.getAllNodes().length;
+};
+/*
+ * Finds the edge with the smallest slack that is incident on tree and returns
+ * it.
+ */
+const findMinSlackEdge = (t, g) => {
+    return minBy(g.getAllEdges(), (e) => {
+        if (t.hasNode(e.source) !== t.hasNode(e.target)) {
+            return slack(g, e);
+        }
+        return Infinity;
+    });
+};
+const shiftRanks = (t, g, delta) => {
+    t.getAllNodes().forEach((tn) => {
+        const v = g.getNode(tn.id);
+        if (!v.data.rank)
+            v.data.rank = 0;
+        v.data.rank += delta;
+    });
+};
+
+export { feasibleTree, feasibleTreeWithLayer };
+//# sourceMappingURL=feasible-tree.js.map

package/lib/algorithm/antv-dagre/rank/feasible-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"feasible-tree.js","sources":["../../../../src/algorithm/antv-dagre/rank/src/algorithm/antv-dagre/rank/feasible-tree.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;AAKA;;;;;;;;;;;;;;;;;;;;;;;;AAwBG;AACH,MAAM,YAAY,GAAG,CAAC,CAAa,KAAI;AACrC,IAAA,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC;AACvB,QAAA,IAAI,EAAE,EAAE;AACT,KAAA,CAAC;;IAGF,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM;AACnC,IAAA,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAEhB,IAAA,IAAI,IAAyB;AAC7B,IAAA,IAAI,KAAa;IACjB,OAAO,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE;AAC7B,QAAA,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;AAC7B,QAAA,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;AACjE,QAAA,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;AACxB,IAAA;AAED,IAAA,OAAO,CAAC;AACV;AAEA;;;AAGG;AACH,MAAM,SAAS,GAAG,CAAC,CAAa,EAAE,CAAa,KAAI;AACjD,IAAA,MAAM,GAAG,GAAG,CAAC,CAAK,KAAI;AACpB,QAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AACzC,YAAA,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM;AACtB,YAAA,MAAM,CAAC,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,KAAK;AACxC,YAAA,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACjC,CAAC,CAAC,OAAO,CAAC;AACR,oBAAA,EAAE,EAAE,CAAC;AACL,oBAAA,IAAI,EAAE,EAAE;AACT,iBAAA,CAAC;gBACF,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC,CAAC,EAAE;AACR,oBAAA,MAAM,EAAE,CAAC;AACT,oBAAA,MAAM,EAAE,CAAC;AACT,oBAAA,IAAI,EAAE,EAAE;AACT,iBAAA,CAAC;gBACF,GAAG,CAAC,CAAC,CAAC;AACP,YAAA;AACH,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC;AAED,IAAA,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACzC,IAAA,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;AAwBG;AACH,MAAM,qBAAqB,GAAG,CAAC,CAAa,KAAI;IAC9C,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;;IAGtC,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM;AACnC,IAAA,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAEhB,IAAA,IAAI,IAAyB;AAC7B,IAAA,IAAI,KAAa;IACjB,OAAO,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,GAAG,IAAI,EAAE;AACvC,QAAA,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;AAC7B,QAAA,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;AACjE,QAAA,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;AACxB,IAAA;AAED,IAAA,OAAO,CAAC;AACV;AAEA;;;AAGG;AACH,MAAM,kBAAkB,GAAG,CAAC,CAAa,EAAE,CAAa,KAAI;AAC1D,IAAA,MAAM,GAAG,GAAG,CAAC,CAAK,KAAI;;AACpB,QAAA,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;AAC1C,YAAA,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM;AACtB,YAAA,MAAM,CAAC,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,KAAK;;AAExC,YAAA,IACE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;iBACZ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EACxD;gBACA,CAAC,CAAC,OAAO,CAAC;AACR,oBAAA,EAAE,EAAE,CAAC;AACL,oBAAA,IAAI,EAAE,EAAE;AACT,iBAAA,CAAC;gBACF,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC,CAAC,EAAE;AACR,oBAAA,MAAM,EAAE,CAAC;AACT,oBAAA,MAAM,EAAE,CAAC;AACT,oBAAA,IAAI,EAAE,EAAE;AACT,iBAAA,CAAC;gBACF,GAAG,CAAC,CAAC,CAAC;AACP,YAAA;AACH,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC;AAED,IAAA,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACzC,IAAA,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM;AAC/B,CAAC;AAED;;;AAGG;AACH,MAAM,gBAAgB,GAAG,CAAC,CAAa,EAAE,CAAa,KAAI;IACxD,OAAO,KAAK,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,KAAI;AAClC,QAAA,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE;AAC/C,YAAA,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;AACnB,QAAA;AACD,QAAA,OAAO,QAAQ;AACjB,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,GAAG,CAAC,CAAa,EAAE,CAAa,EAAE,KAAa,KAAI;IACjE,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,KAAI;QAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;AAC1B,QAAA,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;AAAE,YAAA,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;AACjC,QAAA,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,KAAK;AACvB,IAAA,CAAC,CAAC;AACJ,CAAC;;;;"}