@antv/layout 1.2.13 → 1.2.14-beta.0

package/lib/{dagre → antv-dagre}/rank/util.js

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.slack = exports.longestPathWithLayer = exports.longestPath = void 0;
 /*
  * Initializes ranks for the input graph using the longest path algorithm. This
  * algorithm scales well and is fast in practice, it yields rather poor
@@ -19,22 +22,22 @@
  *
  *    1. Each node will be assign an (unnormalized) "rank" property.
  */
-var longestPath = function (g) {
-    var visited = {};
-    var dfs = function (v) {
+const longestPath = (g) => {
+    const visited = {};
+    const dfs = (v) => {
         var _a;
-        var label = g.getNode(v);
+        const label = g.getNode(v);
         if (!label)
             return 0;
         if (visited[v]) {
             return label.data.rank;
         }
         visited[v] = true;
-        var rank;
-        (_a = g.getRelatedEdges(v, "out")) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
-            var wRank = dfs(e.target);
-            var minLen = e.data.minlen;
-            var r = wRank - minLen;
+        let rank;
+        (_a = g.getRelatedEdges(v, 'out')) === null || _a === void 0 ? void 0 : _a.forEach((e) => {
+            const wRank = dfs(e.target);
+            const minLen = e.data.minlen;
+            const r = wRank - minLen;
             if (r) {
                 if (rank === undefined || r < rank) {
                     rank = r;
@@ -48,27 +51,28 @@ var longestPath = function (g) {
         return rank;
     };
     g.getAllNodes()
-        .filter(function (n) { return g.getRelatedEdges(n.id, "in").length === 0; })
-        .forEach(function (source) { return dfs(source.id); });
+        .filter((n) => g.getRelatedEdges(n.id, 'in').length === 0)
+        .forEach((source) => dfs(source.id));
 };
-var longestPathWithLayer = function (g) {
+exports.longestPath = longestPath;
+const longestPathWithLayer = (g) => {
     // 用longest path，找出最深的点
-    var visited = {};
-    var minRank;
-    var dfs = function (v) {
+    const visited = {};
+    let minRank;
+    const dfs = (v) => {
         var _a;
-        var label = g.getNode(v);
+        const label = g.getNode(v);
         if (!label)
             return 0;
         if (visited[v]) {
             return label.data.rank;
         }
         visited[v] = true;
-        var rank;
-        (_a = g.getRelatedEdges(v, "out")) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
-            var wRank = dfs(e.target);
-            var minLen = e.data.minlen;
-            var r = wRank - minLen;
+        let rank;
+        (_a = g.getRelatedEdges(v, 'out')) === null || _a === void 0 ? void 0 : _a.forEach((e) => {
+            const wRank = dfs(e.target);
+            const minLen = e.data.minlen;
+            const r = wRank - minLen;
             if (r) {
                 if (rank === undefined || r < rank) {
                     rank = r;
@@ -85,8 +89,8 @@ var longestPathWithLayer = function (g) {
         return rank;
     };
     g.getAllNodes()
-        .filter(function (n) { return g.getRelatedEdges(n.id, "in").length === 0; })
-        .forEach(function (source) {
+        .filter((n) => g.getRelatedEdges(n.id, 'in').length === 0)
+        .forEach((source) => {
         if (source)
             dfs(source.id);
     });
@@ -95,11 +99,11 @@ var longestPathWithLayer = function (g) {
     }
     // minRank += 1; // NOTE: 最小的层级是dummy root，+1
     // forward一遍，赋值层级
-    var forwardVisited = {};
-    var dfsForward = function (v, nextRank) {
+    const forwardVisited = {};
+    const dfsForward = (v, nextRank) => {
         var _a;
-        var label = g.getNode(v);
-        var currRank = !isNaN(label.data.layer) ? label.data.layer : nextRank;
+        const label = g.getNode(v);
+        const currRank = !isNaN(label.data.layer) ? label.data.layer : nextRank;
         // 没有指定，取最大值
         if (label.data.rank === undefined || label.data.rank < currRank) {
             label.data.rank = currRank;
@@ -108,13 +112,13 @@ var longestPathWithLayer = function (g) {
             return;
         forwardVisited[v] = true;
         // DFS遍历子节点
-        (_a = g.getRelatedEdges(v, "out")) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
+        (_a = g.getRelatedEdges(v, 'out')) === null || _a === void 0 ? void 0 : _a.forEach((e) => {
             dfsForward(e.target, currRank + e.data.minlen);
         });
     };
     // 指定层级的，更新下游
-    g.getAllNodes().forEach(function (n) {
-        var label = n.data;
+    g.getAllNodes().forEach((n) => {
+        const label = n.data;
         if (!label)
             return;
         if (!isNaN(label.layer)) {
@@ -125,14 +129,15 @@ var longestPathWithLayer = function (g) {
         }
     });
 };
+exports.longestPathWithLayer = longestPathWithLayer;
 /*
  * Returns the amount of slack for the given edge. The slack is defined as the
  * difference between the length of the edge and its minimum length.
  */
-var slack = function (g, e) {
+const slack = (g, e) => {
     return (g.getNode(e.target).data.rank -
         g.getNode(e.source).data.rank -
         e.data.minlen);
 };
-export { longestPath, longestPathWithLayer, slack };
+exports.slack = slack;
 //# sourceMappingURL=util.js.map

package/lib/antv-dagre/rank/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../../src/antv-dagre/rank/util.ts"],"names":[],"mappings":";;;AAGA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,WAAW,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC/B,MAAM,OAAO,GAAwB,EAAE,CAAC;IAExC,MAAM,GAAG,GAAG,CAAC,CAAK,EAAE,EAAE;;QACpB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAC5B,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC;QACrB,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;YACd,OAAO,KAAK,CAAC,IAAI,CAAC,IAAK,CAAC;SACzB;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAElB,IAAI,IAAY,CAAC;QAEjB,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;YAC9B,MAAM,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC;YACzB,IAAI,CAAC,EAAE;gBACL,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,IAAI,EAAE;oBAClC,IAAI,GAAG,CAAC,CAAC;iBACV;aACF;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,IAAK,EAAE;YACV,IAAI,GAAG,CAAC,CAAC;SACV;QAED,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;SACzD,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AACzC,CAAC,CAAC;AAiGO,kCAAW;AA/FpB,MAAM,oBAAoB,GAAG,CAAC,CAAQ,EAAE,EAAE;IACxC,uBAAuB;IACvB,MAAM,OAAO,GAAwB,EAAE,CAAC;IACxC,IAAI,OAAe,CAAC;IAEpB,MAAM,GAAG,GAAG,CAAC,CAAK,EAAE,EAAE;;QACpB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAC5B,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC;QACrB,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;YACd,OAAO,KAAK,CAAC,IAAI,CAAC,IAAK,CAAC;SACzB;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAElB,IAAI,IAAY,CAAC;QAEjB,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;YAC9B,MAAM,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC;YACzB,IAAI,CAAC,EAAE;gBACL,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,IAAI,EAAE;oBAClC,IAAI,GAAG,CAAC,CAAC;iBACV;aACF;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,IAAK,EAAE;YACV,IAAI,GAAG,CAAC,CAAC;SACV;QAED,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,GAAG,OAAO,EAAE;YAC3C,OAAO,GAAG,IAAI,CAAC;SAChB;QAED,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;SACzD,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;QAClB,IAAI,MAAM;YAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEL,IAAI,OAAQ,KAAK,SAAS,EAAE;QAC1B,OAAO,GAAG,CAAC,CAAC;KACb;IAED,6CAA6C;IAE7C,iBAAiB;IACjB,MAAM,cAAc,GAA4B,EAAE,CAAC;IACnD,MAAM,UAAU,GAAG,CAAC,CAAK,EAAE,QAAgB,EAAE,EAAE;;QAC7C,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAE5B,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QAE1E,YAAY;QACZ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,IAAK,GAAG,QAAQ,EAAE;YAChE,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;SAC5B;QAED,IAAI,cAAc,CAAC,CAAC,CAAC;YAAE,OAAO;QAC9B,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAEzB,WAAW;QACX,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACzC,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,aAAa;IACb,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;QACrB,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAM,CAAC,EAAE;YACxB,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,KAAM,CAAC,CAAC,CAAC,2BAA2B;SAC5D;aAAM;YACL,KAAK,CAAC,IAAK,IAAI,OAAO,CAAC;SACxB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAcoB,oDAAoB;AAZ1C;;;GAGG;AACH,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAE,CAAiB,EAAE,EAAE;IAC5C,OAAO,CACL,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAK;QAC9B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAK;QAC9B,CAAC,CAAC,IAAI,CAAC,MAAO,CACf,CAAC;AACJ,CAAC,CAAC;AAE0C,sBAAK"}

package/lib/antv-dagre/types.d.ts

@@ -0,0 +1,2 @@
+export type DagreRankdir = 'TB' | 'BT' | 'LR' | 'RL' | 'tb' | 'lr' | 'rl' | 'bt';
+export type DagreAlign = 'UL' | 'UR' | 'DL' | 'DR';

package/lib/antv-dagre/types.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/lib/antv-dagre/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/antv-dagre/types.ts"],"names":[],"mappings":""}

package/lib/{dagre → antv-dagre}/util.d.ts

@@ -1,4 +1,4 @@
-import { ID, Graph, Node } from '@antv/graphlib';
+import { Graph, ID, Node } from '@antv/graphlib';
 import { EdgeData, Graph as IGraph, NodeData } from '../types';
 export declare const addDummyNode: (g: IGraph, type: string, data: NodeData, name: string) => ID;
 export declare const simplify: (g: IGraph) => Graph<NodeData, EdgeData>;

package/lib/antv-dagre/util.js

@@ -0,0 +1,299 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.dfs = exports.minBy = exports.partition = exports.maxRank = exports.addBorderNode = exports.removeEmptyRanks = exports.normalizeRanks = exports.buildLayerMatrix = exports.intersectRect = exports.predecessorWeights = exports.successorWeights = exports.zipObject = exports.asNonCompoundGraph = exports.simplify = exports.addDummyNode = void 0;
+const graphlib_1 = require("@antv/graphlib");
+const util_1 = require("@antv/util");
+const safeSort = (valueA, valueB) => {
+    return Number(valueA) - Number(valueB);
+};
+/*
+ * Adds a dummy node to the graph and return v.
+ */
+const addDummyNode = (g, type, data, name) => {
+    let v;
+    do {
+        v = `${name}${Math.random()}`;
+    } while (g.hasNode(v));
+    data.dummy = type;
+    g.addNode({
+        id: v,
+        data,
+    });
+    return v;
+};
+exports.addDummyNode = addDummyNode;
+/*
+ * Returns a new graph with only simple edges. Handles aggregation of data
+ * associated with multi-edges.
+ */
+const simplify = (g) => {
+    const simplified = new graphlib_1.Graph();
+    g.getAllNodes().forEach((v) => {
+        simplified.addNode(Object.assign({}, v));
+    });
+    g.getAllEdges().forEach((e) => {
+        const edge = simplified
+            .getRelatedEdges(e.source, 'out')
+            .find((edge) => edge.target === e.target);
+        if (!edge) {
+            simplified.addEdge({
+                id: e.id,
+                source: e.source,
+                target: e.target,
+                data: {
+                    weight: e.data.weight || 0,
+                    minlen: e.data.minlen || 1,
+                },
+            });
+        }
+        else {
+            simplified.updateEdgeData(edge === null || edge === void 0 ? void 0 : edge.id, Object.assign(Object.assign({}, edge.data), { weight: edge.data.weight + e.data.weight || 0, minlen: Math.max(edge.data.minlen, e.data.minlen || 1) }));
+        }
+    });
+    return simplified;
+};
+exports.simplify = simplify;
+const asNonCompoundGraph = (g) => {
+    const simplified = new graphlib_1.Graph();
+    g.getAllNodes().forEach((node) => {
+        if (!g.getChildren(node.id).length) {
+            simplified.addNode(Object.assign({}, node));
+        }
+    });
+    g.getAllEdges().forEach((edge) => {
+        simplified.addEdge(edge);
+    });
+    return simplified;
+};
+exports.asNonCompoundGraph = asNonCompoundGraph;
+const zipObject = (keys, values) => {
+    return keys === null || keys === void 0 ? void 0 : keys.reduce((obj, key, i) => {
+        obj[key] = values[i];
+        return obj;
+    }, {});
+};
+exports.zipObject = zipObject;
+const successorWeights = (g) => {
+    const weightsMap = {};
+    g.getAllNodes().forEach((node) => {
+        const sucs = {};
+        g.getRelatedEdges(node.id, 'out').forEach((e) => {
+            sucs[e.target] = (sucs[e.target] || 0) + (e.data.weight || 0);
+        });
+        weightsMap[node.id] = sucs;
+    });
+    return weightsMap;
+};
+exports.successorWeights = successorWeights;
+const predecessorWeights = (g) => {
+    const nodes = g.getAllNodes();
+    const weightMap = nodes.map((v) => {
+        const preds = {};
+        g.getRelatedEdges(v.id, 'in').forEach((e) => {
+            preds[e.source] = (preds[e.source] || 0) + e.data.weight;
+        });
+        return preds;
+    });
+    return (0, exports.zipObject)(nodes.map((n) => n.id), weightMap);
+};
+exports.predecessorWeights = predecessorWeights;
+/*
+ * Finds where a line starting at point ({x, y}) would intersect a rectangle
+ * ({x, y, width, height}) if it were pointing at the rectangle's center.
+ */
+const intersectRect = (rect, point) => {
+    const x = Number(rect.x);
+    const y = Number(rect.y);
+    // Rectangle intersection algorithm from:
+    // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes
+    const dx = Number(point.x) - x;
+    const dy = Number(point.y) - y;
+    let w = Number(rect.width) / 2;
+    let h = Number(rect.height) / 2;
+    if (!dx && !dy) {
+        // completely overlapped directly, then return points its self
+        return { x: 0, y: 0 };
+    }
+    let sx;
+    let sy;
+    if (Math.abs(dy) * w > Math.abs(dx) * h) {
+        // Intersection is top or bottom of rect.
+        if (dy < 0) {
+            h = -h;
+        }
+        sx = (h * dx) / dy;
+        sy = h;
+    }
+    else {
+        // Intersection is left or right of rect.
+        if (dx < 0) {
+            w = -w;
+        }
+        sx = w;
+        sy = (w * dy) / dx;
+    }
+    return { x: x + sx, y: y + sy };
+};
+exports.intersectRect = intersectRect;
+/*
+ * Given a DAG with each node assigned "rank" and "order" properties, this
+ * const will produce a matrix with the ids of each node.
+ */
+const buildLayerMatrix = (g) => {
+    const layeringNodes = [];
+    const rankMax = (0, exports.maxRank)(g) + 1;
+    for (let i = 0; i < rankMax; i++) {
+        layeringNodes.push([]);
+    }
+    // const layering = _.map(_.range(maxRank(g) + 1), function() { return []; });
+    g.getAllNodes().forEach((node) => {
+        const rank = node.data.rank;
+        if (rank !== undefined && layeringNodes[rank]) {
+            layeringNodes[rank].push(node.id);
+        }
+    });
+    for (let i = 0; i < rankMax; i++) {
+        layeringNodes[i] = layeringNodes[i].sort((va, vb) => safeSort(g.getNode(va).data.order, g.getNode(vb).data.order));
+    }
+    return layeringNodes;
+};
+exports.buildLayerMatrix = buildLayerMatrix;
+/*
+ * Adjusts the ranks for all nodes in the graph such that all nodes v have
+ * rank(v) >= 0 and at least one node w has rank(w) = 0.
+ */
+const normalizeRanks = (g) => {
+    const nodeRanks = g
+        .getAllNodes()
+        .filter((v) => v.data.rank !== undefined)
+        .map((v) => v.data.rank);
+    const min = Math.min(...nodeRanks);
+    g.getAllNodes().forEach((v) => {
+        if (v.data.hasOwnProperty('rank') && min !== Infinity) {
+            v.data.rank -= min;
+        }
+    });
+};
+exports.normalizeRanks = normalizeRanks;
+const removeEmptyRanks = (g, nodeRankFactor = 0) => {
+    // Ranks may not start at 0, so we need to offset them
+    const nodes = g.getAllNodes();
+    const nodeRanks = nodes
+        .filter((v) => v.data.rank !== undefined)
+        .map((v) => v.data.rank);
+    const offset = Math.min(...nodeRanks);
+    const layers = [];
+    nodes.forEach((v) => {
+        const rank = (v.data.rank || 0) - offset;
+        if (!layers[rank]) {
+            layers[rank] = [];
+        }
+        layers[rank].push(v.id);
+    });
+    let delta = 0;
+    for (let i = 0; i < layers.length; i++) {
+        const vs = layers[i];
+        if (vs === undefined) {
+            if (i % nodeRankFactor !== 0) {
+                delta -= 1;
+            }
+        }
+        else if (delta) {
+            vs === null || vs === void 0 ? void 0 : vs.forEach((v) => {
+                const node = g.getNode(v);
+                if (node) {
+                    node.data.rank = node.data.rank || 0;
+                    node.data.rank += delta;
+                }
+            });
+        }
+    }
+};
+exports.removeEmptyRanks = removeEmptyRanks;
+const addBorderNode = (g, prefix, rank, order) => {
+    const node = {
+        width: 0,
+        height: 0,
+    };
+    if ((0, util_1.isNumber)(rank) && (0, util_1.isNumber)(order)) {
+        node.rank = rank;
+        node.order = order;
+    }
+    return (0, exports.addDummyNode)(g, 'border', node, prefix);
+};
+exports.addBorderNode = addBorderNode;
+const maxRank = (g) => {
+    let maxRank;
+    g.getAllNodes().forEach((v) => {
+        const rank = v.data.rank;
+        if (rank !== undefined) {
+            if (maxRank === undefined || rank > maxRank) {
+                maxRank = rank;
+            }
+        }
+    });
+    if (!maxRank) {
+        maxRank = 0;
+    }
+    return maxRank;
+};
+exports.maxRank = maxRank;
+/*
+ * Partition a collection into two groups: `lhs` and `rhs`. If the supplied
+ * const returns true for an entry it goes into `lhs`. Otherwise it goes
+ * into `rhs.
+ */
+const partition = (collection, fn) => {
+    const result = { lhs: [], rhs: [] };
+    collection === null || collection === void 0 ? void 0 : collection.forEach((value) => {
+        if (fn(value)) {
+            result.lhs.push(value);
+        }
+        else {
+            result.rhs.push(value);
+        }
+    });
+    return result;
+};
+exports.partition = partition;
+const minBy = (array, func) => {
+    return array.reduce((a, b) => {
+        const valA = func(a);
+        const valB = func(b);
+        return valA > valB ? b : a;
+    });
+};
+exports.minBy = minBy;
+const doDFS = (graph, node, postorder, visited, navigator, result) => {
+    if (!visited.includes(node.id)) {
+        visited.push(node.id);
+        if (!postorder) {
+            result.push(node.id);
+        }
+        navigator(node.id).forEach((n) => doDFS(graph, n, postorder, visited, navigator, result));
+        if (postorder) {
+            result.push(node.id);
+        }
+    }
+};
+/**
+ * @description DFS traversal.
+ * @description.zh-CN DFS 遍历。
+ */
+const dfs = (graph, node, order, isDirected) => {
+    const nodes = Array.isArray(node) ? node : [node];
+    const navigator = (n) => (isDirected ? graph.getSuccessors(n) : graph.getNeighbors(n));
+    const results = [];
+    const visited = [];
+    nodes.forEach((node) => {
+        if (!graph.hasNode(node.id)) {
+            throw new Error(`Graph does not have node: ${node}`);
+        }
+        else {
+            doDFS(graph, node, order === 'post', visited, navigator, results);
+        }
+    });
+    return results;
+};
+exports.dfs = dfs;
+//# sourceMappingURL=util.js.map

package/lib/antv-dagre/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/antv-dagre/util.ts"],"names":[],"mappings":";;;AAAA,6CAAiD;AACjD,qCAAsC;AAGtC,MAAM,QAAQ,GAAG,CAAC,MAAe,EAAE,MAAe,EAAE,EAAE;IACpD,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF;;GAEG;AACI,MAAM,YAAY,GAAG,CAC1B,CAAS,EACT,IAAY,EACZ,IAAc,EACd,IAAY,EACR,EAAE;IACN,IAAI,CAAK,CAAC;IACV,GAAG;QACD,CAAC,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;KAC/B,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;IAEvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IAClB,CAAC,CAAC,OAAO,CAAC;QACR,EAAE,EAAE,CAAC;QACL,IAAI;KACL,CAAC,CAAC;IAEH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAlBW,QAAA,YAAY,gBAkBvB;AAEF;;;GAGG;AACI,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE;IACpC,MAAM,UAAU,GAAG,IAAI,gBAAK,EAAsB,CAAC;IACnD,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,UAAU,CAAC,OAAO,mBAAM,CAAC,EAAG,CAAC;IAC/B,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,MAAM,IAAI,GAAG,UAAU;aACpB,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC;aAChC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI,EAAE;YACT,UAAU,CAAC,OAAO,CAAC;gBACjB,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,IAAI,EAAE;oBACJ,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC;oBAC3B,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC;iBAC5B;aACF,CAAC,CAAC;SACJ;aAAM;YACL,UAAU,CAAC,cAAc,CAAC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAG,kCAC9B,IAAI,CAAC,IAAI,KACZ,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,EAC/C,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,CAAC,IACxD,CAAC;SACJ;IACH,CAAC,CAAC,CAAC;IACH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AA5BW,QAAA,QAAQ,YA4BnB;AAEK,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAU,EAAE;IACtD,MAAM,UAAU,GAAG,IAAI,gBAAK,EAAE,CAAC;IAE/B,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC/B,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE;YAClC,UAAU,CAAC,OAAO,mBAAM,IAAI,EAAG,CAAC;SACjC;IACH,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC/B,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAdW,QAAA,kBAAkB,sBAc7B;AAEK,MAAM,SAAS,GAAG,CAAU,IAAU,EAAE,MAAW,EAAE,EAAE;IAC5D,OAAO,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;QAClC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,GAAG,CAAC;IACb,CAAC,EAAE,EAAmB,CAAC,CAAC;AAC1B,CAAC,CAAC;AALW,QAAA,SAAS,aAKpB;AAEK,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC5C,MAAM,UAAU,GAAuC,EAAE,CAAC;IAE1D,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC/B,MAAM,IAAI,GAAuB,EAAE,CAAC;QACpC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9C,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QACH,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAZW,QAAA,gBAAgB,oBAY3B;AAEK,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC9C,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAE9B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAChC,MAAM,KAAK,GAAuB,EAAE,CAAC;QACrC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1C,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;QAC5D,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;IACH,OAAO,IAAA,iBAAS,EACd,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EACtB,SAAS,CACV,CAAC;AACJ,CAAC,CAAC;AAdW,QAAA,kBAAkB,sBAc7B;AAEF;;;GAGG;AACI,MAAM,aAAa,GAAG,CAC3B,IAAiE,EACjE,KAAiC,EACjC,EAAE;IACF,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEzB,yCAAyC;IACzC,6EAA6E;IAC7E,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAEhC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;QACd,8DAA8D;QAC9D,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;KACvB;IAED,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC;IAEP,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;QACvC,yCAAyC;QACzC,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,CAAC,CAAC;SACR;QACD,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QACnB,EAAE,GAAG,CAAC,CAAC;KACR;SAAM;QACL,yCAAyC;QACzC,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,CAAC,CAAC;SACR;QACD,EAAE,GAAG,CAAC,CAAC;QACP,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;KACpB;IAED,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC;AAClC,CAAC,CAAC;AAvCW,QAAA,aAAa,iBAuCxB;AAEF;;;GAGG;AACI,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC5C,MAAM,aAAa,GAAW,EAAE,CAAC;IACjC,MAAM,OAAO,GAAG,IAAA,eAAO,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;QAChC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACxB;IAED,8EAA8E;IAC9E,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;YAC7C,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACnC;IACH,CAAC,CAAC,CAAC;IAEH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;QAChC,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAM,EAAE,EAAM,EAAE,EAAE,CAC1D,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAM,CAAC,CAC/D,CAAC;KACH;IAED,OAAO,aAAa,CAAC;AACvB,CAAC,CAAC;AAtBW,QAAA,gBAAgB,oBAsB3B;AAEF;;;GAGG;AACI,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,EAAE;IAC1C,MAAM,SAAS,GAAG,CAAC;SAChB,WAAW,EAAE;SACb,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC;SACxC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IACnC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,IAAI,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,QAAQ,EAAE;YACrD,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,GAAG,CAAC;SACrB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAXW,QAAA,cAAc,kBAWzB;AAEK,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,iBAAyB,CAAC,EAAE,EAAE;IACxE,sDAAsD;IACtD,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAG,KAAK;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC;SACxC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC;IAE5B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IACtC,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAClB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;QAE1C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACjB,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;SACnB;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,KAAK,SAAS,EAAE;YACpB,IAAI,CAAC,GAAG,cAAc,KAAK,CAAC,EAAE;gBAC5B,KAAK,IAAI,CAAC,CAAC;aACZ;SACF;aAAM,IAAI,KAAK,EAAE;YAChB,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,OAAO,CAAC,CAAC,CAAK,EAAE,EAAE;gBACpB,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,IAAI,EAAE;oBACR,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;oBACrC,IAAI,CAAC,IAAI,CAAC,IAAK,IAAI,KAAK,CAAC;iBAC1B;YACH,CAAC,CAAC,CAAC;SACJ;KACF;AACH,CAAC,CAAC;AApCW,QAAA,gBAAgB,oBAoC3B;AAEK,MAAM,aAAa,GAAG,CAC3B,CAAS,EACT,MAAc,EACd,IAAa,EACb,KAAc,EACd,EAAE;IACF,MAAM,IAAI,GAAa;QACrB,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;KACV,CAAC;IACF,IAAI,IAAA,eAAQ,EAAC,IAAI,CAAC,IAAI,IAAA,eAAQ,EAAC,KAAK,CAAC,EAAE;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;KACpB;IACD,OAAO,IAAA,oBAAY,EAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;AACjD,CAAC,CAAC;AAfW,QAAA,aAAa,iBAexB;AAEK,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE;IACnC,IAAI,OAAe,CAAC;IACpB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC;QAC1B,IAAI,IAAI,KAAK,SAAS,EAAE;YACtB,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,GAAG,OAAO,EAAE;gBAC3C,OAAO,GAAG,IAAI,CAAC;aAChB;SACF;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,OAAQ,EAAE;QACb,OAAO,GAAG,CAAC,CAAC;KACb;IACD,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAfW,QAAA,OAAO,WAelB;AAEF;;;;GAIG;AACI,MAAM,SAAS,GAAG,CACvB,UAAe,EACf,EAAuB,EACvB,EAAE;IACF,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,EAAS,EAAE,GAAG,EAAE,EAAS,EAAE,CAAC;IAClD,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC5B,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;YACb,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxB;aAAM;YACL,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxB;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAbW,QAAA,SAAS,aAapB;AAEK,MAAM,KAAK,GAAG,CAAU,KAAU,EAAE,IAA0B,EAAE,EAAE;IACvE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AANW,QAAA,KAAK,SAMhB;AAEF,MAAM,KAAK,GAAG,CACZ,KAAa,EACb,IAAoB,EACpB,SAAkB,EAClB,OAAa,EACb,SAAsC,EACtC,MAAY,EACZ,EAAE;IACF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAC9B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,EAAE;YACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACtB;QACD,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAC/B,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,CACvD,CAAC;QACF,IAAI,SAAS,EAAE;YACb,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACtB;KACF;AACH,CAAC,CAAC;AAEF;;;GAGG;AACI,MAAM,GAAG,GAAG,CACjB,KAAa,EACb,IAAuC,EACvC,KAAqB,EACrB,UAAmB,EACnB,EAAE;IACF,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,CAAC,CAAK,EAAE,EAAE,CAC1B,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAE,CAAC;IACjE,MAAM,OAAO,GAAS,EAAE,CAAC;IACzB,MAAM,OAAO,GAAS,EAAE,CAAC;IACzB,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,6BAA6B,IAAI,EAAE,CAAC,CAAC;SACtD;aAAM;YACL,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;SACnE;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AApBW,QAAA,GAAG,OAoBd"}

package/lib/antv-dagre.d.ts

@@ -0,0 +1,50 @@
+import { ID } from '@antv/graphlib';
+import type { DagreAlign, DagreRankdir } from './antv-dagre/types';
+import type { Graph as IGraph, Layout, LayoutMapping, Node, OutNode, PointTuple } from './types';
+export interface AntVDagreLayoutOptions {
+    rankdir?: DagreRankdir;
+    ranker?: 'network-simplex' | 'tight-tree' | 'longest-path';
+    align?: DagreAlign;
+    begin?: PointTuple;
+    nodeSize?: number | number[] | ((nodeData: Node) => number);
+    nodesep?: number;
+    ranksep?: number;
+    controlPoints?: boolean;
+    sortByCombo?: boolean;
+    edgeLabelSpace?: boolean;
+    nodeOrder?: string[];
+    radial?: boolean;
+    focusNode?: ID | Node | null;
+    preset?: OutNode[];
+    nodesepFunc?: (d?: Node) => number;
+    ranksepFunc?: (d?: Node) => number;
+}
+/**
+ * Layout arranging the nodes in a circle.
+ *
+ * @example
+ * // Assign layout options when initialization.
+ * const layout = new CircularLayout({ radius: 10 });
+ * const positions = await layout.execute(graph); // { nodes: [], edges: [] }
+ *
+ * // Or use different options later.
+ * const layout = new CircularLayout({ radius: 10 });
+ * const positions = await layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }
+ *
+ * // If you want to assign the positions directly to the nodes, use assign method.
+ * await layout.assign(graph, { radius: 20 });
+ */
+export declare class AntVDagreLayout implements Layout<AntVDagreLayoutOptions> {
+    options: AntVDagreLayoutOptions;
+    id: string;
+    constructor(options?: AntVDagreLayoutOptions);
+    /**
+     * Return the positions of nodes and edges(if needed).
+     */
+    execute(graph: IGraph, options?: AntVDagreLayoutOptions): Promise<LayoutMapping>;
+    /**
+     * To directly assign the positions to the nodes.
+     */
+    assign(graph: IGraph, options?: AntVDagreLayoutOptions): Promise<void>;
+    private genericDagreLayout;
+}