@antv/layout 1.2.13 → 1.2.14-beta.0

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/antv-dagre/position/index.ts"],"names":[],"mappings":";;;AAGA,kCAA+D;AAC/D,6BAQc;AAEd,MAAM,SAAS,GAAG,CAChB,CAAS,EACT,OAEE,EACF,EAAE;IACF,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,CAAC;IAErC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC;QAC1C,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;YAC3B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,KAAK,IAAI,SAAS,GAAG,OAAO,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAChB,CAAS,EACT,OAIE,EACkB,EAAE;IACtB,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;IAEtE,MAAM,QAAQ,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,IAAA,uBAAkB,EAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,IAAA,uBAAkB,EAAC,CAAC,EAAE,QAAQ,CAAC,CAChC,CAAC;IAEF,MAAM,GAAG,GAA2C,EAAE,CAAC;IACvD,IAAI,gBAAgB,GAAW,EAAE,CAAC;IAClC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC1B,gBAAgB;YACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9D,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YAC3B,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAChD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAC/B,CAAC;aACH;YAED,MAAM,UAAU,GAAG,CACjB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CACnD,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,MAAM,KAAK,GAAG,IAAA,sBAAiB,EAC7B,CAAC,EACD,gBAAgB,EAChB,SAAS,EACT,UAAU,CACX,CAAC;YACF,MAAM,EAAE,GAAG,IAAA,yBAAoB,EAC7B,CAAC,EACD,gBAAgB,EAChB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,KAAK,EACX,OAAO,EACP,OAAO,EACP,KAAK,KAAK,GAAG,CACd,CAAC;YACF,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;aAC9D;YACD,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,IAAA,+BAA0B,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzD,aAAa,IAAI,IAAA,qBAAgB,EAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACtD,OAAO,IAAA,YAAO,EAAC,GAAG,EAAE,UAAU,CAAC,CAAC;AAClC,CAAC,CAAC;AAEK,MAAM,QAAQ,GAAG,CACtB,CAAS,EACT,OAKE,EACF,EAAE;;IACF,MAAM,EAAE,GAAG,IAAA,yBAAkB,EAAC,CAAC,CAAC,CAAC;IAEjC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAClC,MAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,OAAO,CAAC,CAAC,GAAO,EAAE,EAAE;QACnC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAhBW,QAAA,QAAQ,YAgBnB"}

package/lib/{dagre → antv-dagre}/rank/feasible-tree.d.ts

@@ -1,5 +1,5 @@
-import { Graph } from "@antv/graphlib";
-import { Graph as IGraph } from "../../types";
+import { Graph } from '@antv/graphlib';
+import { Graph as IGraph } from '../../types';
 declare const feasibleTree: (g: IGraph) => Graph<import("@antv/graphlib").PlainObject, import("@antv/graphlib").PlainObject>;
 declare const feasibleTreeWithLayer: (g: IGraph) => Graph<import("@antv/graphlib").PlainObject, import("@antv/graphlib").PlainObject>;
 export { feasibleTree, feasibleTreeWithLayer };

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

@@ -1,6 +1,9 @@
-import { slack } from "./util";
-import { minBy } from "../util";
-import { Graph } from "@antv/graphlib";
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.feasibleTreeWithLayer = exports.feasibleTree = void 0;
+const graphlib_1 = require("@antv/graphlib");
+const util_1 = require("../util");
+const util_2 = require("./util");
 /*
  * Constructs a spanning tree with tight edges and adjusted the input node's
  * ranks to achieve this. A tight edge is one that is has a length that matches
@@ -26,33 +29,34 @@ import { Graph } from "@antv/graphlib";
  * Returns a tree (undirected graph) that is constructed using only "tight"
  * edges.
  */
-var feasibleTree = function (g) {
-    var t = new Graph({
+const feasibleTree = (g) => {
+    const t = new graphlib_1.Graph({
         tree: [],
     });
     // Choose arbitrary node from which to start our tree
-    var start = g.getAllNodes()[0];
-    var size = g.getAllNodes().length;
+    const start = g.getAllNodes()[0];
+    const size = g.getAllNodes().length;
     t.addNode(start);
-    var edge;
-    var delta;
+    let edge;
+    let delta;
     while (tightTree(t, g) < size) {
         edge = findMinSlackEdge(t, g);
-        delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);
+        delta = t.hasNode(edge.source) ? (0, util_2.slack)(g, edge) : -(0, util_2.slack)(g, edge);
         shiftRanks(t, g, delta);
     }
     return t;
 };
+exports.feasibleTree = feasibleTree;
 /*
  * Finds a maximal tree of tight edges and returns the number of nodes in the
  * tree.
  */
-var tightTree = function (t, g) {
-    var dfs = function (v) {
-        g.getRelatedEdges(v, "both").forEach(function (e) {
-            var edgeV = e.source;
-            var w = v === edgeV ? e.target : edgeV;
-            if (!t.hasNode(w) && !slack(g, e)) {
+const tightTree = (t, g) => {
+    const dfs = (v) => {
+        g.getRelatedEdges(v, 'both').forEach((e) => {
+            const edgeV = e.source;
+            const w = v === edgeV ? e.target : edgeV;
+            if (!t.hasNode(w) && !(0, util_2.slack)(g, e)) {
                 t.addNode({
                     id: w,
                     data: {},
@@ -67,7 +71,7 @@ var tightTree = function (t, g) {
             }
         });
     };
-    t.getAllNodes().forEach(function (n) { return dfs(n.id); });
+    t.getAllNodes().forEach((n) => dfs(n.id));
     return t.getAllNodes().length;
 };
 /*
@@ -95,34 +99,35 @@ var tightTree = function (t, g) {
  * Returns a tree (undirected graph) that is constructed using only "tight"
  * edges.
  */
-var feasibleTreeWithLayer = function (g) {
-    var t = new Graph({ tree: [] });
+const feasibleTreeWithLayer = (g) => {
+    const t = new graphlib_1.Graph({ tree: [] });
     // Choose arbitrary node from which to start our tree
-    var start = g.getAllNodes()[0];
-    var size = g.getAllNodes().length;
+    const start = g.getAllNodes()[0];
+    const size = g.getAllNodes().length;
     t.addNode(start);
-    var edge;
-    var delta;
+    let edge;
+    let delta;
     while (tightTreeWithLayer(t, g) < size) {
         edge = findMinSlackEdge(t, g);
-        delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);
+        delta = t.hasNode(edge.source) ? (0, util_2.slack)(g, edge) : -(0, util_2.slack)(g, edge);
         shiftRanks(t, g, delta);
     }
     return t;
 };
+exports.feasibleTreeWithLayer = feasibleTreeWithLayer;
 /*
  * Finds a maximal tree of tight edges and returns the number of nodes in the
  * tree.
  */
-var tightTreeWithLayer = function (t, g) {
-    var dfs = function (v) {
+const tightTreeWithLayer = (t, g) => {
+    const dfs = (v) => {
         var _a;
-        (_a = g.getRelatedEdges(v, "both")) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
-            var edgeV = e.source;
-            var w = v === edgeV ? e.target : edgeV;
+        (_a = g.getRelatedEdges(v, 'both')) === null || _a === void 0 ? void 0 : _a.forEach((e) => {
+            const edgeV = e.source;
+            const w = v === edgeV ? e.target : edgeV;
             // 对于指定layer的，直接加入tight-tree，不参与调整
             if (!t.hasNode(w) &&
-                (g.getNode(w).data.layer !== undefined || !slack(g, e))) {
+                (g.getNode(w).data.layer !== undefined || !(0, util_2.slack)(g, e))) {
                 t.addNode({
                     id: w,
                     data: {},
@@ -137,28 +142,27 @@ var tightTreeWithLayer = function (t, g) {
             }
         });
     };
-    t.getAllNodes().forEach(function (n) { return dfs(n.id); });
+    t.getAllNodes().forEach((n) => dfs(n.id));
     return t.getAllNodes().length;
 };
 /*
  * Finds the edge with the smallest slack that is incident on tree and returns
  * it.
  */
-var findMinSlackEdge = function (t, g) {
-    return minBy(g.getAllEdges(), function (e) {
+const findMinSlackEdge = (t, g) => {
+    return (0, util_1.minBy)(g.getAllEdges(), (e) => {
         if (t.hasNode(e.source) !== t.hasNode(e.target)) {
-            return slack(g, e);
+            return (0, util_2.slack)(g, e);
         }
         return Infinity;
     });
 };
-var shiftRanks = function (t, g, delta) {
-    t.getAllNodes().forEach(function (tn) {
-        var v = g.getNode(tn.id);
+const shiftRanks = (t, g, delta) => {
+    t.getAllNodes().forEach((tn) => {
+        const v = g.getNode(tn.id);
         if (!v.data.rank)
             v.data.rank = 0;
         v.data.rank += delta;
     });
 };
-export { feasibleTree, feasibleTreeWithLayer };
 //# sourceMappingURL=feasible-tree.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"feasible-tree.js","sourceRoot":"","sources":["../../../src/antv-dagre/rank/feasible-tree.ts"],"names":[],"mappings":";;;AAAA,6CAAiD;AAEjD,kCAAgC;AAChC,iCAA+B;AAE/B;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,EAAE;IACjC,MAAM,CAAC,GAAG,IAAI,gBAAK,CAAC;QAClB,IAAI,EAAE,EAAE;KACT,CAAC,CAAC;IAEH,qDAAqD;IACrD,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC;IACpC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAEjB,IAAI,IAAoB,CAAC;IACzB,IAAI,KAAa,CAAC;IAClB,OAAO,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE;QAC7B,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;KACzB;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAiIO,oCAAY;AA/HrB;;;GAGG;AACH,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IACzC,MAAM,GAAG,GAAG,CAAC,CAAK,EAAE,EAAE;QACpB,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YACzC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACjC,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC;oBACL,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,MAAM,EAAE,CAAC;oBACT,MAAM,EAAE,CAAC;oBACT,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,GAAG,CAAC,CAAC,CAAC,CAAC;aACR;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC;AAChC,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,qBAAqB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC1C,MAAM,CAAC,GAAG,IAAI,gBAAK,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IAElC,qDAAqD;IACrD,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC;IACpC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAEjB,IAAI,IAAoB,CAAC;IACzB,IAAI,KAAa,CAAC;IAClB,OAAO,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,GAAG,IAAI,EAAE;QACvC,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;KACzB;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAwDqB,sDAAqB;AAtD5C;;;GAGG;AACH,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAClD,MAAM,GAAG,GAAG,CAAC,CAAK,EAAE,EAAE;;QACpB,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YACzC,kCAAkC;YAClC,IACE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EACxD;gBACA,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC;oBACL,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,MAAM,EAAE,CAAC;oBACT,MAAM,EAAE,CAAC;oBACT,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,GAAG,CAAC,CAAC,CAAC,CAAC;aACR;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC;AAChC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAChD,OAAO,IAAA,YAAK,EAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE;QAClC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE;YAC/C,OAAO,IAAA,YAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACpB;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAAa,EAAE,EAAE;IACzD,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;QAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;YAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QAClC,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,KAAK,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/lib/antv-dagre/rank/index.d.ts

@@ -0,0 +1,2 @@
+import { Graph as IGraph } from '../../types';
+export declare const rank: (g: IGraph, ranker: 'network-simplex' | 'tight-tree' | 'longest-path') => void;

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

@@ -1,6 +1,9 @@
-import { longestPath, longestPathWithLayer } from "./util";
-import { feasibleTreeWithLayer as feasibleTree } from "./feasible-tree";
-import { networkSimplex } from "./network-simplex";
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.rank = void 0;
+const feasible_tree_1 = require("./feasible-tree");
+const network_simplex_1 = require("./network-simplex");
+const util_1 = require("./util");
 /*
  * Assigns a rank to each node in the input graph that respects the "minlen"
  * constraint specified on edges between nodes.
@@ -20,15 +23,15 @@ import { networkSimplex } from "./network-simplex";
  *       algorithm. Ranks can start at any index (including negative), we'll
  *       fix them up later.
  */
-export var rank = function (g, ranker) {
+const rank = (g, ranker) => {
     switch (ranker) {
-        case "network-simplex":
+        case 'network-simplex':
             networkSimplexRanker(g);
             break;
-        case "tight-tree":
+        case 'tight-tree':
             tightTreeRanker(g);
             break;
-        case "longest-path":
+        case 'longest-path':
             longestPathRanker(g);
             break;
         // default: networkSimplexRanker(g);
@@ -36,13 +39,14 @@ export var rank = function (g, ranker) {
             tightTreeRanker(g);
     }
 };
+exports.rank = rank;
 // A fast and simple ranker, but results are far from optimal.
-var longestPathRanker = longestPath;
-var tightTreeRanker = function (g) {
-    longestPathWithLayer(g);
-    feasibleTree(g);
+const longestPathRanker = util_1.longestPath;
+const tightTreeRanker = (g) => {
+    (0, util_1.longestPathWithLayer)(g);
+    (0, feasible_tree_1.feasibleTreeWithLayer)(g);
 };
-var networkSimplexRanker = function (g) {
-    networkSimplex(g);
+const networkSimplexRanker = (g) => {
+    (0, network_simplex_1.networkSimplex)(g);
 };
 //# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/antv-dagre/rank/index.ts"],"names":[],"mappings":";;;AACA,mDAAwE;AACxE,uDAAmD;AACnD,iCAA2D;AAE3D;;;;;;;;;;;;;;;;;;GAkBG;AACI,MAAM,IAAI,GAAG,CAClB,CAAS,EACT,MAAyD,EACzD,EAAE;IACF,QAAQ,MAAM,EAAE;QACd,KAAK,iBAAiB;YACpB,oBAAoB,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM;QACR,KAAK,YAAY;YACf,eAAe,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM;QACR,KAAK,cAAc;YACjB,iBAAiB,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM;QACR,oCAAoC;QACpC;YACE,eAAe,CAAC,CAAC,CAAC,CAAC;KACtB;AACH,CAAC,CAAC;AAlBW,QAAA,IAAI,QAkBf;AAEF,8DAA8D;AAC9D,MAAM,iBAAiB,GAAG,kBAAW,CAAC;AAEtC,MAAM,eAAe,GAAG,CAAC,CAAS,EAAE,EAAE;IACpC,IAAA,2BAAoB,EAAC,CAAC,CAAC,CAAC;IACxB,IAAA,qCAAY,EAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAS,EAAE,EAAE;IACzC,IAAA,gCAAc,EAAC,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC"}

package/lib/{dagre → antv-dagre}/rank/network-simplex.d.ts

@@ -1,5 +1,5 @@
-import { Edge, ID } from "@antv/graphlib";
-import { EdgeData, Graph as IGraph } from "../../types";
+import { Edge, ID } from '@antv/graphlib';
+import { EdgeData, Graph as IGraph } from '../../types';
 export declare const networkSimplex: (og: IGraph) => void;
 export declare const initCutValues: (t: IGraph, g: IGraph) => void;
 export declare const calcCutValue: (t: IGraph, g: IGraph, child: ID) => number;

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

@@ -1,6 +1,9 @@
-import { feasibleTree } from "./feasible-tree";
-import { slack, longestPath as initRank } from "./util";
-import { dfs, minBy, simplify } from "../util";
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.exchangeEdges = exports.enterEdge = exports.leaveEdge = exports.initLowLimValues = exports.calcCutValue = exports.initCutValues = exports.networkSimplex = void 0;
+const util_1 = require("../util");
+const feasible_tree_1 = require("./feasible-tree");
+const util_2 = require("./util");
 /*
  * The network simplex algorithm assigns ranks to each node in the input graph
  * and iteratively improves the ranking to reduce the length of edges.
@@ -34,72 +37,74 @@ import { dfs, minBy, simplify } from "../util";
  * for Drawing Directed Graphs." The structure of the file roughly follows the
  * structure of the overall algorithm.
  */
-export var networkSimplex = function (og) {
-    var g = simplify(og);
-    initRank(g);
-    var t = feasibleTree(g);
-    initLowLimValues(t);
-    initCutValues(t, g);
-    var e;
-    var f;
-    while ((e = leaveEdge(t))) {
-        f = enterEdge(t, g, e);
-        exchangeEdges(t, g, e, f);
+const networkSimplex = (og) => {
+    const g = (0, util_1.simplify)(og);
+    (0, util_2.longestPath)(g);
+    const t = (0, feasible_tree_1.feasibleTree)(g);
+    (0, exports.initLowLimValues)(t);
+    (0, exports.initCutValues)(t, g);
+    let e;
+    let f;
+    while ((e = (0, exports.leaveEdge)(t))) {
+        f = (0, exports.enterEdge)(t, g, e);
+        (0, exports.exchangeEdges)(t, g, e, f);
     }
 };
+exports.networkSimplex = networkSimplex;
 /*
  * Initializes cut values for all edges in the tree.
  */
-export var initCutValues = function (t, g) {
-    var vs = dfs(t, t.getAllNodes(), "post", false);
+const initCutValues = (t, g) => {
+    let vs = (0, util_1.dfs)(t, t.getAllNodes(), 'post', false);
     vs = vs.slice(0, (vs === null || vs === void 0 ? void 0 : vs.length) - 1);
-    vs.forEach(function (v) {
+    vs.forEach((v) => {
         assignCutValue(t, g, v);
     });
 };
-var assignCutValue = function (t, g, child) {
-    var childLab = t.getNode(child);
-    var parent = childLab.data.parent;
+exports.initCutValues = initCutValues;
+const assignCutValue = (t, g, child) => {
+    const childLab = t.getNode(child);
+    const parent = childLab.data.parent;
     // FIXME: use undirected edge?
-    var edge = t
-        .getRelatedEdges(child, "both")
-        .find(function (e) { return e.target === parent || e.source === parent; });
-    edge.data.cutvalue = calcCutValue(t, g, child);
+    const edge = t
+        .getRelatedEdges(child, 'both')
+        .find((e) => e.target === parent || e.source === parent);
+    edge.data.cutvalue = (0, exports.calcCutValue)(t, g, child);
 };
 /*
  * Given the tight tree, its graph, and a child in the graph calculate and
  * return the cut value for the edge between the child and its parent.
  */
-export var calcCutValue = function (t, g, child) {
-    var childLab = t.getNode(child);
-    var parent = childLab.data.parent;
+const calcCutValue = (t, g, child) => {
+    const childLab = t.getNode(child);
+    const parent = childLab.data.parent;
     // True if the child is on the tail end of the edge in the directed graph
-    var childIsTail = true;
+    let childIsTail = true;
     // The graph's view of the tree edge we're inspecting
-    var graphEdge = g
-        .getRelatedEdges(child, "out")
-        .find(function (e) { return e.target === parent; });
+    let graphEdge = g
+        .getRelatedEdges(child, 'out')
+        .find((e) => e.target === parent);
     // The accumulated cut value for the edge between this node and its parent
-    var cutValue = 0;
+    let cutValue = 0;
     if (!graphEdge) {
         childIsTail = false;
         graphEdge = g
-            .getRelatedEdges(parent, "out")
-            .find(function (e) { return e.target === child; });
+            .getRelatedEdges(parent, 'out')
+            .find((e) => e.target === child);
     }
     cutValue = graphEdge.data.weight;
-    g.getRelatedEdges(child, "both").forEach(function (e) {
-        var isOutEdge = e.source === child;
-        var other = isOutEdge ? e.target : e.source;
+    g.getRelatedEdges(child, 'both').forEach((e) => {
+        const isOutEdge = e.source === child;
+        const other = isOutEdge ? e.target : e.source;
         if (other !== parent) {
-            var pointsToHead = isOutEdge === childIsTail;
-            var otherWeight = e.data.weight;
+            const pointsToHead = isOutEdge === childIsTail;
+            const otherWeight = e.data.weight;
             cutValue += pointsToHead ? otherWeight : -otherWeight;
             if (isTreeEdge(t, child, other)) {
                 // FIXME: use undirected edge?
-                var otherCutValue = t
-                    .getRelatedEdges(child, "both")
-                    .find(function (e) { return e.source === other || e.target === other; }).data
+                const otherCutValue = t
+                    .getRelatedEdges(child, 'both')
+                    .find((e) => e.source === other || e.target === other).data
                     .cutvalue;
                 cutValue += pointsToHead ? -otherCutValue : otherCutValue;
             }
@@ -107,17 +112,18 @@ export var calcCutValue = function (t, g, child) {
     });
     return cutValue;
 };
-export var initLowLimValues = function (tree, root) {
-    if (root === void 0) { root = tree.getAllNodes()[0].id; }
+exports.calcCutValue = calcCutValue;
+const initLowLimValues = (tree, root = tree.getAllNodes()[0].id) => {
     dfsAssignLowLim(tree, {}, 1, root);
 };
-var dfsAssignLowLim = function (tree, visited, nextLim, v, parent) {
+exports.initLowLimValues = initLowLimValues;
+const dfsAssignLowLim = (tree, visited, nextLim, v, parent) => {
     var _a;
-    var low = nextLim;
-    var useNextLim = nextLim;
-    var label = tree.getNode(v);
+    const low = nextLim;
+    let useNextLim = nextLim;
+    const label = tree.getNode(v);
     visited[v] = true;
-    (_a = tree.getNeighbors(v)) === null || _a === void 0 ? void 0 : _a.forEach(function (w) {
+    (_a = tree.getNeighbors(v)) === null || _a === void 0 ? void 0 : _a.forEach((w) => {
         if (!visited[w.id]) {
             useNextLim = dfsAssignLowLim(tree, visited, useNextLim, w.id, v);
         }
@@ -133,39 +139,41 @@ var dfsAssignLowLim = function (tree, visited, nextLim, v, parent) {
     }
     return useNextLim;
 };
-export var leaveEdge = function (tree) {
-    return tree.getAllEdges().find(function (e) {
+const leaveEdge = (tree) => {
+    return tree.getAllEdges().find((e) => {
         return e.data.cutvalue < 0;
     });
 };
-export var enterEdge = function (t, g, edge) {
-    var v = edge.source;
-    var w = edge.target;
+exports.leaveEdge = leaveEdge;
+const enterEdge = (t, g, edge) => {
+    let v = edge.source;
+    let w = edge.target;
     // For the rest of this function we assume that v is the tail and w is the
     // head, so if we don't have this edge in the graph we should flip it to
     // match the correct orientation.
-    if (!g.getRelatedEdges(v, "out").find(function (e) { return e.target === w; })) {
+    if (!g.getRelatedEdges(v, 'out').find((e) => e.target === w)) {
         v = edge.target;
         w = edge.source;
     }
-    var vLabel = t.getNode(v);
-    var wLabel = t.getNode(w);
-    var tailLabel = vLabel;
-    var flip = false;
+    const vLabel = t.getNode(v);
+    const wLabel = t.getNode(w);
+    let tailLabel = vLabel;
+    let flip = false;
     // If the root is in the tail of the edge then we need to flip the logic that
     // checks for the head and tail nodes in the candidates function below.
     if (vLabel.data.lim > wLabel.data.lim) {
         tailLabel = wLabel;
         flip = true;
     }
-    var candidates = g.getAllEdges().filter(function (edge) {
+    const candidates = g.getAllEdges().filter((edge) => {
         return (flip === isDescendant(t.getNode(edge.source), tailLabel) &&
             flip !== isDescendant(t.getNode(edge.target), tailLabel));
     });
-    return minBy(candidates, function (edge) {
-        return slack(g, edge);
+    return (0, util_1.minBy)(candidates, (edge) => {
+        return (0, util_2.slack)(g, edge);
     });
 };
+exports.enterEdge = enterEdge;
 /**
  *
  * @param t
@@ -173,38 +181,39 @@ export var enterEdge = function (t, g, edge) {
  * @param e edge to remove
  * @param f edge to add
  */
-export var exchangeEdges = function (t, g, e, f) {
+const exchangeEdges = (t, g, e, f) => {
     // FIXME: use undirected edge?
-    var existed = t
-        .getRelatedEdges(e.source, "both")
-        .find(function (edge) { return edge.source === e.target || edge.target === e.target; });
+    const existed = t
+        .getRelatedEdges(e.source, 'both')
+        .find((edge) => edge.source === e.target || edge.target === e.target);
     if (existed) {
         t.removeEdge(existed.id);
     }
     t.addEdge({
-        id: "e" + Math.random(),
+        id: `e${Math.random()}`,
         source: f.source,
         target: f.target,
         data: {},
     });
-    initLowLimValues(t);
-    initCutValues(t, g);
+    (0, exports.initLowLimValues)(t);
+    (0, exports.initCutValues)(t, g);
     updateRanks(t, g);
 };
-var updateRanks = function (t, g) {
-    var root = t.getAllNodes().find(function (v) {
+exports.exchangeEdges = exchangeEdges;
+const updateRanks = (t, g) => {
+    const root = t.getAllNodes().find((v) => {
         return !v.data.parent;
     });
-    var vs = dfs(t, root, "pre", false);
+    let vs = (0, util_1.dfs)(t, root, 'pre', false);
     vs = vs.slice(1);
-    vs.forEach(function (v) {
-        var parent = t.getNode(v).data.parent;
-        var edge = g.getRelatedEdges(v, "out").find(function (e) { return e.target === parent; });
+    vs.forEach((v) => {
+        const parent = t.getNode(v).data.parent;
+        let edge = g.getRelatedEdges(v, 'out').find((e) => e.target === parent);
         // let edge = g.edgeFromArgs(v, parent);
-        var flipped = false;
+        let flipped = false;
         if (!edge && g.hasNode(parent)) {
             // edge = g.edgeFromArgs(parent, v)!;
-            edge = g.getRelatedEdges(parent, "out").find(function (e) { return e.target === v; });
+            edge = g.getRelatedEdges(parent, 'out').find((e) => e.target === v);
             flipped = true;
         }
         g.getNode(v).data.rank =
@@ -215,17 +224,17 @@ var updateRanks = function (t, g) {
 /*
  * Returns true if the edge is in the tree.
  */
-var isTreeEdge = function (tree, u, v) {
+const isTreeEdge = (tree, u, v) => {
     // FIXME: use undirected edge?
     return tree
-        .getRelatedEdges(u, "both")
-        .find(function (e) { return e.source === v || e.target === v; });
+        .getRelatedEdges(u, 'both')
+        .find((e) => e.source === v || e.target === v);
 };
 /*
  * Returns true if the specified node is descendant of the root node per the
  * assigned low and lim attributes in the tree.
  */
-var isDescendant = function (vLabel, rootLabel) {
+const isDescendant = (vLabel, rootLabel) => {
     return (rootLabel.data.low <= vLabel.data.lim &&
         vLabel.data.lim <= rootLabel.data.lim);
 };

package/lib/antv-dagre/rank/network-simplex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"network-simplex.js","sourceRoot":"","sources":["../../../src/antv-dagre/rank/network-simplex.ts"],"names":[],"mappings":";;;AAEA,kCAA+C;AAC/C,mDAA+C;AAC/C,iCAAwD;AAExD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACI,MAAM,cAAc,GAAG,CAAC,EAAU,EAAE,EAAE;IAC3C,MAAM,CAAC,GAAG,IAAA,eAAQ,EAAC,EAAE,CAAC,CAAC;IACvB,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC;IACZ,MAAM,CAAC,GAAG,IAAA,4BAAY,EAAC,CAAC,CAAC,CAAC;IAC1B,IAAA,wBAAgB,EAAC,CAAC,CAAC,CAAC;IACpB,IAAA,qBAAa,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpB,IAAI,CAA6B,CAAC;IAClC,IAAI,CAAiB,CAAC;IACtB,OAAO,CAAC,CAAC,GAAG,IAAA,iBAAS,EAAC,CAAC,CAAC,CAAC,EAAE;QACzB,CAAC,GAAG,IAAA,iBAAS,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,IAAA,qBAAa,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;KAC3B;AACH,CAAC,CAAC;AAbW,QAAA,cAAc,kBAazB;AAEF;;GAEG;AACI,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IACpD,IAAI,EAAE,GAAG,IAAA,UAAG,EAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAChD,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAA,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,MAAM,IAAG,CAAC,CAAC,CAAC;IACjC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAK,EAAE,EAAE;QACnB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AANW,QAAA,aAAa,iBAMxB;AAEF,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAAS,EAAE,EAAE;IACzD,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC;IACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAa,CAAC;IAE3C,8BAA8B;IAC9B,MAAM,IAAI,GAAG,CAAC;SACX,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;SAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAAE,CAAC;IAC5D,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAA,oBAAY,EAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC,CAAC;AAEF;;;GAGG;AACI,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAAS,EAAE,EAAE;IAC9D,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC;IACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAY,CAAC;IAC1C,yEAAyE;IACzE,IAAI,WAAW,GAAG,IAAI,CAAC;IACvB,qDAAqD;IAErD,IAAI,SAAS,GAAG,CAAC;SACd,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC;SAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAE,CAAC;IACrC,0EAA0E;IAC1E,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,IAAI,CAAC,SAAS,EAAE;QACd,WAAW,GAAG,KAAK,CAAC;QACpB,SAAS,GAAG,CAAC;aACV,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC;aAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,CAAE,CAAC;KACrC;IAED,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,MAAO,CAAC;IAElC,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC7C,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC;QACrC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAE9C,IAAI,KAAK,KAAK,MAAM,EAAE;YACpB,MAAM,YAAY,GAAG,SAAS,KAAK,WAAW,CAAC;YAC/C,MAAM,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;YAEnC,QAAQ,IAAI,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;YACtD,IAAI,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE;gBAC/B,8BAA8B;gBAC9B,MAAM,aAAa,GAAG,CAAC;qBACpB,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;qBAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,CAAE,CAAC,IAAI;qBAC3D,QAAS,CAAC;gBACb,QAAQ,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC;aAC3D;SACF;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AA3CW,QAAA,YAAY,gBA2CvB;AAEK,MAAM,gBAAgB,GAAG,CAC9B,IAAY,EACZ,OAAW,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EACnC,EAAE;IACF,eAAe,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACrC,CAAC,CAAC;AALW,QAAA,gBAAgB,oBAK3B;AAEF,MAAM,eAAe,GAAG,CACtB,IAAY,EACZ,OAA4B,EAC5B,OAAe,EACf,CAAK,EACL,MAAW,EACX,EAAE;;IACF,MAAM,GAAG,GAAG,OAAO,CAAC;IACpB,IAAI,UAAU,GAAG,OAAO,CAAC;IACzB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAE/B,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAClB,MAAA,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YAClB,UAAU,GAAG,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;SAClE;IACH,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACrB,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,UAAU,EAAE,CAAC;IAC9B,IAAI,MAAM,EAAE;QACV,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;KAC5B;SAAM;QACL,0EAA0E;QAC1E,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;KAC1B;IAED,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEK,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,EAAE;IACxC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QACnC,OAAO,CAAC,CAAC,IAAI,CAAC,QAAS,GAAG,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAJW,QAAA,SAAS,aAIpB;AAEK,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,IAAoB,EAAE,EAAE;IACtE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACpB,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAEpB,0EAA0E;IAC1E,wEAAwE;IACxE,iCAAiC;IACjC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE;QAC5D,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAChB,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;KACjB;IAED,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAC7B,IAAI,SAAS,GAAG,MAAM,CAAC;IACvB,IAAI,IAAI,GAAG,KAAK,CAAC;IAEjB,6EAA6E;IAC7E,uEAAuE;IACvE,IAAI,MAAM,CAAC,IAAI,CAAC,GAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAI,EAAE;QACvC,SAAS,GAAG,MAAM,CAAC;QACnB,IAAI,GAAG,IAAI,CAAC;KACb;IAED,MAAM,UAAU,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACjD,OAAO,CACL,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC;YACxD,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,CACzD,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,IAAA,YAAK,EAAC,UAAU,EAAE,CAAC,IAAI,EAAE,EAAE;QAChC,OAAO,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAlCW,QAAA,SAAS,aAkCpB;AAEF;;;;;;GAMG;AACI,MAAM,aAAa,GAAG,CAC3B,CAAS,EACT,CAAS,EACT,CAAiB,EACjB,CAAiB,EACjB,EAAE;IACF,8BAA8B;IAC9B,MAAM,OAAO,GAAG,CAAC;SACd,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC;SACjC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC;IACxE,IAAI,OAAO,EAAE;QACX,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;KAC1B;IAED,CAAC,CAAC,OAAO,CAAC;QACR,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;QACvB,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,IAAI,EAAE,EAAE;KACT,CAAC,CAAC;IAEH,IAAA,wBAAgB,EAAC,CAAC,CAAC,CAAC;IACpB,IAAA,qBAAa,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC;AAxBW,QAAA,aAAa,iBAwBxB;AAEF,MAAM,WAAW,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAC3C,MAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QACtC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IACxB,CAAC,CAAE,CAAC;IAEJ,IAAI,EAAE,GAAG,IAAA,UAAG,EAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACpC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjB,EAAE,CAAC,OAAO,CAAC,CAAC,CAAK,EAAE,EAAE;QACnB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAY,CAAC;QAC9C,IAAI,IAAI,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;QACxE,wCAAwC;QACxC,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YAC9B,qCAAqC;YACrC,IAAI,GAAG,CAAC,CAAC,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;YACpE,OAAO,GAAG,IAAI,CAAC;SAChB;QAED,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;YACpB,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC,IAAI,CAAC,CAAC;gBAC1D,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,CAAC,MAAO,CAAC,CAAC,CAAC,CAAC,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,CAAC,MAAO,CAAA,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,CAAK,EAAE,CAAK,EAAE,EAAE;IAChD,8BAA8B;IAC9B,OAAO,IAAI;SACR,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC;SAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;AACnD,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAAG,CAAC,MAAsB,EAAE,SAAyB,EAAE,EAAE;IACzE,OAAO,CACL,SAAS,CAAC,IAAI,CAAC,GAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAI;QACvC,MAAM,CAAC,IAAI,CAAC,GAAI,IAAI,SAAS,CAAC,IAAI,CAAC,GAAI,CACxC,CAAC;AACJ,CAAC,CAAC"}

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

@@ -1,5 +1,5 @@
-import { Edge } from "@antv/graphlib";
-import { EdgeData, Graph } from "../../types";
+import { Edge } from '@antv/graphlib';
+import { EdgeData, Graph } from '../../types';
 declare const longestPath: (g: Graph) => void;
 declare const longestPathWithLayer: (g: Graph) => void;
 declare const slack: (g: Graph, e: Edge<EdgeData>) => number;