@antv/layout 0.1.19-beta.4 → 0.1.21

package/lib/layout/dagre/src/rank/feasible-tree.js

@@ -0,0 +1,156 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.feasibleTreeWithLayer = exports.feasibleTree = void 0;
+var graphlib_1 = __importDefault(require("../graphlib"));
+var util_1 = require("./util");
+var util_2 = require("../util");
+var Graph = graphlib_1.default.Graph;
+/*
+ * 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
+ * its "minlen" attribute.
+ *
+ * The basic structure for this function is derived from Gansner, et al., "A
+ * Technique for Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be a DAG.
+ *    2. Graph must be connected.
+ *    3. Graph must have at least one node.
+ *    5. Graph nodes must have been previously assigned a "rank" property that
+ *       respects the "minlen" property of incident edges.
+ *    6. Graph edges must have a "minlen" property.
+ *
+ * Post-conditions:
+ *
+ *    - Graph nodes will have their rank adjusted to ensure that all edges are
+ *      tight.
+ *
+ * Returns a tree (undirected graph) that is constructed using only "tight"
+ * edges.
+ */
+var feasibleTree = function (g) {
+    var t = new Graph({ directed: false });
+    // Choose arbitrary node from which to start our tree
+    var start = g.nodes()[0];
+    var size = g.nodeCount();
+    t.setNode(start, {});
+    var edge;
+    var delta;
+    while (tightTree(t, g) < size) {
+        edge = findMinSlackEdge(t, g);
+        delta = t.hasNode(edge.v) ? (0, util_1.slack)(g, edge) : -(0, util_1.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.nodeEdges(v).forEach(function (e) {
+            var edgeV = e.v;
+            var w = (v === edgeV) ? e.w : edgeV;
+            if (!t.hasNode(w) && !(0, util_1.slack)(g, e)) {
+                t.setNode(w, {});
+                t.setEdge(v, w, {});
+                dfs(w);
+            }
+        });
+    };
+    t.nodes().forEach(dfs);
+    return t.nodeCount();
+};
+/*
+ * 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
+ * its "minlen" attribute.
+ *
+ * The basic structure for this function is derived from Gansner, et al., "A
+ * Technique for Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be a DAG.
+ *    2. Graph must be connected.
+ *    3. Graph must have at least one node.
+ *    5. Graph nodes must have been previously assigned a "rank" property that
+ *       respects the "minlen" property of incident edges.
+ *    6. Graph edges must have a "minlen" property.
+ *
+ * Post-conditions:
+ *
+ *    - Graph nodes will have their rank adjusted to ensure that all edges are
+ *      tight.
+ *
+ * Returns a tree (undirected graph) that is constructed using only "tight"
+ * edges.
+ */
+var feasibleTreeWithLayer = function (g) {
+    var t = new Graph({ directed: false });
+    // Choose arbitrary node from which to start our tree
+    var start = g.nodes()[0];
+    var size = g.nodeCount();
+    t.setNode(start, {});
+    var edge;
+    var delta;
+    while (tightTreeWithLayer(t, g) < size) {
+        edge = findMinSlackEdge(t, g);
+        delta = t.hasNode(edge.v) ? (0, util_1.slack)(g, edge) : -(0, util_1.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) {
+        var _a;
+        (_a = g.nodeEdges(v)) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
+            var edgeV = e.v;
+            var w = (v === edgeV) ? e.w : edgeV;
+            // 对于指定layer的，直接加入tight-tree，不参与调整
+            if (!t.hasNode(w) && (g.node(w).layer !== undefined || !(0, util_1.slack)(g, e))) {
+                t.setNode(w, {});
+                t.setEdge(v, w, {});
+                dfs(w);
+            }
+        });
+    };
+    t.nodes().forEach(dfs);
+    return t.nodeCount();
+};
+/*
+ * Finds the edge with the smallest slack that is incident on tree and returns
+ * it.
+ */
+var findMinSlackEdge = function (t, g) {
+    return (0, util_2.minBy)(g.edges(), function (e) {
+        if (t.hasNode(e.v) !== t.hasNode(e.w)) {
+            return (0, util_1.slack)(g, e);
+        }
+        return Infinity;
+    });
+};
+var shiftRanks = function (t, g, delta) {
+    t.nodes().forEach(function (v) {
+        if (!g.node(v).rank)
+            g.node(v).rank = 0;
+        g.node(v).rank += delta;
+    });
+};
+exports.default = {
+    feasibleTree: feasibleTree,
+    feasibleTreeWithLayer: feasibleTreeWithLayer
+};
+//# sourceMappingURL=feasible-tree.js.map

package/lib/layout/dagre/src/rank/feasible-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"feasible-tree.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/rank/feasible-tree.ts"],"names":[],"mappings":";;;;;;AACA,yDAAmC;AACnC,+BAA+B;AAC/B,gCAAgC;AAGhC,IAAM,KAAK,GAAI,kBAAgB,CAAC,KAAK,CAAC;AAGtC;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,IAAM,YAAY,GAAG,UAAC,CAAS;IAC7B,IAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAQ,CAAC;IAEhD,qDAAqD;IACrD,IAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAM,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3B,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAErB,IAAI,IAAS,CAAC;IACd,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,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7D,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;KACzB;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AA+GA,oCAAY;AA7Gd;;;GAGG;AACH,IAAM,SAAS,GAAG,UAAC,CAAS,EAAE,CAAS;IACrC,IAAM,GAAG,GAAG,UAAC,CAAS;QACpB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;YACvB,IAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAClB,IAAM,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACtC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACjC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACjB,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACpB,GAAG,CAAC,CAAC,CAAC,CAAC;aACR;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;AACvB,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,IAAM,qBAAqB,GAAG,UAAC,CAAS;IACtC,IAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAQ,CAAC;IAEhD,qDAAqD;IACrD,IAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAM,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3B,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAErB,IAAI,IAAS,CAAC;IACd,IAAI,KAAa,CAAC;IAClB,OAAO,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE;QACtC,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7D,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;KACzB;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AA+CA,sDAAqB;AA5CvB;;;GAGG;AACH,IAAM,kBAAkB,GAAG,UAAC,CAAS,EAAE,CAAS;IAC9C,IAAM,GAAG,GAAG,UAAC,CAAS;;QACpB,MAAA,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;YACxB,IAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAClB,IAAM,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACtC,kCAAkC;YAClC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,IAAA,YAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;gBACpE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACjB,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACpB,GAAG,CAAC,CAAC,CAAC,CAAC;aACR;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;AACvB,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,gBAAgB,GAAG,UAAC,CAAS,EAAE,CAAS;IAC5C,OAAO,IAAA,YAAK,EAAC,CAAC,CAAC,KAAK,EAAE,EAAE,UAAC,CAAM;QAC7B,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YACrC,OAAO,IAAA,YAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACpB;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAS,EAAE,CAAS,EAAE,KAAa;IACrD,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAS;QAC1B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QACvC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAe,IAAI,KAAK,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAOF,kBAAe;IACb,YAAY,cAAA;IACZ,qBAAqB,uBAAA;CACtB,CAAC"}

package/lib/layout/dagre/src/rank/index.d.ts

@@ -0,0 +1,4 @@
+import { graphlib } from '../../graphlib';
+declare type IGraph = graphlib.Graph;
+declare const rank: (g: IGraph) => void;
+export default rank;

package/lib/layout/dagre/src/rank/index.js

@@ -0,0 +1,58 @@
+"use strict";
+// "use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+// var rankUtil = require("./util");
+// var longestPath = rankUtil.longestPathWithLayer;
+// var feasibleTree = require("./feasible-tree").feasibleTreeWithLayer;
+// var networkSimplex = require("./network-simplex");
+var util_1 = require("./util");
+var feasible_tree_1 = require("./feasible-tree");
+var network_simplex_1 = __importDefault(require("./network-simplex"));
+/*
+ * Assigns a rank to each node in the input graph that respects the "minlen"
+ * constraint specified on edges between nodes.
+ *
+ * This basic structure is derived from Gansner, et al., "A Technique for
+ * Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be a connected DAG
+ *    2. Graph nodes must be objects
+ *    3. Graph edges must have "weight" and "minlen" attributes
+ *
+ * Post-conditions:
+ *
+ *    1. Graph nodes will have a "rank" attribute based on the results of the
+ *       algorithm. Ranks can start at any index (including negative), we'll
+ *       fix them up later.
+ */
+var rank = function (g) {
+    switch (g.graph().ranker) {
+        case "network-simplex":
+            networkSimplexRanker(g);
+            break;
+        case "tight-tree":
+            tightTreeRanker(g);
+            break;
+        case "longest-path":
+            longestPathRanker(g);
+            break;
+        // default: networkSimplexRanker(g);
+        default: tightTreeRanker(g);
+    }
+};
+// A fast and simple ranker, but results are far from optimal.
+var longestPathRanker = util_1.longestPath;
+var tightTreeRanker = function (g) {
+    (0, util_1.longestPathWithLayer)(g);
+    (0, feasible_tree_1.feasibleTreeWithLayer)(g);
+};
+var networkSimplexRanker = function (g) {
+    (0, network_simplex_1.default)(g);
+};
+exports.default = rank;
+//# sourceMappingURL=index.js.map

package/lib/layout/dagre/src/rank/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/rank/index.ts"],"names":[],"mappings":";AAAA,gBAAgB;;;;;AAEhB,oCAAoC;AACpC,mDAAmD;AACnD,uEAAuE;AACvE,qDAAqD;AAErD,+BAA2D;AAC3D,iDAAwE;AACxE,sEAA+C;AAK/C;;;;;;;;;;;;;;;;;;GAkBG;AACH,IAAM,IAAI,GAAG,UAAC,CAAS;IACrB,QAAO,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE;QACzB,KAAK,iBAAiB;YAAE,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAAC,MAAM;QACvD,KAAK,YAAY;YAAE,eAAe,CAAC,CAAC,CAAC,CAAC;YAAC,MAAM;QAC7C,KAAK,cAAc;YAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;YAAC,MAAM;QACjD,oCAAoC;QACpC,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;KAC3B;AACH,CAAC,CAAC;AAEF,8DAA8D;AAC9D,IAAM,iBAAiB,GAAG,kBAAW,CAAC;AAEtC,IAAM,eAAe,GAAG,UAAC,CAAS;IAChC,IAAA,2BAAoB,EAAC,CAAC,CAAC,CAAC;IACxB,IAAA,qCAAY,EAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC;AAEF,IAAM,oBAAoB,GAAG,UAAC,CAAS;IACrC,IAAA,yBAAc,EAAC,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC;AAEF,kBAAe,IAAI,CAAC"}

package/lib/layout/dagre/src/rank/network-simplex.d.ts

@@ -0,0 +1,12 @@
+import { graphlib as IGraphLib } from '../../graphlib';
+declare type IGraph = IGraphLib.Graph;
+declare const networkSimplex: {
+    (g: IGraph): void;
+    initLowLimValues: (tree: IGraph, root?: string | undefined) => void;
+    initCutValues: (t: IGraph, g: IGraph) => void;
+    calcCutValue: (t: IGraph, g: IGraph, child: string) => number;
+    leaveEdge: (tree: IGraph) => import("../../graphlib").Edge | undefined;
+    enterEdge: (t: IGraph, g: IGraph, edge: any) => undefined;
+    exchangeEdges: (t: IGraph, g: IGraph, e: any, f: any) => void;
+};
+export default networkSimplex;

package/lib/layout/dagre/src/rank/network-simplex.js

@@ -0,0 +1,212 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var feasible_tree_1 = require("./feasible-tree");
+var util_1 = require("./util");
+var util_2 = require("../util");
+var graphlib_1 = __importDefault(require("../graphlib"));
+var alg = graphlib_1.default.alg;
+var preorder = alg.preorder, postorder = alg.postorder;
+/*
+ * The network simplex algorithm assigns ranks to each node in the input graph
+ * and iteratively improves the ranking to reduce the length of edges.
+ *
+ * Preconditions:
+ *
+ *    1. The input graph must be a DAG.
+ *    2. All nodes in the graph must have an object value.
+ *    3. All edges in the graph must have "minlen" and "weight" attributes.
+ *
+ * Postconditions:
+ *
+ *    1. All nodes in the graph will have an assigned "rank" attribute that has
+ *       been optimized by the network simplex algorithm. Ranks start at 0.
+ *
+ *
+ * A rough sketch of the algorithm is as follows:
+ *
+ *    1. Assign initial ranks to each node. We use the longest path algorithm,
+ *       which assigns ranks to the lowest position possible. In general this
+ *       leads to very wide bottom ranks and unnecessarily long edges.
+ *    2. Construct a feasible tight tree. A tight tree is one such that all
+ *       edges in the tree have no slack (difference between length of edge
+ *       and minlen for the edge). This by itself greatly improves the assigned
+ *       rankings by shorting edges.
+ *    3. Iteratively find edges that have negative cut values. Generally a
+ *       negative cut value indicates that the edge could be removed and a new
+ *       tree edge could be added to produce a more compact graph.
+ *
+ * Much of the algorithms here are derived from Gansner, et al., "A Technique
+ * for Drawing Directed Graphs." The structure of the file roughly follows the
+ * structure of the overall algorithm.
+ */
+var networkSimplex = function (g) {
+    // tslint:disable-next-line
+    g = (0, util_2.simplify)(g);
+    (0, util_1.longestPath)(g);
+    var t = (0, feasible_tree_1.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);
+    }
+};
+/*
+ * Initializes cut values for all edges in the tree.
+ */
+var initCutValues = function (t, g) {
+    var vs = postorder(t, t.nodes());
+    vs = vs.slice(0, vs.length - 1);
+    vs.forEach(function (v) {
+        assignCutValue(t, g, v);
+    });
+};
+var assignCutValue = function (t, g, child) {
+    var childLab = t.node(child);
+    var parent = childLab.parent;
+    t.edge(child, parent).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.
+ */
+var calcCutValue = function (t, g, child) {
+    var childLab = t.node(child);
+    var parent = childLab.parent;
+    // True if the child is on the tail end of the edge in the directed graph
+    var childIsTail = true;
+    // The graph's view of the tree edge we're inspecting
+    var graphEdge = g.edge(child, parent);
+    // The accumulated cut value for the edge between this node and its parent
+    var cutValue = 0;
+    if (!graphEdge) {
+        childIsTail = false;
+        graphEdge = g.edge(parent, child);
+    }
+    cutValue = graphEdge.weight;
+    g.nodeEdges(child).forEach(function (e) {
+        var isOutEdge = e.v === child;
+        var other = isOutEdge ? e.w : e.v;
+        if (other !== parent) {
+            var pointsToHead = isOutEdge === childIsTail;
+            var otherWeight = g.edge(e).weight;
+            cutValue += pointsToHead ? otherWeight : -otherWeight;
+            if (isTreeEdge(t, child, other)) {
+                var otherCutValue = t.edge(child, other).cutvalue;
+                cutValue += pointsToHead ? -otherCutValue : otherCutValue;
+            }
+        }
+    });
+    return cutValue;
+};
+var initLowLimValues = function (tree, root) {
+    if (root !== undefined) {
+        // tslint:disable-next-line
+        root = tree.nodes()[0];
+    }
+    dfsAssignLowLim(tree, {}, 1, root);
+};
+var dfsAssignLowLim = function (tree, visited, nextLim, v, parent) {
+    var _a;
+    var low = nextLim;
+    var useNextLim = nextLim;
+    var label = tree.node(v);
+    visited[v] = true;
+    (_a = tree.neighbors(v)) === null || _a === void 0 ? void 0 : _a.forEach(function (w) {
+        if (!visited.hasOwnProperty(w)) {
+            useNextLim = dfsAssignLowLim(tree, visited, useNextLim, w, v);
+        }
+    });
+    label.low = low;
+    label.lim = useNextLim++;
+    if (parent) {
+        label.parent = parent;
+    }
+    else {
+        // TODO should be able to remove this when we incrementally update low lim
+        delete label.parent;
+    }
+    return useNextLim;
+};
+var leaveEdge = function (tree) {
+    return tree.edges().find(function (e) {
+        return tree.edge(e).cutvalue < 0;
+    });
+};
+var enterEdge = function (t, g, edge) {
+    var v = edge.v;
+    var w = edge.w;
+    // 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.hasEdge(v, w)) {
+        v = edge.w;
+        w = edge.v;
+    }
+    var vLabel = t.node(v);
+    var wLabel = t.node(w);
+    var tailLabel = vLabel;
+    var 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.lim > wLabel.lim) {
+        tailLabel = wLabel;
+        flip = true;
+    }
+    var candidates = g.edges().filter(function (edge) {
+        return flip === isDescendant(t, t.node(edge.v), tailLabel) &&
+            flip !== isDescendant(t, t.node(edge.w), tailLabel);
+    });
+    return (0, util_2.minBy)(candidates, function (edge) { return (0, util_1.slack)(g, edge); });
+};
+var exchangeEdges = function (t, g, e, f) {
+    var v = e.v;
+    var w = e.w;
+    t.removeEdge(v, w);
+    t.setEdge(f.v, f.w, {});
+    initLowLimValues(t);
+    initCutValues(t, g);
+    updateRanks(t, g);
+};
+var updateRanks = function (t, g) {
+    var root = t.nodes().find(function (v) { return !g.node(v).parent; });
+    var vs = preorder(t, root);
+    vs = vs.slice(1);
+    vs.forEach(function (v) {
+        var parent = t.node(v).parent;
+        var edge = g.edge(v, parent);
+        var flipped = false;
+        if (!edge) {
+            edge = g.edge(parent, v);
+            flipped = true;
+        }
+        g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);
+    });
+};
+/*
+ * Returns true if the edge is in the tree.
+ */
+var isTreeEdge = function (tree, u, v) {
+    return tree.hasEdge(u, 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 (tree, vLabel, rootLabel) {
+    return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;
+};
+// Expose some internals for testing purposes
+networkSimplex.initLowLimValues = initLowLimValues;
+networkSimplex.initCutValues = initCutValues;
+networkSimplex.calcCutValue = calcCutValue;
+networkSimplex.leaveEdge = leaveEdge;
+networkSimplex.enterEdge = enterEdge;
+networkSimplex.exchangeEdges = exchangeEdges;
+exports.default = networkSimplex;
+//# sourceMappingURL=network-simplex.js.map

package/lib/layout/dagre/src/rank/network-simplex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"network-simplex.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/rank/network-simplex.ts"],"names":[],"mappings":";;;;;AACA,iDAA+C;AAC/C,+BAAwD;AACxD,gCAA0C;AAC1C,yDAAmC;AAGnC,IAAM,GAAG,GAAG,kBAAQ,CAAC,GAAG,CAAC;AAEjB,IAAA,QAAQ,GAAgB,GAAG,SAAnB,EAAE,SAAS,GAAK,GAAG,UAAR,CAAS;AAGpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,IAAM,cAAc,GAAG,UAAC,CAAS;IAC/B,2BAA2B;IAC3B,CAAC,GAAG,IAAA,eAAQ,EAAC,CAAC,CAAQ,CAAC;IACvB,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC;IACZ,IAAM,CAAC,GAAG,IAAA,4BAAY,EAAC,CAAC,CAAW,CAAC;IACpC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpB,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpB,IAAI,CAAC,CAAC;IACN,IAAI,CAAC,CAAC;IACN,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,IAAM,aAAa,GAAG,UAAC,CAAS,EAAE,CAAS;IACzC,IAAI,EAAE,GAAG,SAAS,CAAC,CAAQ,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IACxC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAChC,EAAE,CAAC,OAAO,CAAC,UAAC,CAAS;QACnB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,cAAc,GAAG,UAAC,CAAS,EAAE,CAAS,EAAE,KAAa;IACzD,IAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAM,MAAM,GAAI,QAAgB,CAAC,MAAM,CAAC;IACxC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AAC7D,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,YAAY,GAAG,UAAC,CAAS,EAAE,CAAS,EAAE,KAAa;IACvD,IAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAM,MAAM,GAAG,QAAQ,CAAC,MAAgB,CAAC;IACzC,yEAAyE;IACzE,IAAI,WAAW,GAAG,IAAI,CAAC;IACvB,qDAAqD;IACrD,IAAI,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACtC,0EAA0E;IAC1E,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,IAAI,CAAC,SAAS,EAAE;QACd,WAAW,GAAG,KAAK,CAAC;QACpB,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;KACnC;IAED,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;IAE5B,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;QAC3B,IAAM,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC;QAChC,IAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpC,IAAI,KAAK,KAAK,MAAM,EAAE;YACpB,IAAM,YAAY,GAAG,SAAS,KAAK,WAAW,CAAC;YAC/C,IAAM,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAErC,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,IAAM,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC;gBACpD,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,IAAM,gBAAgB,GAAG,UAAC,IAAY,EAAE,IAAa;IACnD,IAAI,IAAI,KAAK,SAAS,EAAE;QACtB,2BAA2B;QAC3B,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;KACxB;IACD,eAAe,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,IAAc,CAAC,CAAC;AAC/C,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UAAC,IAAY,EAAE,OAAY,EAAE,OAAe,EAAE,CAAS,EAAE,MAAe;;IAC9F,IAAM,GAAG,GAAG,OAAO,CAAC;IACpB,IAAI,UAAU,GAAG,OAAO,CAAC;IACzB,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAQ,CAAC;IAElC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAClB,MAAA,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAM;QAChC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;YAC9B,UAAU,GAAG,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SAC/D;IACH,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC;IAChB,KAAK,CAAC,GAAG,GAAG,UAAU,EAAE,CAAC;IACzB,IAAI,MAAM,EAAE;QACV,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;KACvB;SAAM;QACL,0EAA0E;QAC1E,OAAO,KAAK,CAAC,MAAM,CAAC;KACrB;IAED,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,IAAM,SAAS,GAAG,UAAC,IAAY;IAC7B,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,UAAC,CAAC;QACzB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,SAAS,GAAG,UAAC,CAAS,EAAE,CAAS,EAAE,IAAS;IAChD,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACf,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAEf,0EAA0E;IAC1E,wEAAwE;IACxE,iCAAiC;IACjC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;QACpB,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACX,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;KACZ;IAED,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,SAAS,GAAG,MAAM,CAAC;IACvB,IAAI,IAAI,GAAG,KAAK,CAAC;IAEjB,6EAA6E;IAC7E,uEAAuE;IACvE,IAAK,MAAM,CAAC,GAAc,GAAI,MAAM,CAAC,GAAc,EAAE;QACnD,SAAS,GAAG,MAAM,CAAC;QACnB,IAAI,GAAG,IAAI,CAAC;KACb;IAED,IAAM,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,UAAC,IAAI;QACvC,OAAO,IAAI,KAAK,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;YACnD,IAAI,KAAK,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,OAAO,IAAA,YAAK,EAAC,UAAU,EAAE,UAAC,IAAI,IAAO,OAAO,IAAA,YAAK,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC,CAAC;AAEF,IAAM,aAAa,GAAG,UAAC,CAAS,EAAE,CAAS,EAAE,CAAM,EAAE,CAAM;IACzD,IAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACd,IAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACd,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACxB,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,IAAM,WAAW,GAAG,UAAC,CAAS,EAAE,CAAS;IACvC,IAAM,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,UAAC,CAAC,IAAM,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,EAAE,GAAG,QAAQ,CAAC,CAAQ,EAAE,IAAW,CAAC,CAAC;IACzC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjB,EAAE,CAAC,OAAO,CAAC,UAAC,CAAS;QACnB,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAgB,CAAC;QAC1C,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC7B,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACzB,OAAO,GAAG,IAAI,CAAC;SAChB;QAED,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;GAEG;AACH,IAAM,UAAU,GAAG,UAAC,IAAY,EAAE,CAAS,EAAE,CAAS;IACpD,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,YAAY,GAAG,UAAC,IAAY,EAAE,MAAW,EAAE,SAAc;IAC7D,OAAO,SAAS,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC;AACpE,CAAC,CAAC;AAGF,6CAA6C;AAC7C,cAAc,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;AACnD,cAAc,CAAC,aAAa,GAAG,aAAa,CAAC;AAC7C,cAAc,CAAC,YAAY,GAAG,YAAY,CAAC;AAC3C,cAAc,CAAC,SAAS,GAAG,SAAS,CAAC;AACrC,cAAc,CAAC,SAAS,GAAG,SAAS,CAAC;AACrC,cAAc,CAAC,aAAa,GAAG,aAAa,CAAC;AAE7C,kBAAe,cAAc,CAAC"}

package/lib/layout/dagre/src/rank/util.d.ts

@@ -0,0 +1,12 @@
+import { graphlib } from "../../graphlib";
+declare type Graph = graphlib.Graph;
+declare const longestPath: (g: Graph) => void;
+declare const longestPathWithLayer: (g: Graph) => void;
+declare const slack: (g: Graph, e: any) => number;
+export { longestPath, longestPathWithLayer, slack, };
+declare const _default: {
+    longestPath: (g: Graph) => void;
+    longestPathWithLayer: (g: Graph) => void;
+    slack: (g: Graph, e: any) => number;
+};
+export default _default;

package/lib/layout/dagre/src/rank/util.js

@@ -0,0 +1,114 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.slack = exports.longestPathWithLayer = exports.longestPath = void 0;
+/*
+ * Initializes ranks for the input graph using the longest path algorithm. This
+ * algorithm scales well and is fast in practice, it yields rather poor
+ * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom
+ * ranks wide and leaving edges longer than necessary. However, due to its
+ * speed, this algorithm is good for getting an initial ranking that can be fed
+ * into other algorithms.
+ *
+ * This algorithm does not normalize layers because it will be used by other
+ * algorithms in most cases. If using this algorithm directly, be sure to
+ * run normalize at the end.
+ *
+ * Pre-conditions:
+ *
+ *    1. Input graph is a DAG.
+ *    2. Input graph node labels can be assigned properties.
+ *
+ * Post-conditions:
+ *
+ *    1. Each node will be assign an (unnormalized) "rank" property.
+ */
+var longestPath = function (g) {
+    var visited = {};
+    var dfs = function (v) {
+        var _a;
+        var label = g.node(v);
+        if (visited.hasOwnProperty(v)) {
+            return label.rank;
+        }
+        visited[v] = true;
+        var lengths = (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.map(function (e) {
+            return (dfs(e.w) - g.edge(e).minlen) || Infinity;
+        });
+        var rank = Math.min.apply(Math, lengths);
+        if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
+            rank === undefined || // return value of _.map([]) for Lodash 4
+            rank === null) { // return value of _.map([null])
+            rank = 0;
+        }
+        label.rank = rank;
+        return rank;
+    };
+    g.sources().forEach(function (source) { return dfs(source); });
+};
+exports.longestPath = longestPath;
+var longestPathWithLayer = function (g) {
+    // 用longest path，找出最深的点
+    var visited = {};
+    var minRank = 0;
+    var dfs = function (v) {
+        var _a;
+        var label = g.node(v);
+        if (visited.hasOwnProperty(v)) {
+            return label.rank;
+        }
+        visited[v] = true;
+        var lengths = (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.map(function (e) {
+            return (dfs(e.w) - g.edge(e).minlen) || Infinity;
+        });
+        var rank = Math.min.apply(Math, lengths);
+        if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
+            rank === undefined || // return value of _.map([]) for Lodash 4
+            rank === null) { // return value of _.map([null])
+            rank = 0;
+        }
+        label.rank = rank;
+        minRank = Math.min(label.rank, minRank);
+        return label.rank;
+    };
+    g.sources().forEach(function (source) { return dfs(source); });
+    minRank += 1; // NOTE: 最小的层级是dummy root，+1
+    // forward一遍，赋值层级
+    var dfsForward = function (v, nextRank) {
+        var _a;
+        var label = g.node(v);
+        var currRank = (!isNaN(label.layer) ? label.layer : nextRank);
+        // 没有指定，取最大值
+        if (label.rank === undefined || label.rank < currRank) {
+            label.rank = currRank;
+        }
+        // DFS遍历子节点
+        (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.map(function (e) {
+            dfsForward(e.w, currRank + g.edge(e).minlen);
+        });
+    };
+    // 指定层级的，更新下游
+    g.nodes().forEach(function (n) {
+        var label = g.node(n);
+        if (!isNaN(label.layer)) {
+            dfsForward(n, label.layer); // 默认的dummy root所在层的rank是-1
+        }
+        else {
+            label.rank -= minRank;
+        }
+    });
+};
+exports.longestPathWithLayer = longestPathWithLayer;
+/*
+ * Returns the amount of slack for the given edge. The slack is defined as the
+ * difference between the length of the edge and its minimum length.
+ */
+var slack = function (g, e) {
+    return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;
+};
+exports.slack = slack;
+exports.default = {
+    longestPath: longestPath,
+    longestPathWithLayer: longestPathWithLayer,
+    slack: slack,
+};
+//# sourceMappingURL=util.js.map

package/lib/layout/dagre/src/rank/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/rank/util.ts"],"names":[],"mappings":";;;AAIA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,IAAM,WAAW,GAAG,UAAC,CAAQ;IAC3B,IAAM,OAAO,GAAQ,EAAE,CAAC;IAExB,IAAM,GAAG,GAAG,UAAC,CAAS;;QACpB,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;YAC7B,OAAO,KAAK,CAAC,IAAI,CAAC;SACnB;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAElB,IAAM,OAAO,GAAG,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,GAAG,CAAC,UAAC,CAAM;YACxC,OAAO,CAAE,GAAG,CAAC,CAAC,CAAC,CAAW,CAAY,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC;QACzE,CAAC,CAAa,CAAC;QACf,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,OAAO,CAAC,CAAC;QAEhC,IAAI,IAAI,KAAK,MAAM,CAAC,iBAAiB,IAAI,yCAAyC;YAC9E,IAAI,KAAK,SAAS,IAAI,yCAAyC;YAC/D,IAAI,KAAK,IAAI,EAAE,EAAE,gCAAgC;YACnD,IAAI,GAAG,CAAC,CAAC;SACV;QAED,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,UAAC,MAAM,IAAK,OAAA,GAAG,CAAC,MAAa,CAAC,EAAlB,CAAkB,CAAC,CAAC;AACtD,CAAC,CAAC;AAuEA,kCAAW;AArEb,IAAM,oBAAoB,GAAG,UAAC,CAAQ;IACpC,uBAAuB;IACvB,IAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,IAAM,GAAG,GAAG,UAAC,CAAS;;QACpB,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;YAC7B,OAAO,KAAK,CAAC,IAAI,CAAC;SACnB;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAElB,IAAM,OAAO,GAAG,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,GAAG,CAAC,UAAC,CAAC;YACnC,OAAO,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC;QAC/D,CAAC,CAAa,CAAC;QACf,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,OAAO,CAAC,CAAC;QAEhC,IAAI,IAAI,KAAK,MAAM,CAAC,iBAAiB,IAAI,yCAAyC;YAC9E,IAAI,KAAK,SAAS,IAAI,yCAAyC;YAC/D,IAAI,KAAK,IAAI,EAAE,EAAE,gCAAgC;YACnD,IAAI,GAAG,CAAC,CAAC;SACV;QAED,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACxC,OAAO,KAAK,CAAC,IAAI,CAAC;IACpB,CAAC,CAAC;IAEF,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,UAAC,MAAW,IAAK,OAAA,GAAG,CAAC,MAAM,CAAC,EAAX,CAAW,CAAC,CAAC;IAElD,OAAO,IAAI,CAAC,CAAC,CAAC,4BAA4B;IAE1C,iBAAiB;IACjB,IAAM,UAAU,GAAG,UAAC,CAAS,EAAE,QAAgB;;QAC7C,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExB,IAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAe,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAW,CAAC;QAEpF,YAAY;QACZ,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,GAAG,QAAQ,EAAE;YACrD,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;SACvB;QAED,WAAW;QACX,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,GAAG,CAAC,UAAC,CAAC;YACnB,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,aAAa;IACb,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC;QAClB,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAe,CAAC,EAAE;YACjC,UAAU,CAAC,CAAC,EAAG,KAAK,CAAC,KAAgB,CAAC,CAAC,CAAC,2BAA2B;SACpE;aAAM;YACJ,KAAK,CAAC,IAAe,IAAI,OAAO,CAAC;SACnC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAYA,oDAAoB;AAVtB;;;GAGG;AACH,IAAM,KAAK,GAAG,UAAC,CAAQ,EAAE,CAAM;IAC7B,OAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAe,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAe,GAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAiB,CAAC;AACpG,CAAC,CAAC;AAKA,sBAAK;AAGP,kBAAe;IACb,WAAW,aAAA;IACX,oBAAoB,sBAAA;IACpB,KAAK,OAAA;CACN,CAAC"}

package/lib/layout/dagre/src/util.d.ts

@@ -0,0 +1,50 @@
+import { graphlib as IGraphLib } from '../graphlib';
+declare type IGraph = IGraphLib.Graph;
+declare const addDummyNode: (g: IGraph, type: any, attrs: any, name: string) => string;
+declare const simplify: (g: IGraph) => any;
+declare const asNonCompoundGraph: (g: IGraph) => IGraph;
+declare const zipObject: (keys: string[], values: any) => any;
+declare const successorWeights: (g: IGraph) => any;
+declare const predecessorWeights: (g: IGraph) => any;
+declare const intersectRect: (rect: any, point: any) => {
+    x: any;
+    y: any;
+};
+declare const buildLayerMatrix: (g: IGraph) => any;
+declare const normalizeRanks: (g: IGraph) => void;
+declare const removeEmptyRanks: (g: IGraph) => void;
+declare const addBorderNode: (g: IGraph, prefix: string, rank?: number | undefined, order?: number | undefined) => string;
+declare const maxRank: (g: IGraph) => number;
+declare const partition: (collection: any, fn: any) => {
+    lhs: any;
+    rhs: any;
+};
+declare const time: (name: string, fn: () => unknown) => unknown;
+declare const notime: (name: string, fn: () => unknown) => unknown;
+declare const minBy: (array: any, func: (param: any) => number) => undefined;
+export { addDummyNode, simplify, asNonCompoundGraph, successorWeights, predecessorWeights, intersectRect, buildLayerMatrix, normalizeRanks, removeEmptyRanks, addBorderNode, maxRank, partition, time, notime, zipObject, minBy };
+declare const _default: {
+    addDummyNode: (g: IGraph, type: any, attrs: any, name: string) => string;
+    simplify: (g: IGraph) => any;
+    asNonCompoundGraph: (g: IGraph) => IGraph;
+    successorWeights: (g: IGraph) => any;
+    predecessorWeights: (g: IGraph) => any;
+    intersectRect: (rect: any, point: any) => {
+        x: any;
+        y: any;
+    };
+    buildLayerMatrix: (g: IGraph) => any;
+    normalizeRanks: (g: IGraph) => void;
+    removeEmptyRanks: (g: IGraph) => void;
+    addBorderNode: (g: IGraph, prefix: string, rank?: number | undefined, order?: number | undefined) => string;
+    maxRank: (g: IGraph) => number;
+    partition: (collection: any, fn: any) => {
+        lhs: any;
+        rhs: any;
+    };
+    time: (name: string, fn: () => unknown) => unknown;
+    notime: (name: string, fn: () => unknown) => unknown;
+    zipObject: (keys: string[], values: any) => any;
+    minBy: (array: any, func: (param: any) => number) => undefined;
+};
+export default _default;