@antv/layout 1.2.13 → 1.2.14-beta.1

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

@@ -1,21 +1,20 @@
-import { __assign, __read, __spreadArray } from "tslib";
 import { Graph } from '@antv/graphlib';
 import { isNumber } from '@antv/util';
-var safeSort = function (valueA, valueB) {
+const safeSort = (valueA, valueB) => {
     return Number(valueA) - Number(valueB);
 };
 /*
  * Adds a dummy node to the graph and return v.
  */
-export var addDummyNode = function (g, type, data, name) {
-    var v;
+export const addDummyNode = (g, type, data, name) => {
+    let v;
     do {
-        v = "" + name + Math.random();
+        v = `${name}${Math.random()}`;
     } while (g.hasNode(v));
     data.dummy = type;
     g.addNode({
         id: v,
-        data: data,
+        data,
     });
     return v;
 };
@@ -23,15 +22,15 @@ export var addDummyNode = function (g, type, data, name) {
  * Returns a new graph with only simple edges. Handles aggregation of data
  * associated with multi-edges.
  */
-export var simplify = function (g) {
-    var simplified = new Graph();
-    g.getAllNodes().forEach(function (v) {
-        simplified.addNode(__assign({}, v));
+export const simplify = (g) => {
+    const simplified = new Graph();
+    g.getAllNodes().forEach((v) => {
+        simplified.addNode(Object.assign({}, v));
     });
-    g.getAllEdges().forEach(function (e) {
-        var edge = simplified
+    g.getAllEdges().forEach((e) => {
+        const edge = simplified
             .getRelatedEdges(e.source, 'out')
-            .find(function (edge) { return edge.target === e.target; });
+            .find((edge) => edge.target === e.target);
         if (!edge) {
             simplified.addEdge({
                 id: e.id,
@@ -44,70 +43,70 @@ export var simplify = function (g) {
             });
         }
         else {
-            simplified.updateEdgeData(edge === null || edge === void 0 ? void 0 : edge.id, __assign(__assign({}, edge.data), { weight: edge.data.weight + e.data.weight || 0, minlen: Math.max(edge.data.minlen, e.data.minlen || 1) }));
+            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;
 };
-export var asNonCompoundGraph = function (g) {
-    var simplified = new Graph();
-    g.getAllNodes().forEach(function (node) {
+export const asNonCompoundGraph = (g) => {
+    const simplified = new Graph();
+    g.getAllNodes().forEach((node) => {
         if (!g.getChildren(node.id).length) {
-            simplified.addNode(__assign({}, node));
+            simplified.addNode(Object.assign({}, node));
         }
     });
-    g.getAllEdges().forEach(function (edge) {
+    g.getAllEdges().forEach((edge) => {
         simplified.addEdge(edge);
     });
     return simplified;
 };
-export var zipObject = function (keys, values) {
-    return keys === null || keys === void 0 ? void 0 : keys.reduce(function (obj, key, i) {
+export const zipObject = (keys, values) => {
+    return keys === null || keys === void 0 ? void 0 : keys.reduce((obj, key, i) => {
         obj[key] = values[i];
         return obj;
     }, {});
 };
-export var successorWeights = function (g) {
-    var weightsMap = {};
-    g.getAllNodes().forEach(function (node) {
-        var sucs = {};
-        g.getRelatedEdges(node.id, 'out').forEach(function (e) {
+export 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;
 };
-export var predecessorWeights = function (g) {
-    var nodes = g.getAllNodes();
-    var weightMap = nodes.map(function (v) {
-        var preds = {};
-        g.getRelatedEdges(v.id, 'in').forEach(function (e) {
+export 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 zipObject(nodes.map(function (n) { return n.id; }), weightMap);
+    return zipObject(nodes.map((n) => n.id), weightMap);
 };
 /*
  * 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.
  */
-export var intersectRect = function (rect, point) {
-    var x = Number(rect.x);
-    var y = Number(rect.y);
+export 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
-    var dx = Number(point.x) - x;
-    var dy = Number(point.y) - y;
-    var w = Number(rect.width) / 2;
-    var h = Number(rect.height) / 2;
+    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 };
     }
-    var sx;
-    var sy;
+    let sx;
+    let sy;
     if (Math.abs(dy) * w > Math.abs(dx) * h) {
         // Intersection is top or bottom of rect.
         if (dy < 0) {
@@ -130,23 +129,21 @@ export var intersectRect = function (rect, point) {
  * Given a DAG with each node assigned "rank" and "order" properties, this
  * const will produce a matrix with the ids of each node.
  */
-export var buildLayerMatrix = function (g) {
-    var layeringNodes = [];
-    var rankMax = maxRank(g) + 1;
-    for (var i = 0; i < rankMax; i++) {
+export const buildLayerMatrix = (g) => {
+    const layeringNodes = [];
+    const rankMax = maxRank(g) + 1;
+    for (let i = 0; i < rankMax; i++) {
         layeringNodes.push([]);
     }
     // const layering = _.map(_.range(maxRank(g) + 1), function() { return []; });
-    g.getAllNodes().forEach(function (node) {
-        var rank = node.data.rank;
+    g.getAllNodes().forEach((node) => {
+        const rank = node.data.rank;
         if (rank !== undefined && layeringNodes[rank]) {
             layeringNodes[rank].push(node.id);
         }
     });
-    for (var i = 0; i < rankMax; i++) {
-        layeringNodes[i] = layeringNodes[i].sort(function (va, vb) {
-            return safeSort(g.getNode(va).data.order, g.getNode(vb).data.order);
-        });
+    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;
 };
@@ -154,45 +151,44 @@ export var buildLayerMatrix = function (g) {
  * 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.
  */
-export var normalizeRanks = function (g) {
-    var nodeRanks = g
+export const normalizeRanks = (g) => {
+    const nodeRanks = g
         .getAllNodes()
-        .filter(function (v) { return v.data.rank !== undefined; })
-        .map(function (v) { return v.data.rank; });
-    var min = Math.min.apply(Math, __spreadArray([], __read(nodeRanks)));
-    g.getAllNodes().forEach(function (v) {
+        .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;
         }
     });
 };
-export var removeEmptyRanks = function (g, nodeRankFactor) {
-    if (nodeRankFactor === void 0) { nodeRankFactor = 0; }
+export const removeEmptyRanks = (g, nodeRankFactor = 0) => {
     // Ranks may not start at 0, so we need to offset them
-    var nodes = g.getAllNodes();
-    var nodeRanks = nodes
-        .filter(function (v) { return v.data.rank !== undefined; })
-        .map(function (v) { return v.data.rank; });
-    var offset = Math.min.apply(Math, __spreadArray([], __read(nodeRanks)));
-    var layers = [];
-    nodes.forEach(function (v) {
-        var rank = (v.data.rank || 0) - offset;
+    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);
     });
-    var delta = 0;
-    for (var i = 0; i < layers.length; i++) {
-        var vs = layers[i];
+    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(function (v) {
-                var node = g.getNode(v);
+            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;
@@ -201,8 +197,8 @@ export var removeEmptyRanks = function (g, nodeRankFactor) {
         }
     }
 };
-export var addBorderNode = function (g, prefix, rank, order) {
-    var node = {
+export const addBorderNode = (g, prefix, rank, order) => {
+    const node = {
         width: 0,
         height: 0,
     };
@@ -212,10 +208,10 @@ export var addBorderNode = function (g, prefix, rank, order) {
     }
     return addDummyNode(g, 'border', node, prefix);
 };
-export var maxRank = function (g) {
-    var maxRank;
-    g.getAllNodes().forEach(function (v) {
-        var rank = v.data.rank;
+export const maxRank = (g) => {
+    let maxRank;
+    g.getAllNodes().forEach((v) => {
+        const rank = v.data.rank;
         if (rank !== undefined) {
             if (maxRank === undefined || rank > maxRank) {
                 maxRank = rank;
@@ -232,9 +228,9 @@ export var maxRank = function (g) {
  * const returns true for an entry it goes into `lhs`. Otherwise it goes
  * into `rhs.
  */
-export var partition = function (collection, fn) {
-    var result = { lhs: [], rhs: [] };
-    collection === null || collection === void 0 ? void 0 : collection.forEach(function (value) {
+export 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);
         }
@@ -244,22 +240,20 @@ export var partition = function (collection, fn) {
     });
     return result;
 };
-export var minBy = function (array, func) {
-    return array.reduce(function (a, b) {
-        var valA = func(a);
-        var valB = func(b);
+export const minBy = (array, func) => {
+    return array.reduce((a, b) => {
+        const valA = func(a);
+        const valB = func(b);
         return valA > valB ? b : a;
     });
 };
-var doDFS = function (graph, node, postorder, visited, navigator, result) {
+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(function (n) {
-            return doDFS(graph, n, postorder, visited, navigator, result);
-        });
+        navigator(node.id).forEach((n) => doDFS(graph, n, postorder, visited, navigator, result));
         if (postorder) {
             result.push(node.id);
         }
@@ -269,16 +263,14 @@ var doDFS = function (graph, node, postorder, visited, navigator, result) {
  * @description DFS traversal.
  * @description.zh-CN DFS 遍历。
  */
-export var dfs = function (graph, node, order, isDirected) {
-    var nodes = Array.isArray(node) ? node : [node];
-    var navigator = function (n) {
-        return (isDirected ? graph.getSuccessors(n) : graph.getNeighbors(n));
-    };
-    var results = [];
-    var visited = [];
-    nodes.forEach(function (node) {
+export 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);
+            throw new Error(`Graph does not have node: ${node}`);
         }
         else {
             doDFS(graph, node, order === 'post', visited, navigator, results);

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,OAAO,EAAE,KAAK,EAAY,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;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;AACH,MAAM,CAAC,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;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE;IACpC,MAAM,UAAU,GAAG,IAAI,KAAK,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;AAEF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAU,EAAE;IACtD,MAAM,UAAU,GAAG,IAAI,KAAK,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;AAEF,MAAM,CAAC,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;AAEF,MAAM,CAAC,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;AAEF,MAAM,CAAC,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,SAAS,CACd,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EACtB,SAAS,CACV,CAAC;AACJ,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,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;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC5C,MAAM,aAAa,GAAW,EAAE,CAAC;IACjC,MAAM,OAAO,GAAG,OAAO,CAAC,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;AAEF;;;GAGG;AACH,MAAM,CAAC,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;AAEF,MAAM,CAAC,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;AAEF,MAAM,CAAC,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,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;KACpB;IACD,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;AACjD,CAAC,CAAC;AAEF,MAAM,CAAC,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;AAEF;;;;GAIG;AACH,MAAM,CAAC,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;AAEF,MAAM,CAAC,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;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;AACH,MAAM,CAAC,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"}

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;
+}