@antv/layout 1.2.13 → 1.2.14-beta.1

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

@@ -1,6 +1,6 @@
-import { slack } from "./util";
-import { minBy } from "../util";
-import { Graph } from "@antv/graphlib";
+import { Graph } from '@antv/graphlib';
+import { minBy } from '../util';
+import { slack } from './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,16 +26,16 @@ 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 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);
@@ -47,11 +47,11 @@ var feasibleTree = function (g) {
  * 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;
+const tightTree = (t, g) => {
+    const dfs = (v) => {
+        g.getRelatedEdges(v, 'both').forEach((e) => {
+            const edgeV = e.source;
+            const w = v === edgeV ? e.target : edgeV;
             if (!t.hasNode(w) && !slack(g, e)) {
                 t.addNode({
                     id: w,
@@ -67,7 +67,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,14 +95,14 @@ 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 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);
@@ -114,12 +114,12 @@ var feasibleTreeWithLayer = function (g) {
  * 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))) {
@@ -137,24 +137,24 @@ 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 minBy(g.getAllEdges(), (e) => {
         if (t.hasNode(e.source) !== t.hasNode(e.target)) {
             return 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;

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,OAAO,EAAQ,KAAK,EAAM,MAAM,gBAAgB,CAAC;AAEjD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAC;AAE/B;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,EAAE;IACjC,MAAM,CAAC,GAAG,IAAI,KAAK,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,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;KACzB;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;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,KAAK,CAAC,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,KAAK,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,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;KACzB;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;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,KAAK,CAAC,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,KAAK,CAAC,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,KAAK,CAAC,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;AAEF,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,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,6 @@
-import { longestPath, longestPathWithLayer } from "./util";
-import { feasibleTreeWithLayer as feasibleTree } from "./feasible-tree";
-import { networkSimplex } from "./network-simplex";
+import { feasibleTreeWithLayer as feasibleTree } from './feasible-tree';
+import { networkSimplex } from './network-simplex';
+import { longestPath, longestPathWithLayer } from './util';
 /*
  * Assigns a rank to each node in the input graph that respects the "minlen"
  * constraint specified on edges between nodes.
@@ -20,15 +20,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) {
+export 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);
@@ -37,12 +37,12 @@ export var rank = function (g, ranker) {
     }
 };
 // A fast and simple ranker, but results are far from optimal.
-var longestPathRanker = longestPath;
-var tightTreeRanker = function (g) {
+const longestPathRanker = longestPath;
+const tightTreeRanker = (g) => {
     longestPathWithLayer(g);
     feasibleTree(g);
 };
-var networkSimplexRanker = function (g) {
+const networkSimplexRanker = (g) => {
     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,OAAO,EAAE,qBAAqB,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,MAAM,QAAQ,CAAC;AAE3D;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,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;AAEF,8DAA8D;AAC9D,MAAM,iBAAiB,GAAG,WAAW,CAAC;AAEtC,MAAM,eAAe,GAAG,CAAC,CAAS,EAAE,EAAE;IACpC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACxB,YAAY,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAS,EAAE,EAAE;IACzC,cAAc,CAAC,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,6 @@
-import { feasibleTree } from "./feasible-tree";
-import { slack, longestPath as initRank } from "./util";
-import { dfs, minBy, simplify } from "../util";
+import { dfs, minBy, simplify } from '../util';
+import { feasibleTree } from './feasible-tree';
+import { longestPath as initRank, slack } from './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,14 +34,14 @@ 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);
+export const networkSimplex = (og) => {
+    const g = simplify(og);
     initRank(g);
-    var t = feasibleTree(g);
+    const t = feasibleTree(g);
     initLowLimValues(t);
     initCutValues(t, g);
-    var e;
-    var f;
+    let e;
+    let f;
     while ((e = leaveEdge(t))) {
         f = enterEdge(t, g, e);
         exchangeEdges(t, g, e, f);
@@ -50,56 +50,56 @@ export var networkSimplex = function (og) {
 /*
  * Initializes cut values for all edges in the tree.
  */
-export var initCutValues = function (t, g) {
-    var vs = dfs(t, t.getAllNodes(), "post", false);
+export const initCutValues = (t, g) => {
+    let vs = 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;
+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; });
+    const edge = t
+        .getRelatedEdges(child, 'both')
+        .find((e) => e.target === parent || e.source === parent);
     edge.data.cutvalue = 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;
+export 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 +107,16 @@ export var calcCutValue = function (t, g, child) {
     });
     return cutValue;
 };
-export var initLowLimValues = function (tree, root) {
-    if (root === void 0) { root = tree.getAllNodes()[0].id; }
+export const initLowLimValues = (tree, root = tree.getAllNodes()[0].id) => {
     dfsAssignLowLim(tree, {}, 1, root);
 };
-var dfsAssignLowLim = function (tree, visited, nextLim, v, parent) {
+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,36 +132,36 @@ var dfsAssignLowLim = function (tree, visited, nextLim, v, parent) {
     }
     return useNextLim;
 };
-export var leaveEdge = function (tree) {
-    return tree.getAllEdges().find(function (e) {
+export 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;
+export 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 minBy(candidates, (edge) => {
         return slack(g, edge);
     });
 };
@@ -173,16 +172,16 @@ 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) {
+export 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: {},
@@ -191,20 +190,20 @@ export var exchangeEdges = function (t, g, e, f) {
     initCutValues(t, g);
     updateRanks(t, g);
 };
-var updateRanks = function (t, g) {
-    var root = t.getAllNodes().find(function (v) {
+const updateRanks = (t, g) => {
+    const root = t.getAllNodes().find((v) => {
         return !v.data.parent;
     });
-    var vs = dfs(t, root, "pre", false);
+    let vs = 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 +214,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,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,WAAW,IAAI,QAAQ,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAC;AAExD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,EAAU,EAAE,EAAE;IAC3C,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IACvB,QAAQ,CAAC,CAAC,CAAC,CAAC;IACZ,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1B,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpB,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpB,IAAI,CAA6B,CAAC;IAClC,IAAI,CAAiB,CAAC;IACtB,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE;QACzB,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;KAC3B;AACH,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IACpD,IAAI,EAAE,GAAG,GAAG,CAAC,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;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,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,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;AAEF,MAAM,CAAC,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;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;AAEF,MAAM,CAAC,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;AAEF,MAAM,CAAC,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,KAAK,CAAC,UAAU,EAAE,CAAC,IAAI,EAAE,EAAE;QAChC,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,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,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpB,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC;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,GAAG,CAAC,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;

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

@@ -19,22 +19,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 +48,27 @@ 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) {
+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 +85,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 +95,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 +108,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)) {
@@ -129,7 +129,7 @@ var longestPathWithLayer = function (g) {
  * 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);

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;AAEF,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;AAEF;;;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;AAEF,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC"}

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,2 @@
+export {};
+//# 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>;