@antv/layout 1.2.0 → 1.2.1

package/lib/dagre/rank/index.js

@@ -0,0 +1,48 @@
+import { longestPath, longestPathWithLayer } from "./util";
+import { feasibleTreeWithLayer as feasibleTree } from "./feasible-tree";
+import { networkSimplex } from "./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.
+ */
+export var rank = function (g, ranker) {
+    switch (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 = longestPath;
+var tightTreeRanker = function (g) {
+    longestPathWithLayer(g);
+    feasibleTree(g);
+};
+var networkSimplexRanker = function (g) {
+    networkSimplex(g);
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/dagre/rank/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,MAAM,QAAQ,CAAC;AAC3D,OAAO,EAAE,qBAAqB,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAEnD;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,IAAM,IAAI,GAAG,UAClB,CAAS,EACT,MAAyD;IAEzD,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,IAAM,iBAAiB,GAAG,WAAW,CAAC;AAEtC,IAAM,eAAe,GAAG,UAAC,CAAS;IAChC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACxB,YAAY,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC;AAEF,IAAM,oBAAoB,GAAG,UAAC,CAAS;IACrC,cAAc,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC"}

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

@@ -0,0 +1,232 @@
+import { feasibleTree } from "./feasible-tree";
+import { slack, longestPath as initRank } from "./util";
+import { dfs, minBy, simplify } 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.
+ *
+ * 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.
+ */
+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);
+    }
+};
+/*
+ * Initializes cut values for all edges in the tree.
+ */
+export var initCutValues = function (t, g) {
+    var 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) {
+        assignCutValue(t, g, v);
+    });
+};
+var assignCutValue = function (t, g, child) {
+    var childLab = t.getNode(child);
+    var 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);
+};
+/*
+ * 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;
+    // 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
+        .getRelatedEdges(child, "out")
+        .find(function (e) { return e.target === parent; });
+    // The accumulated cut value for the edge between this node and its parent
+    var cutValue = 0;
+    if (!graphEdge) {
+        childIsTail = false;
+        graphEdge = g
+            .getRelatedEdges(parent, "out")
+            .find(function (e) { return 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;
+        if (other !== parent) {
+            var pointsToHead = isOutEdge === childIsTail;
+            var 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
+                    .cutvalue;
+                cutValue += pointsToHead ? -otherCutValue : otherCutValue;
+            }
+        }
+    });
+    return cutValue;
+};
+export var initLowLimValues = function (tree, root) {
+    if (root === void 0) { root = tree.getAllNodes()[0].id; }
+    dfsAssignLowLim(tree, {}, 1, root);
+};
+var dfsAssignLowLim = function (tree, visited, nextLim, v, parent) {
+    var _a;
+    var low = nextLim;
+    var useNextLim = nextLim;
+    var label = tree.getNode(v);
+    visited[v] = true;
+    (_a = tree.getNeighbors(v)) === null || _a === void 0 ? void 0 : _a.forEach(function (w) {
+        if (!visited[w.id]) {
+            useNextLim = dfsAssignLowLim(tree, visited, useNextLim, w.id, v);
+        }
+    });
+    label.data.low = low;
+    label.data.lim = useNextLim++;
+    if (parent) {
+        label.data.parent = parent;
+    }
+    else {
+        // TODO should be able to remove this when we incrementally update low lim
+        delete label.data.parent;
+    }
+    return useNextLim;
+};
+export var leaveEdge = function (tree) {
+    return tree.getAllEdges().find(function (e) {
+        return e.data.cutvalue < 0;
+    });
+};
+export var enterEdge = function (t, g, edge) {
+    var v = edge.source;
+    var 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; })) {
+        v = edge.target;
+        w = edge.source;
+    }
+    var vLabel = t.getNode(v);
+    var wLabel = t.getNode(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.data.lim > wLabel.data.lim) {
+        tailLabel = wLabel;
+        flip = true;
+    }
+    var candidates = g.getAllEdges().filter(function (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);
+    });
+};
+/**
+ *
+ * @param t
+ * @param g
+ * @param e edge to remove
+ * @param f edge to add
+ */
+export var exchangeEdges = function (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; });
+    if (existed) {
+        t.removeEdge(existed.id);
+    }
+    t.addEdge({
+        id: "e" + Math.random(),
+        source: f.source,
+        target: f.target,
+        data: {},
+    });
+    initLowLimValues(t);
+    initCutValues(t, g);
+    updateRanks(t, g);
+};
+var updateRanks = function (t, g) {
+    var root = t.getAllNodes().find(function (v) {
+        return !v.data.parent;
+    });
+    var 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; });
+        // let edge = g.edgeFromArgs(v, parent);
+        var flipped = false;
+        if (!edge && g.hasNode(parent)) {
+            // edge = g.edgeFromArgs(parent, v)!;
+            edge = g.getRelatedEdges(parent, "out").find(function (e) { return e.target === v; });
+            flipped = true;
+        }
+        g.getNode(v).data.rank =
+            ((g.hasNode(parent) && g.getNode(parent).data.rank) || 0) +
+                (flipped ? edge === null || edge === void 0 ? void 0 : edge.data.minlen : -(edge === null || edge === void 0 ? void 0 : edge.data.minlen));
+    });
+};
+/*
+ * Returns true if the edge is in the tree.
+ */
+var isTreeEdge = function (tree, u, v) {
+    // FIXME: use undirected edge?
+    return tree
+        .getRelatedEdges(u, "both")
+        .find(function (e) { return 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) {
+    return (rootLabel.data.low <= vLabel.data.lim &&
+        vLabel.data.lim <= rootLabel.data.lim);
+};
+//# sourceMappingURL=network-simplex.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"network-simplex.js","sourceRoot":"","sources":["../../../src/dagre/rank/network-simplex.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,KAAK,EAAE,WAAW,IAAI,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACxD,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAE/C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,CAAC,IAAM,cAAc,GAAG,UAAC,EAAU;IACvC,IAAM,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IACvB,QAAQ,CAAC,CAAC,CAAC,CAAC;IACZ,IAAM,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,IAAM,aAAa,GAAG,UAAC,CAAS,EAAE,CAAS;IAChD,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,UAAC,CAAK;QACf,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,KAAS;IACrD,IAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC;IACnC,IAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAa,CAAC;IAE3C,8BAA8B;IAC9B,IAAM,IAAI,GAAG,CAAC;SACX,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;SAC9B,IAAI,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,EAA1C,CAA0C,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,IAAM,YAAY,GAAG,UAAC,CAAS,EAAE,CAAS,EAAE,KAAS;IAC1D,IAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC;IACnC,IAAM,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,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,KAAK,MAAM,EAAnB,CAAmB,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,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,KAAK,KAAK,EAAlB,CAAkB,CAAE,CAAC;KACrC;IAED,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,MAAO,CAAC;IAElC,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;QACzC,IAAM,SAAS,GAAG,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC;QACrC,IAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAE9C,IAAI,KAAK,KAAK,MAAM,EAAE;YACpB,IAAM,YAAY,GAAG,SAAS,KAAK,WAAW,CAAC;YAC/C,IAAM,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,IAAM,aAAa,GAAG,CAAC;qBACpB,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;qBAC9B,IAAI,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,EAAxC,CAAwC,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,IAAM,gBAAgB,GAAG,UAC9B,IAAY,EACZ,IAAmC;IAAnC,qBAAA,EAAA,OAAW,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;IAEnC,eAAe,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UACtB,IAAY,EACZ,OAA4B,EAC5B,OAAe,EACf,CAAK,EACL,MAAW;;IAEX,IAAM,GAAG,GAAG,OAAO,CAAC;IACpB,IAAI,UAAU,GAAG,OAAO,CAAC;IACzB,IAAM,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,UAAC,CAAC;QAC9B,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,IAAM,SAAS,GAAG,UAAC,IAAY;IACpC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,UAAC,CAAC;QAC/B,OAAO,CAAC,CAAC,IAAI,CAAC,QAAS,GAAG,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,SAAS,GAAG,UAAC,CAAS,EAAE,CAAS,EAAE,IAAoB;IAClE,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,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,KAAK,CAAC,EAAd,CAAc,CAAC,EAAE;QAC5D,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAChB,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;KACjB;IAED,IAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAC7B,IAAM,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,IAAM,UAAU,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,UAAC,IAAI;QAC7C,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,UAAC,IAAI;QAC5B,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,IAAM,aAAa,GAAG,UAC3B,CAAS,EACT,CAAS,EACT,CAAiB,EACjB,CAAiB;IAEjB,8BAA8B;IAC9B,IAAM,OAAO,GAAG,CAAC;SACd,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC;SACjC,IAAI,CAAC,UAAC,IAAI,IAAK,OAAA,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAApD,CAAoD,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,MAAI,IAAI,CAAC,MAAM,EAAI;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,IAAM,WAAW,GAAG,UAAC,CAAS,EAAE,CAAS;IACvC,IAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,UAAC,CAAC;QAClC,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,UAAC,CAAK;QACf,IAAM,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,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,KAAK,MAAM,EAAnB,CAAmB,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,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,KAAK,CAAC,EAAd,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,IAAM,UAAU,GAAG,UAAC,IAAY,EAAE,CAAK,EAAE,CAAK;IAC5C,8BAA8B;IAC9B,OAAO,IAAI;SACR,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC;SAC1B,IAAI,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAhC,CAAgC,CAAC,CAAC;AACnD,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,YAAY,GAAG,UAAC,MAAsB,EAAE,SAAyB;IACrE,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/rank/util.js

@@ -0,0 +1,138 @@
+/*
+ * 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.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;
+            if (r) {
+                if (rank === undefined || r < rank) {
+                    rank = r;
+                }
+            }
+        });
+        if (!rank) {
+            rank = 0;
+        }
+        label.data.rank = rank;
+        return rank;
+    };
+    g.getAllNodes()
+        .filter(function (n) { return g.getRelatedEdges(n.id, "in").length === 0; })
+        .forEach(function (source) { return dfs(source.id); });
+};
+var longestPathWithLayer = function (g) {
+    // 用longest path，找出最深的点
+    var visited = {};
+    var minRank;
+    var dfs = function (v) {
+        var _a;
+        var 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;
+            if (r) {
+                if (rank === undefined || r < rank) {
+                    rank = r;
+                }
+            }
+        });
+        if (!rank) {
+            rank = 0;
+        }
+        if (minRank === undefined || rank < minRank) {
+            minRank = rank;
+        }
+        label.data.rank = rank;
+        return rank;
+    };
+    g.getAllNodes()
+        .filter(function (n) { return g.getRelatedEdges(n.id, "in").length === 0; })
+        .forEach(function (source) {
+        if (source)
+            dfs(source.id);
+    });
+    if (minRank === undefined) {
+        minRank = 0;
+    }
+    // minRank += 1; // NOTE: 最小的层级是dummy root，+1
+    // forward一遍，赋值层级
+    var forwardVisited = {};
+    var dfsForward = function (v, nextRank) {
+        var _a;
+        var label = g.getNode(v);
+        var currRank = !isNaN(label.data.layer) ? label.data.layer : nextRank;
+        // 没有指定，取最大值
+        if (label.data.rank === undefined || label.data.rank < currRank) {
+            label.data.rank = currRank;
+        }
+        if (forwardVisited[v])
+            return;
+        forwardVisited[v] = true;
+        // DFS遍历子节点
+        (_a = g.getRelatedEdges(v, "out")) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
+            dfsForward(e.target, currRank + e.data.minlen);
+        });
+    };
+    // 指定层级的，更新下游
+    g.getAllNodes().forEach(function (n) {
+        var label = n.data;
+        if (!label)
+            return;
+        if (!isNaN(label.layer)) {
+            dfsForward(n.id, label.layer); // 默认的dummy root所在层的rank是-1
+        }
+        else {
+            label.rank -= minRank;
+        }
+    });
+};
+/*
+ * 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.getNode(e.target).data.rank -
+        g.getNode(e.source).data.rank -
+        e.data.minlen);
+};
+export { longestPath, longestPathWithLayer, slack };
+//# sourceMappingURL=util.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../../src/dagre/rank/util.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,IAAM,WAAW,GAAG,UAAC,CAAQ;IAC3B,IAAM,OAAO,GAAwB,EAAE,CAAC;IAExC,IAAM,GAAG,GAAG,UAAC,CAAK;;QAChB,IAAM,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,UAAC,CAAC;YACrC,IAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC5B,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;YAC9B,IAAM,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,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAA1C,CAA0C,CAAC;SACzD,OAAO,CAAC,UAAC,MAAM,IAAK,OAAA,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAd,CAAc,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF,IAAM,oBAAoB,GAAG,UAAC,CAAQ;IACpC,uBAAuB;IACvB,IAAM,OAAO,GAAwB,EAAE,CAAC;IACxC,IAAI,OAAe,CAAC;IAEpB,IAAM,GAAG,GAAG,UAAC,CAAK;;QAChB,IAAM,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,UAAC,CAAC;YACrC,IAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC5B,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;YAC9B,IAAM,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,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAA1C,CAA0C,CAAC;SACzD,OAAO,CAAC,UAAC,MAAM;QACd,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,IAAM,cAAc,GAA4B,EAAE,CAAC;IACnD,IAAM,UAAU,GAAG,UAAC,CAAK,EAAE,QAAgB;;QACzC,IAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAE5B,IAAM,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,UAAC,CAAC;YACrC,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,UAAC,CAAC;QACxB,IAAM,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,IAAM,KAAK,GAAG,UAAC,CAAQ,EAAE,CAAiB;IACxC,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"}