@antv/layout 0.1.19-beta.4 → 0.1.21

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

@@ -0,0 +1,53 @@
+// "use strict";
+// var rankUtil = require("./util");
+// var longestPath = rankUtil.longestPathWithLayer;
+// var feasibleTree = require("./feasible-tree").feasibleTreeWithLayer;
+// var networkSimplex = require("./network-simplex");
+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.
+ */
+const rank = (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.
+const longestPathRanker = longestPath;
+const tightTreeRanker = (g) => {
+    longestPathWithLayer(g);
+    feasibleTree(g);
+};
+const networkSimplexRanker = (g) => {
+    networkSimplex(g);
+};
+export default rank;
+//# sourceMappingURL=index.js.map

package/es/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,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,MAAM,QAAQ,CAAC;AAC3D,OAAO,EAAE,qBAAqB,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACxE,OAAO,cAAc,MAAM,mBAAmB,CAAC;AAK/C;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE;IACzB,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,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;AAEF,eAAe,IAAI,CAAC"}

package/es/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/es/layout/dagre/src/rank/network-simplex.js

@@ -0,0 +1,207 @@
+import { feasibleTree } from './feasible-tree';
+import { slack, longestPath as initRank } from './util';
+import { minBy, simplify } from '../util';
+import graphlib from '../graphlib';
+const alg = graphlib.alg;
+const { preorder, postorder } = alg;
+/*
+ * 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.
+ */
+const networkSimplex = (g) => {
+    // tslint:disable-next-line
+    g = simplify(g);
+    initRank(g);
+    const t = feasibleTree(g);
+    initLowLimValues(t);
+    initCutValues(t, g);
+    let e;
+    let f;
+    while ((e = leaveEdge(t))) {
+        f = enterEdge(t, g, e);
+        exchangeEdges(t, g, e, f);
+    }
+};
+/*
+ * Initializes cut values for all edges in the tree.
+ */
+const initCutValues = (t, g) => {
+    let vs = postorder(t, t.nodes());
+    vs = vs.slice(0, vs.length - 1);
+    vs.forEach((v) => {
+        assignCutValue(t, g, v);
+    });
+};
+const assignCutValue = (t, g, child) => {
+    const childLab = t.node(child);
+    const 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.
+ */
+const calcCutValue = (t, g, child) => {
+    const childLab = t.node(child);
+    const parent = childLab.parent;
+    // True if the child is on the tail end of the edge in the directed graph
+    let childIsTail = true;
+    // The graph's view of the tree edge we're inspecting
+    let graphEdge = g.edge(child, parent);
+    // The accumulated cut value for the edge between this node and its parent
+    let cutValue = 0;
+    if (!graphEdge) {
+        childIsTail = false;
+        graphEdge = g.edge(parent, child);
+    }
+    cutValue = graphEdge.weight;
+    g.nodeEdges(child).forEach((e) => {
+        const isOutEdge = e.v === child;
+        const other = isOutEdge ? e.w : e.v;
+        if (other !== parent) {
+            const pointsToHead = isOutEdge === childIsTail;
+            const otherWeight = g.edge(e).weight;
+            cutValue += pointsToHead ? otherWeight : -otherWeight;
+            if (isTreeEdge(t, child, other)) {
+                const otherCutValue = t.edge(child, other).cutvalue;
+                cutValue += pointsToHead ? -otherCutValue : otherCutValue;
+            }
+        }
+    });
+    return cutValue;
+};
+const initLowLimValues = (tree, root) => {
+    if (root !== undefined) {
+        // tslint:disable-next-line
+        root = tree.nodes()[0];
+    }
+    dfsAssignLowLim(tree, {}, 1, root);
+};
+const dfsAssignLowLim = (tree, visited, nextLim, v, parent) => {
+    var _a;
+    const low = nextLim;
+    let useNextLim = nextLim;
+    const label = tree.node(v);
+    visited[v] = true;
+    (_a = tree.neighbors(v)) === null || _a === void 0 ? void 0 : _a.forEach((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;
+};
+const leaveEdge = (tree) => {
+    return tree.edges().find((e) => {
+        return tree.edge(e).cutvalue < 0;
+    });
+};
+const enterEdge = (t, g, edge) => {
+    let v = edge.v;
+    let 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;
+    }
+    const vLabel = t.node(v);
+    const wLabel = t.node(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.lim > wLabel.lim) {
+        tailLabel = wLabel;
+        flip = true;
+    }
+    const candidates = g.edges().filter((edge) => {
+        return flip === isDescendant(t, t.node(edge.v), tailLabel) &&
+            flip !== isDescendant(t, t.node(edge.w), tailLabel);
+    });
+    return minBy(candidates, (edge) => { return slack(g, edge); });
+};
+const exchangeEdges = (t, g, e, f) => {
+    const v = e.v;
+    const w = e.w;
+    t.removeEdge(v, w);
+    t.setEdge(f.v, f.w, {});
+    initLowLimValues(t);
+    initCutValues(t, g);
+    updateRanks(t, g);
+};
+const updateRanks = (t, g) => {
+    const root = t.nodes().find((v) => { return !g.node(v).parent; });
+    let vs = preorder(t, root);
+    vs = vs.slice(1);
+    vs.forEach((v) => {
+        const parent = t.node(v).parent;
+        let edge = g.edge(v, parent);
+        let 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.
+ */
+const isTreeEdge = (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.
+ */
+const isDescendant = (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;
+export default networkSimplex;
+//# sourceMappingURL=network-simplex.js.map

package/es/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,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,KAAK,EAAE,WAAW,IAAI,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC1C,OAAO,QAAQ,MAAM,aAAa,CAAC;AAGnC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC;AAEzB,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;AAGpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,EAAE;IACnC,2BAA2B;IAC3B,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAQ,CAAC;IACvB,QAAQ,CAAC,CAAC,CAAC,CAAC;IACZ,MAAM,CAAC,GAAG,YAAY,CAAC,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,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAC7C,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,CAAC,CAAS,EAAE,EAAE;QACvB,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,KAAa,EAAE,EAAE;IAC7D,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,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,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAAa,EAAE,EAAE;IAC3D,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,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,CAAC,CAAC,EAAE,EAAE;QAC/B,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC;QAChC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpC,IAAI,KAAK,KAAK,MAAM,EAAE;YACpB,MAAM,YAAY,GAAG,SAAS,KAAK,WAAW,CAAC;YAC/C,MAAM,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,MAAM,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,MAAM,gBAAgB,GAAG,CAAC,IAAY,EAAE,IAAa,EAAE,EAAE;IACvD,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,MAAM,eAAe,GAAG,CAAC,IAAY,EAAE,OAAY,EAAE,OAAe,EAAE,CAAS,EAAE,MAAe,EAAE,EAAE;;IAClG,MAAM,GAAG,GAAG,OAAO,CAAC;IACpB,IAAI,UAAU,GAAG,OAAO,CAAC;IACzB,MAAM,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,CAAC,CAAM,EAAE,EAAE;QACpC,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,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,EAAE;IACjC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,IAAS,EAAE,EAAE;IACpD,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,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,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,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAC3C,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,KAAK,CAAC,UAAU,EAAE,CAAC,IAAI,EAAE,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAM,EAAE,CAAM,EAAE,EAAE;IAC7D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,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,MAAM,WAAW,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAC3C,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAE,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,CAAC,CAAS,EAAE,EAAE;QACvB,MAAM,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,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;IACxD,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAAG,CAAC,IAAY,EAAE,MAAW,EAAE,SAAc,EAAE,EAAE;IACjE,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,eAAe,cAAc,CAAC"}

package/es/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/es/layout/dagre/src/rank/util.js

@@ -0,0 +1,109 @@
+/*
+ * 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.
+ */
+const longestPath = (g) => {
+    const visited = {};
+    const dfs = (v) => {
+        var _a;
+        const label = g.node(v);
+        if (visited.hasOwnProperty(v)) {
+            return label.rank;
+        }
+        visited[v] = true;
+        const lengths = (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.map((e) => {
+            return (dfs(e.w) - g.edge(e).minlen) || Infinity;
+        });
+        let rank = Math.min(...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((source) => dfs(source));
+};
+const longestPathWithLayer = (g) => {
+    // 用longest path，找出最深的点
+    const visited = {};
+    let minRank = 0;
+    const dfs = (v) => {
+        var _a;
+        const label = g.node(v);
+        if (visited.hasOwnProperty(v)) {
+            return label.rank;
+        }
+        visited[v] = true;
+        const lengths = (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.map((e) => {
+            return (dfs(e.w) - g.edge(e).minlen) || Infinity;
+        });
+        let rank = Math.min(...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((source) => dfs(source));
+    minRank += 1; // NOTE: 最小的层级是dummy root，+1
+    // forward一遍，赋值层级
+    const dfsForward = (v, nextRank) => {
+        var _a;
+        const label = g.node(v);
+        const 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((e) => {
+            dfsForward(e.w, currRank + g.edge(e).minlen);
+        });
+    };
+    // 指定层级的，更新下游
+    g.nodes().forEach((n) => {
+        const label = g.node(n);
+        if (!isNaN(label.layer)) {
+            dfsForward(n, 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.
+ */
+const slack = (g, e) => {
+    return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;
+};
+export { longestPath, longestPathWithLayer, slack, };
+export default {
+    longestPath,
+    longestPathWithLayer,
+    slack,
+};
+//# sourceMappingURL=util.js.map

package/es/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,MAAM,WAAW,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC/B,MAAM,OAAO,GAAQ,EAAE,CAAC;IAExB,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;;QACxB,MAAM,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,MAAM,OAAO,GAAG,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE;YAC5C,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,CAAC,GAAG,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,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,MAAa,CAAC,CAAC,CAAC;AACtD,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAQ,EAAE,EAAE;IACxC,uBAAuB;IACvB,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;;QACxB,MAAM,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,MAAM,OAAO,GAAG,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACvC,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,CAAC,GAAG,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,CAAC,MAAW,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAElD,OAAO,IAAI,CAAC,CAAC,CAAC,4BAA4B;IAE1C,iBAAiB;IACjB,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,QAAgB,EAAE,EAAE;;QACjD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExB,MAAM,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,CAAC,CAAC,EAAE,EAAE;YACvB,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,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,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;AAEF;;;GAGG;AACH,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAE,CAAM,EAAE,EAAE;IACjC,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;AAEF,OAAO,EACL,WAAW,EACX,oBAAoB,EACpB,KAAK,GACN,CAAC;AAEF,eAAe;IACb,WAAW;IACX,oBAAoB;IACpB,KAAK;CACN,CAAC"}

package/es/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;