@antv/layout 2.0.0-beta.2 → 2.0.1

package/esm/algorithm/antv-dagre/normalize.js

@@ -0,0 +1,100 @@
+import { addDummyNode } from './util.js';
+
+/*
+ * Breaks any long edges in the graph into short segments that span 1 layer
+ * each. This operation is undoable with the denormalize function.
+ *
+ * Pre-conditions:
+ *
+ *    1. The input graph is a DAG.
+ *    2. Each node in the graph has a "rank" property.
+ *
+ * Post-condition:
+ *
+ *    1. All edges in the graph have a length of 1.
+ *    2. Dummy nodes are added where edges have been split into segments.
+ *    3. The graph is augmented with a "dummyChains" attribute which contains
+ *       the first dummy in each chain of dummy nodes produced.
+ */
+const DUMMY_NODE_EDGE = 'edge';
+const DUMMY_NODE_EDGE_LABEL = 'edge-label';
+const run = (g, dummyChains) => {
+    g.getAllEdges().forEach((edge) => normalizeEdge(g, edge, dummyChains));
+};
+const normalizeEdge = (g, e, dummyChains) => {
+    let v = e.source;
+    let vRank = g.getNode(v).data.rank;
+    const w = e.target;
+    const wRank = g.getNode(w).data.rank;
+    const labelRank = e.data.labelRank;
+    if (wRank === vRank + 1)
+        return;
+    g.removeEdge(e.id);
+    let dummy;
+    let nodeData;
+    let i;
+    for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
+        e.data.points = [];
+        nodeData = {
+            originalEdge: e,
+            width: 0,
+            height: 0,
+            rank: vRank,
+        };
+        dummy = addDummyNode(g, DUMMY_NODE_EDGE, nodeData, '_d');
+        if (vRank === labelRank) {
+            nodeData.width = e.data.width;
+            nodeData.height = e.data.height;
+            nodeData.dummy = DUMMY_NODE_EDGE_LABEL;
+            nodeData.labelpos = e.data.labelpos;
+        }
+        g.addEdge({
+            id: `e${Math.random()}`,
+            source: v,
+            target: dummy,
+            data: { weight: e.data.weight },
+        });
+        if (i === 0) {
+            dummyChains.push(dummy);
+        }
+        v = dummy;
+    }
+    g.addEdge({
+        id: `e${Math.random()}`,
+        source: v,
+        target: w,
+        data: { weight: e.data.weight },
+    });
+};
+const undo = (g, dummyChains) => {
+    dummyChains.forEach((v) => {
+        let node = g.getNode(v);
+        const { data } = node;
+        const originalEdge = data.originalEdge;
+        let w;
+        // Restore original edge.
+        if (originalEdge) {
+            g.addEdge(originalEdge);
+        }
+        let currentV = v;
+        while (node.data.dummy) {
+            w = g.getSuccessors(currentV)[0];
+            g.removeNode(currentV);
+            originalEdge.data.points.push({
+                x: node.data.x,
+                y: node.data.y,
+            });
+            if (node.data.dummy === DUMMY_NODE_EDGE_LABEL) {
+                originalEdge.data.x = node.data.x;
+                originalEdge.data.y = node.data.y;
+                originalEdge.data.width = node.data.width;
+                originalEdge.data.height = node.data.height;
+            }
+            currentV = w.id;
+            node = g.getNode(currentV);
+        }
+    });
+};
+
+export { run, undo };
+//# sourceMappingURL=normalize.js.map

package/esm/algorithm/antv-dagre/normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sources":["../../../src/algorithm/antv-dagre/src/algorithm/antv-dagre/normalize.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAKA;;;;;;;;;;;;;;;AAeG;AAEH,MAAM,eAAe,GAAG,MAAM;AAC9B,MAAM,qBAAqB,GAAG,YAAY;AAE1C,MAAM,GAAG,GAAG,CAAC,CAAa,EAAE,WAAiB,KAAI;IAC/C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;AACxE;AAEA,MAAM,aAAa,GAAG,CACpB,CAAa,EACb,CAAsB,EACtB,WAAiB,KACf;AACF,IAAA,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM;AAChB,IAAA,IAAI,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,IAAK;AACpC,IAAA,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM;AAClB,IAAA,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,IAAK;AACtC,IAAA,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS;AAElC,IAAA,IAAI,KAAK,KAAK,KAAK,GAAG,CAAC;QAAE;AAEzB,IAAA,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AAElB,IAAA,IAAI,KAAS;AACb,IAAA,IAAI,QAOH;AACD,IAAA,IAAI,CAAC;AACL,IAAA,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE;AAChD,QAAA,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE;AAClB,QAAA,QAAQ,GAAG;AACT,YAAA,YAAY,EAAE,CAAC;AACf,YAAA,KAAK,EAAE,CAAC;AACR,YAAA,MAAM,EAAE,CAAC;AACT,YAAA,IAAI,EAAE,KAAK;SACZ;QAED,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,eAAe,EAAE,QAAQ,EAAE,IAAI,CAAC;QAExD,IAAI,KAAK,KAAK,SAAS,EAAE;YACvB,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAM;YAC9B,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO;AAChC,YAAA,QAAQ,CAAC,KAAK,GAAG,qBAAqB;YACtC,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAkB;AAC9C,QAAA;QAED,CAAC,CAAC,OAAO,CAAC;AACR,YAAA,EAAE,EAAE,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;AACvB,YAAA,MAAM,EAAE,CAAC;AACT,YAAA,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;AAChC,SAAA,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,EAAE;AACX,YAAA,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;AACxB,QAAA;QACD,CAAC,GAAG,KAAK;AACV,IAAA;IAED,CAAC,CAAC,OAAO,CAAC;AACR,QAAA,EAAE,EAAE,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;AACvB,QAAA,MAAM,EAAE,CAAC;AACT,QAAA,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;AAChC,KAAA,CAAC;AACJ,CAAC;AAED,MAAM,IAAI,GAAG,CAAC,CAAa,EAAE,WAAiB,KAAI;AAChD,IAAA,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QACxB,IAAI,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;AACxB,QAAA,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI;AACrB,QAAA,MAAM,YAAY,GAAG,IAAI,CAAC,YAAmC;AAE7D,QAAA,IAAI,CAAC;;AAEL,QAAA,IAAI,YAAY,EAAE;AAChB,YAAA,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC;AACxB,QAAA;QAED,IAAI,QAAQ,GAAG,CAAC;AAChB,QAAA,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACtB,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;AACjC,YAAA,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC;AACtB,YAAA,YAAY,CAAC,IAAI,CAAC,MAAO,CAAC,IAAI,CAAC;AAC7B,gBAAA,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE;AACf,gBAAA,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE;AAChB,aAAA,CAAC;AACF,YAAA,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,qBAAqB,EAAE;gBAC7C,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjC,YAAY,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK;gBACzC,YAAY,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;AAC5C,YAAA;AACD,YAAA,QAAQ,GAAG,CAAC,CAAC,EAAE;AACf,YAAA,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAE;AAC5B,QAAA;AACH,IAAA,CAAC,CAAC;AACJ;;;;"}

package/esm/algorithm/antv-dagre/order/add-subgraph-constraints.js

@@ -0,0 +1,47 @@
+const addSubgraphConstraints = (g, cg, vs) => {
+    const prev = {};
+    let rootPrev;
+    vs === null || vs === void 0 ? void 0 : vs.forEach((v) => {
+        let child = g.getParent(v);
+        let parent;
+        let prevChild;
+        while (child) {
+            parent = g.getParent(child.id);
+            if (parent) {
+                prevChild = prev[parent.id];
+                prev[parent.id] = child.id;
+            }
+            else {
+                prevChild = rootPrev;
+                rootPrev = child.id;
+            }
+            if (prevChild && prevChild !== child.id) {
+                if (!cg.hasNode(prevChild)) {
+                    cg.addNode({
+                        id: prevChild,
+                        data: {},
+                    });
+                }
+                if (!cg.hasNode(child.id)) {
+                    cg.addNode({
+                        id: child.id,
+                        data: {},
+                    });
+                }
+                if (!cg.hasEdge(`e${prevChild}-${child.id}`)) {
+                    cg.addEdge({
+                        id: `e${prevChild}-${child.id}`,
+                        source: prevChild,
+                        target: child.id,
+                        data: {},
+                    });
+                }
+                return;
+            }
+            child = parent;
+        }
+    });
+};
+
+export { addSubgraphConstraints };
+//# sourceMappingURL=add-subgraph-constraints.js.map

package/esm/algorithm/antv-dagre/order/add-subgraph-constraints.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-subgraph-constraints.js","sources":["../../../../src/algorithm/antv-dagre/order/src/algorithm/antv-dagre/order/add-subgraph-constraints.ts"],"sourcesContent":[null],"names":[],"mappings":"AAGO,MAAM,sBAAsB,GAAG,CACpC,CAAa,EACb,EAAc,EACd,EAAQ,KACN;IACF,MAAM,IAAI,GAAmB,EAAE;AAC/B,IAAA,IAAI,QAAY;IAEhB,EAAE,KAAA,IAAA,IAAF,EAAE,KAAA,MAAA,GAAA,MAAA,GAAF,EAAE,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;QAChB,IAAI,KAAK,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;AAC1B,QAAA,IAAI,MAAM;AACV,QAAA,IAAI,SAAa;AACjB,QAAA,OAAO,KAAK,EAAE;YACZ,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;AAC9B,YAAA,IAAI,MAAM,EAAE;AACV,gBAAA,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE;AAC3B,YAAA;AAAM,iBAAA;gBACL,SAAS,GAAG,QAAQ;AACpB,gBAAA,QAAQ,GAAG,KAAK,CAAC,EAAE;AACpB,YAAA;AACD,YAAA,IAAI,SAAS,IAAI,SAAS,KAAK,KAAK,CAAC,EAAE,EAAE;AACvC,gBAAA,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;oBAC1B,EAAE,CAAC,OAAO,CAAC;AACT,wBAAA,EAAE,EAAE,SAAS;AACb,wBAAA,IAAI,EAAE,EAAE;AACT,qBAAA,CAAC;AACH,gBAAA;gBACD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;oBACzB,EAAE,CAAC,OAAO,CAAC;wBACT,EAAE,EAAE,KAAK,CAAC,EAAE;AACZ,wBAAA,IAAI,EAAE,EAAE;AACT,qBAAA,CAAC;AACH,gBAAA;AACD,gBAAA,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,CAAA,CAAA,EAAI,SAAS,CAAA,CAAA,EAAI,KAAK,CAAC,EAAE,CAAA,CAAE,CAAC,EAAE;oBAC5C,EAAE,CAAC,OAAO,CAAC;AACT,wBAAA,EAAE,EAAE,CAAA,CAAA,EAAI,SAAS,IAAI,KAAK,CAAC,EAAE,CAAA,CAAE;AAC/B,wBAAA,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,KAAK,CAAC,EAAE;AAChB,wBAAA,IAAI,EAAE,EAAE;AACT,qBAAA,CAAC;AACH,gBAAA;gBACD;AACD,YAAA;YACD,KAAK,GAAG,MAAM;AACf,QAAA;AACH,IAAA,CAAC,CAAC;AACJ;;;;"}

package/esm/algorithm/antv-dagre/order/barycenter.js

@@ -0,0 +1,25 @@
+/**
+ * TODO: The median method consistently performs better than the barycenter method and has a slight theoretical advantage
+ */
+const barycenter = (g, movable) => {
+    return movable.map((v) => {
+        const inV = g.getRelatedEdges(v, 'in');
+        if (!(inV === null || inV === void 0 ? void 0 : inV.length)) {
+            return { v };
+        }
+        const result = { sum: 0, weight: 0 };
+        inV === null || inV === void 0 ? void 0 : inV.forEach((e) => {
+            const nodeU = g.getNode(e.source);
+            result.sum += e.data.weight * nodeU.data.order;
+            result.weight += e.data.weight;
+        });
+        return {
+            v,
+            barycenter: result.sum / result.weight,
+            weight: result.weight,
+        };
+    });
+};
+
+export { barycenter };
+//# sourceMappingURL=barycenter.js.map

package/esm/algorithm/antv-dagre/order/barycenter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"barycenter.js","sources":["../../../../src/algorithm/antv-dagre/order/src/algorithm/antv-dagre/order/barycenter.ts"],"sourcesContent":[null],"names":[],"mappings":"AAGA;;AAEG;MACU,UAAU,GAAG,CAAC,CAAa,EAAE,OAAa,KAAI;AACzD,IAAA,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAI;QACvB,MAAM,GAAG,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC;QACtC,IAAI,EAAC,GAAG,KAAA,IAAA,IAAH,GAAG,uBAAH,GAAG,CAAE,MAAM,CAAA,EAAE;YAChB,OAAO,EAAE,CAAC,EAAE;AACb,QAAA;QAED,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;QACpC,GAAG,KAAA,IAAA,IAAH,GAAG,KAAA,MAAA,GAAA,MAAA,GAAH,GAAG,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;YACjB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE;AAClC,YAAA,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO,GAAG,KAAK,CAAC,IAAI,CAAC,KAAM;YAChD,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO;AACjC,QAAA,CAAC,CAAC;QACF,OAAO;YACL,CAAC;AACD,YAAA,UAAU,EAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM;YACtC,MAAM,EAAE,MAAM,CAAC,MAAM;SACtB;AACH,IAAA,CAAC,CAAC;AACJ;;;;"}

package/esm/algorithm/antv-dagre/order/build-layer-graph.js

@@ -0,0 +1,89 @@
+import { DagreGraph } from '../graph.js';
+
+/*
+ * Constructs a graph that can be used to sort a layer of nodes. The graph will
+ * contain all base and subgraph nodes from the request layer in their original
+ * hierarchy and any edges that are incident on these nodes and are of the type
+ * requested by the "relationship" parameter.
+ *
+ * Nodes from the requested rank that do not have parents are assigned a root
+ * node in the output graph, which is set in the root graph attribute. This
+ * makes it easy to walk the hierarchy of movable nodes during ordering.
+ *
+ * Pre-conditions:
+ *
+ *    1. Input graph is a DAG
+ *    2. Base nodes in the input graph have a rank attribute
+ *    3. Subgraph nodes in the input graph has minRank and maxRank attributes
+ *    4. Edges have an assigned weight
+ *
+ * Post-conditions:
+ *
+ *    1. Output graph has all nodes in the movable rank with preserved
+ *       hierarchy.
+ *    2. Root nodes in the movable layer are made children of the node
+ *       indicated by the root attribute of the graph.
+ *    3. Non-movable nodes incident on movable nodes, selected by the
+ *       relationship parameter, are included in the graph (without hierarchy).
+ *    4. Edges incident on movable nodes, selected by the relationship
+ *       parameter, are added to the output graph.
+ *    5. The weights for copied edges are aggregated as need, since the output
+ *       graph is not a multi-graph.
+ */
+const buildLayerGraph = (g, rank, direction) => {
+    const root = createRootNode(g);
+    const result = new DagreGraph();
+    result.addNode({ id: root, data: {} });
+    g.getAllNodes().forEach((v) => {
+        var _a, _b;
+        const parent = g.getParent(v.id);
+        if (v.data.rank === rank ||
+            (v.data.minRank <= rank && rank <= v.data.maxRank)) {
+            if (!result.hasNode(v.id)) {
+                result.addNode(Object.assign({}, v));
+            }
+            if ((parent === null || parent === void 0 ? void 0 : parent.id) && !result.hasNode(parent === null || parent === void 0 ? void 0 : parent.id)) {
+                result.addNode(Object.assign({}, parent));
+            }
+            result.setParent(v.id, (parent === null || parent === void 0 ? void 0 : parent.id) || root);
+            // This assumes we have only short edges!
+            g.getRelatedEdges(v.id, direction).forEach((e) => {
+                const u = e.source === v.id ? e.target : e.source;
+                if (!result.hasNode(u)) {
+                    result.addNode(Object.assign({}, g.getNode(u)));
+                }
+                const edge = result
+                    .getRelatedEdges(u, 'out')
+                    .find(({ target }) => target === v.id);
+                const weight = edge !== undefined ? edge.data.weight : 0;
+                if (!edge) {
+                    result.addEdge({
+                        id: e.id,
+                        source: u,
+                        target: v.id,
+                        data: {
+                            weight: e.data.weight + weight,
+                        },
+                    });
+                }
+                else {
+                    result.updateEdgeData(edge.id, Object.assign(Object.assign({}, edge.data), { weight: e.data.weight + weight }));
+                }
+            });
+            // console.log(v);
+            if (v.data.hasOwnProperty('minRank')) {
+                result.updateNodeData(v.id, Object.assign(Object.assign({}, v.data), { borderLeft: [(_a = v.data.borderLeft) === null || _a === void 0 ? void 0 : _a[rank - v.data.minRank]], borderRight: [(_b = v.data.borderRight) === null || _b === void 0 ? void 0 : _b[rank - v.data.minRank]] }));
+            }
+        }
+    });
+    return result;
+};
+const createRootNode = (g) => {
+    let v;
+    while (g.hasNode((v = `_root${Math.random()}`)))
+        ;
+    return v;
+};
+
+export { buildLayerGraph };
+//# sourceMappingURL=build-layer-graph.js.map

package/esm/algorithm/antv-dagre/order/build-layer-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-layer-graph.js","sources":["../../../../src/algorithm/antv-dagre/order/src/algorithm/antv-dagre/order/build-layer-graph.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAGA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BG;AACI,MAAM,eAAe,GAAG,CAC7B,CAAa,EACb,IAAY,EACZ,SAAuB,KACrB;AACF,IAAA,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC;AAC9B,IAAA,MAAM,MAAM,GAAG,IAAI,UAAU,EAAsB;AAEnD,IAAA,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAEtC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;;QAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;AAEhC,QAAA,IACE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI;AACpB,aAAC,CAAC,CAAC,IAAI,CAAC,OAAQ,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,OAAQ,CAAC,EACpD;YACA,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;AACzB,gBAAA,MAAM,CAAC,OAAO,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAM,CAAC,EAAG;AACzB,YAAA;YAED,IAAI,CAAA,MAAM,KAAA,IAAA,IAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,KAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,KAAA,IAAA,IAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,CAAC,EAAE;AAC7C,gBAAA,MAAM,CAAC,OAAO,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAM,MAAM,EAAG;AAC9B,YAAA;AAED,YAAA,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAA,MAAM,KAAA,IAAA,IAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,KAAI,IAAI,CAAC;;AAG1C,YAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;gBAC/C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;AACjD,gBAAA,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;oBACtB,MAAM,CAAC,OAAO,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA,CAAG;AACpC,gBAAA;gBAED,MAAM,IAAI,GAAG;AACV,qBAAA,eAAe,CAAC,CAAC,EAAE,KAAK;AACxB,qBAAA,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;AACxC,gBAAA,MAAM,MAAM,GAAG,IAAI,KAAK,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,CAAC;gBAEzD,IAAI,CAAC,IAAI,EAAE;oBACT,MAAM,CAAC,OAAO,CAAC;wBACb,EAAE,EAAE,CAAC,CAAC,EAAE;AACR,wBAAA,MAAM,EAAE,CAAC;wBACT,MAAM,EAAE,CAAC,CAAC,EAAE;AACZ,wBAAA,IAAI,EAAE;AACJ,4BAAA,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,GAAG,MAAM;AAChC,yBAAA;AACF,qBAAA,CAAC;AACH,gBAAA;AAAM,qBAAA;oBACL,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EACxB,IAAI,CAAC,IAAI,KACZ,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,GAAG,MAAM,EAAA,CAAA,CAC/B;AACH,gBAAA;AACH,YAAA,CAAC,CAAC;;YAIF,IAAI,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE;gBACpC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,EAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EACrB,CAAC,CAAC,IAAI,CAAA,EAAA,EACT,UAAU,EAAE,CAAC,CAAA,EAAA,GAAC,CAAC,CAAC,IAAI,CAAC,UAAmB,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,OAAQ,CAAC,CAAC,EACnE,WAAW,EAAE,CAAC,CAAA,EAAA,GAAC,CAAC,CAAC,IAAI,CAAC,WAAoB,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,OAAQ,CAAC,CAAC,EAAA,CAAA,CACrE;AACH,YAAA;AACF,QAAA;AACH,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,MAAM;AACf;AAEA,MAAM,cAAc,GAAG,CAAC,CAAa,KAAI;AACvC,IAAA,IAAI,CAAC;AACL,IAAA,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAA,KAAA,EAAQ,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE,EAAE;QAAC;AAChD,IAAA,OAAO,CAAC;AACV,CAAC;;;;"}

package/esm/algorithm/antv-dagre/order/cross-count.js

@@ -0,0 +1,66 @@
+import { zipObject } from '../util.js';
+
+/*
+ * A function that takes a layering (an array of layers, each with an array of
+ * ordererd nodes) and a graph and returns a weighted crossing count.
+ *
+ * Pre-conditions:
+ *
+ *    1. Input graph must be simple (not a multigraph), directed, and include
+ *       only simple edges.
+ *    2. Edges in the input graph must have assigned weights.
+ *
+ * Post-conditions:
+ *
+ *    1. The graph and layering matrix are left unchanged.
+ *
+ * This algorithm is derived from Barth, et al., "Bilayer Cross Counting."
+ */
+const twoLayerCrossCount = (g, northLayer, southLayer) => {
+    // Sort all of the edges between the north and south layers by their position
+    // in the north layer and then the south. Map these edges to the position of
+    // their head in the south layer.
+    const southPos = zipObject(southLayer, southLayer.map((v, i) => i));
+    const unflat = northLayer.map((v) => {
+        const unsort = g.getRelatedEdges(v, 'out').map((e) => {
+            return { pos: southPos[e.target] || 0, weight: e.data.weight };
+        });
+        return unsort === null || unsort === void 0 ? void 0 : unsort.sort((a, b) => a.pos - b.pos);
+    });
+    const southEntries = unflat.flat().filter((entry) => entry !== undefined);
+    // Build the accumulator tree
+    let firstIndex = 1;
+    while (firstIndex < southLayer.length)
+        firstIndex <<= 1;
+    const treeSize = 2 * firstIndex - 1;
+    firstIndex -= 1;
+    const tree = Array(treeSize).fill(0, 0, treeSize);
+    // Calculate the weighted crossings
+    let cc = 0;
+    southEntries === null || southEntries === void 0 ? void 0 : southEntries.forEach((entry) => {
+        if (entry) {
+            let index = entry.pos + firstIndex;
+            tree[index] += entry.weight;
+            let weightSum = 0;
+            while (index > 0) {
+                if (index % 2) {
+                    weightSum += tree[index + 1];
+                }
+                index = (index - 1) >> 1;
+                tree[index] += entry.weight;
+            }
+            cc += entry.weight * weightSum;
+        }
+    });
+    return cc;
+};
+const crossCount = (g, layering) => {
+    let cc = 0;
+    for (let i = 1; i < (layering === null || layering === void 0 ? void 0 : layering.length); i += 1) {
+        cc += twoLayerCrossCount(g, layering[i - 1], layering[i]);
+    }
+    return cc;
+};
+
+export { crossCount };
+//# sourceMappingURL=cross-count.js.map

package/esm/algorithm/antv-dagre/order/cross-count.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-count.js","sources":["../../../../src/algorithm/antv-dagre/order/src/algorithm/antv-dagre/order/cross-count.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAAA;;;;;;;;;;;;;;;AAeG;AAMH,MAAM,kBAAkB,GAAG,CACzB,CAAa,EACb,UAAgB,EAChB,UAAgB,KACd;;;;IAIF,MAAM,QAAQ,GAAG,SAAS,CACxB,UAAU,EACV,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAC5B;IACD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAI;AAClC,QAAA,MAAM,MAAM,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAI;YACnD,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;AAChE,QAAA,CAAC,CAAC;QACF,OAAO,MAAM,aAAN,MAAM,KAAA,MAAA,GAAA,MAAA,GAAN,MAAM,CAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;AAC9C,IAAA,CAAC,CAAC;AACF,IAAA,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,KAAK,KAAK,SAAS,CAAC;;IAGzE,IAAI,UAAU,GAAG,CAAC;AAClB,IAAA,OAAO,UAAU,GAAG,UAAU,CAAC,MAAM;QAAE,UAAU,KAAK,CAAC;AACvD,IAAA,MAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC;IACnC,UAAU,IAAI,CAAC;AACf,IAAA,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC;;IAGjD,IAAI,EAAE,GAAG,CAAC;IACV,YAAY,KAAA,IAAA,IAAZ,YAAY,KAAA,MAAA,GAAA,MAAA,GAAZ,YAAY,CAAE,OAAO,CAAC,CAAC,KAAK,KAAI;AAC9B,QAAA,IAAI,KAAK,EAAE;AACT,YAAA,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,UAAU;AAClC,YAAA,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM;YAC3B,IAAI,SAAS,GAAG,CAAC;YACjB,OAAO,KAAK,GAAG,CAAC,EAAE;gBAChB,IAAI,KAAK,GAAG,CAAC,EAAE;AACb,oBAAA,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;AAC7B,gBAAA;gBACD,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC;AACxB,gBAAA,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM;AAC5B,YAAA;AACD,YAAA,EAAE,IAAI,KAAK,CAAC,MAAO,GAAG,SAAS;AAChC,QAAA;AACH,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,EAAE;AACX,CAAC;MAEY,UAAU,GAAG,CAAC,CAAa,EAAE,QAAgB,KAAI;IAC5D,IAAI,EAAE,GAAG,CAAC;AACV,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAG,QAAQ,KAAA,IAAA,IAAR,QAAQ,KAAA,MAAA,GAAA,MAAA,GAAR,QAAQ,CAAE,MAAM,CAAA,EAAE,CAAC,IAAI,CAAC,EAAE;AAC5C,QAAA,EAAE,IAAI,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC1D,IAAA;AACD,IAAA,OAAO,EAAE;AACX;;;;"}

package/esm/algorithm/antv-dagre/order/index.js

@@ -0,0 +1,94 @@
+import { clone } from '@antv/util';
+import { DagreGraph } from '../graph.js';
+import { maxRank, buildLayerMatrix } from '../util.js';
+import { addSubgraphConstraints } from './add-subgraph-constraints.js';
+import { buildLayerGraph } from './build-layer-graph.js';
+import { crossCount } from './cross-count.js';
+import { initOrder } from './init-order.js';
+import { sortSubgraph } from './sort-subgraph.js';
+
+/*
+ * Applies heuristics to minimize edge crossings in the graph and sets the best
+ * order solution as an order attribute on each node.
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be DAG
+ *    2. Graph nodes must be objects with a "rank" attribute
+ *    3. Graph edges must have the "weight" attribute
+ *
+ * Post-conditions:
+ *
+ *    1. Graph nodes will have an "order" attribute based on the results of the
+ *       algorithm.
+ */
+const order = (g, keepNodeOrder) => {
+    const mxRank = maxRank(g);
+    const range1 = [];
+    const range2 = [];
+    for (let i = 1; i < mxRank + 1; i++)
+        range1.push(i);
+    for (let i = mxRank - 1; i > -1; i--)
+        range2.push(i);
+    const downLayerGraphs = buildLayerGraphs(g, range1, 'in');
+    const upLayerGraphs = buildLayerGraphs(g, range2, 'out');
+    let layering = initOrder(g);
+    assignOrder(g, layering);
+    let bestCC = Number.POSITIVE_INFINITY;
+    let best;
+    for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
+        sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2, false, keepNodeOrder);
+        layering = buildLayerMatrix(g);
+        const cc = crossCount(g, layering);
+        if (cc < bestCC) {
+            lastBest = 0;
+            best = clone(layering);
+            bestCC = cc;
+        }
+    }
+    // consider use previous result, maybe somewhat reduendant
+    layering = initOrder(g);
+    assignOrder(g, layering);
+    for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
+        sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2, true, keepNodeOrder);
+        layering = buildLayerMatrix(g);
+        const cc = crossCount(g, layering);
+        if (cc < bestCC) {
+            lastBest = 0;
+            best = clone(layering);
+            bestCC = cc;
+        }
+    }
+    assignOrder(g, best);
+};
+const buildLayerGraphs = (g, ranks, direction) => {
+    return ranks.map((rank) => {
+        return buildLayerGraph(g, rank, direction);
+    });
+};
+const sweepLayerGraphs = (layerGraphs, biasRight, usePrev, keepNodeOrder) => {
+    const cg = new DagreGraph();
+    layerGraphs === null || layerGraphs === void 0 ? void 0 : layerGraphs.forEach((lg) => {
+        var _a;
+        // const root = lg.graph().root as string;
+        const root = lg.getRoots()[0].id;
+        const sorted = sortSubgraph(lg, root, cg, biasRight, usePrev, keepNodeOrder);
+        for (let i = 0; i < ((_a = sorted.vs) === null || _a === void 0 ? void 0 : _a.length) || 0; i++) {
+            const lnode = lg.getNode(sorted.vs[i]);
+            if (lnode) {
+                lnode.data.order = i;
+            }
+        }
+        addSubgraphConstraints(lg, cg, sorted.vs);
+    });
+};
+const assignOrder = (g, layering) => {
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {
+            g.getNode(v).data.order = i;
+        });
+    });
+};
+
+export { order };
+//# sourceMappingURL=index.js.map

package/esm/algorithm/antv-dagre/order/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../src/algorithm/antv-dagre/order/src/algorithm/antv-dagre/order/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;AAUA;;;;;;;;;;;;;;AAcG;MACU,KAAK,GAAG,CAAC,CAAa,EAAE,aAAuB,KAAI;AAC9D,IAAA,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,EAAE;IACjB,MAAM,MAAM,GAAG,EAAE;AACjB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;AAAE,QAAA,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AACnD,IAAA,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;AAAE,QAAA,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACpD,MAAM,eAAe,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC;IACzD,MAAM,aAAa,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC;AAExD,IAAA,IAAI,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC;AAC3B,IAAA,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC;AAExB,IAAA,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB;AACrC,IAAA,IAAI,IAAgB;AACpB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE;QAC3D,gBAAgB,CACd,CAAC,GAAG,CAAC,GAAG,eAAe,GAAG,aAAa,EACvC,CAAC,GAAG,CAAC,IAAI,CAAC,EACV,KAAK,EACL,aAAa,CACd;AAED,QAAA,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC;QAClC,IAAI,EAAE,GAAG,MAAM,EAAE;YACf,QAAQ,GAAG,CAAC;AACZ,YAAA,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC;YACtB,MAAM,GAAG,EAAE;AACZ,QAAA;AACF,IAAA;;AAGD,IAAA,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC;AACvB,IAAA,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC;AACxB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE;QAC3D,gBAAgB,CACd,CAAC,GAAG,CAAC,GAAG,eAAe,GAAG,aAAa,EACvC,CAAC,GAAG,CAAC,IAAI,CAAC,EACV,IAAI,EACJ,aAAa,CACd;AAED,QAAA,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC;QAClC,IAAI,EAAE,GAAG,MAAM,EAAE;YACf,QAAQ,GAAG,CAAC;AACZ,YAAA,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC;YACtB,MAAM,GAAG,EAAE;AACZ,QAAA;AACF,IAAA;AACD,IAAA,WAAW,CAAC,CAAC,EAAE,IAAK,CAAC;AACvB;AAEA,MAAM,gBAAgB,GAAG,CACvB,CAAa,EACb,KAAe,EACf,SAAuB,KACrB;AACF,IAAA,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;QACxB,OAAO,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC;AAC5C,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,gBAAgB,GAAG,CACvB,WAAyB,EACzB,SAAkB,EAClB,OAAiB,EACjB,aAAuB,KACrB;AACF,IAAA,MAAM,EAAE,GAAG,IAAI,UAAU,EAAE;IAC3B,WAAW,KAAA,IAAA,IAAX,WAAW,KAAA,MAAA,GAAA,MAAA,GAAX,WAAW,CAAE,OAAO,CAAC,CAAC,EAAE,KAAI;;;QAE1B,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;AAChC,QAAA,MAAM,MAAM,GAAG,YAAY,CACzB,EAAE,EACF,IAAI,EACJ,EAAE,EACF,SAAS,EACT,OAAO,EACP,aAAa,CACd;AACD,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAG,CAAA,EAAA,GAAA,MAAM,CAAC,EAAE,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,CAAA,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC/C,YAAA,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACtC,YAAA,IAAI,KAAK,EAAE;AACT,gBAAA,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC;AACrB,YAAA;AACF,QAAA;QACD,sBAAsB,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;AAC3C,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,WAAW,GAAG,CAAC,CAAa,EAAE,QAAgB,KAAI;IACtD,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,CAAK,EAAE,CAAS,KAAI;YAClC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC;AAC7B,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC,CAAC;AACJ,CAAC;;;;"}

package/esm/algorithm/antv-dagre/order/init-data-order.js

@@ -0,0 +1,29 @@
+/**
+ * 按照数据中的结果设置fixorder
+ */
+const initDataOrder = (g, nodeOrder) => {
+    const simpleNodes = g.getAllNodes().filter((v) => {
+        var _a;
+        return !((_a = g.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length);
+    });
+    const ranks = simpleNodes.map((v) => v.data.rank);
+    const maxRank = Math.max(...ranks);
+    const layers = [];
+    for (let i = 0; i < maxRank + 1; i++) {
+        layers[i] = [];
+    }
+    nodeOrder === null || nodeOrder === void 0 ? void 0 : nodeOrder.forEach((n) => {
+        const node = g.getNode(n);
+        // 只考虑原有节点，dummy节点需要按照后续算法排出
+        if (!node || node.data.dummy) {
+            return;
+        }
+        if (!isNaN(node.data.rank)) {
+            node.data.fixorder = layers[node.data.rank].length; // 设置fixorder为当层的顺序
+            layers[node.data.rank].push(n);
+        }
+    });
+};
+
+export { initDataOrder };
+//# sourceMappingURL=init-data-order.js.map

package/esm/algorithm/antv-dagre/order/init-data-order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"init-data-order.js","sources":["../../../../src/algorithm/antv-dagre/order/src/algorithm/antv-dagre/order/init-data-order.ts"],"sourcesContent":[null],"names":[],"mappings":"AAGA;;AAEG;MACU,aAAa,GAAG,CAAC,CAAa,EAAE,SAAgB,KAAI;AAC/D,IAAA,MAAM,WAAW,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAI;;AAC/C,QAAA,OAAO,EAAC,CAAA,EAAA,GAAA,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,CAAA;AACrC,IAAA,CAAC,CAAC;AACF,IAAA,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAClC,MAAM,MAAM,GAAW,EAAE;AACzB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACpC,QAAA,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE;AACf,IAAA;IAED,SAAS,KAAA,IAAA,IAAT,SAAS,KAAA,MAAA,GAAA,MAAA,GAAT,SAAS,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;QACvB,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;;QAEzB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC5B;AACD,QAAA;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,EAAE;AAC3B,YAAA,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,MAAM,CAAC;AACpD,YAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAChC,QAAA;AACH,IAAA,CAAC,CAAC;AACJ;;;;"}

package/esm/algorithm/antv-dagre/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.getAllNodes().filter((v) => {
+    //   return !g.getChildren(v.id)?.length;
+    // });
+    const simpleNodes = g.getAllNodes();
+    const nodeRanks = simpleNodes.map((v) => { var _a; return (_a = v.data.rank) !== null && _a !== void 0 ? _a : -Infinity; });
+    const maxRank = Math.max(...nodeRanks);
+    const layers = [];
+    for (let i = 0; i < maxRank + 1; i++) {
+        layers.push([]);
+    }
+    const orderedVs = simpleNodes.sort((a, b) => g.getNode(a.id).data.rank - g.getNode(b.id).data.rank);
+    // const orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v)!.rank; });
+    // 有fixOrder的，直接排序好放进去
+    const beforeSort = orderedVs.filter((n) => {
+        return g.getNode(n.id).data.fixorder !== undefined;
+    });
+    const fixOrderNodes = beforeSort.sort((a, b) => g.getNode(a.id).data.fixorder - g.getNode(b.id).data.fixorder);
+    fixOrderNodes === null || fixOrderNodes === void 0 ? void 0 : fixOrderNodes.forEach((n) => {
+        if (!isNaN(g.getNode(n.id).data.rank)) {
+            layers[g.getNode(n.id).data.rank].push(n.id);
+        }
+        visited[n.id] = true;
+    });
+    orderedVs === null || orderedVs === void 0 ? void 0 : orderedVs.forEach((n) => g.dfsTree(n.id, (node) => {
+        if (visited.hasOwnProperty(node.id))
+            return true;
+        visited[node.id] = true;
+        if (!isNaN(node.data.rank)) {
+            layers[node.data.rank].push(node.id);
+        }
+    }));
+    return layers;
+};
+
+export { initOrder };
+//# sourceMappingURL=init-order.js.map

package/esm/algorithm/antv-dagre/order/init-order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"init-order.js","sources":["../../../../src/algorithm/antv-dagre/order/src/algorithm/antv-dagre/order/init-order.ts"],"sourcesContent":[null],"names":[],"mappings":"AAGA;;;;;;;;;;AAUG;AACI,MAAM,SAAS,GAAG,CAAC,CAAa,KAAI;IACzC,MAAM,OAAO,GAA4B,EAAE;;;;AAI3C,IAAA,MAAM,WAAW,GAAG,CAAC,CAAC,WAAW,EAAE;IACnC,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,KAAI,EAAA,IAAA,EAAA,CAAA,CAAC,OAAA,MAAA,CAAC,CAAC,IAAI,CAAC,IAAK,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,CAAC,QAAQ,CAAA,CAAA,CAAA,CAAC;IAEnE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IACtC,MAAM,MAAM,GAAW,EAAE;AACzB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACpC,QAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AAChB,IAAA;AAED,IAAA,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAChC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAK,CAClE;;;IAID,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,KAAI;AACxC,QAAA,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS;AACpD,IAAA,CAAC,CAAC;AACF,IAAA,MAAM,aAAa,GAAG,UAAU,CAAC,IAAI,CACnC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAS,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAS,CAC1E;IACD,aAAa,KAAA,IAAA,IAAb,aAAa,KAAA,MAAA,GAAA,MAAA,GAAb,aAAa,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;AAC3B,QAAA,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC,EAAE;YACtC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAC9C,QAAA;AACD,QAAA,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI;AACtB,IAAA,CAAC,CAAC;IAEF,SAAS,KAAA,IAAA,IAAT,SAAS,KAAA,MAAA,GAAA,MAAA,GAAT,SAAS,CAAE,OAAO,CAAC,CAAC,CAAC,KACnB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,KAAI;AACvB,QAAA,IAAI,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;AAAE,YAAA,OAAO,IAAI;AAChD,QAAA,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI;QACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,EAAE;AAC3B,YAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACtC,QAAA;IACH,CAAC,CAAC,CACH;AAED,IAAA,OAAO,MAAM;AACf;;;;"}