@antv/layout 2.0.0 → 2.0.1

package/esm/algorithm/antv-dagre/rank/index.js

@@ -0,0 +1,51 @@
+import { feasibleTreeWithLayer } from './feasible-tree.js';
+import { networkSimplex } from './network-simplex.js';
+import { longestPathWithLayer, longestPath } from './util.js';
+
+/*
+ * 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, 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.
+const longestPathRanker = longestPath;
+const tightTreeRanker = (g) => {
+    longestPathWithLayer(g);
+    feasibleTreeWithLayer(g);
+};
+const networkSimplexRanker = (g) => {
+    networkSimplex(g);
+};
+
+export { rank };
+//# sourceMappingURL=index.js.map

package/esm/algorithm/antv-dagre/rank/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../src/algorithm/antv-dagre/rank/src/algorithm/antv-dagre/rank/index.ts"],"sourcesContent":[null],"names":["feasibleTree"],"mappings":";;;;AAKA;;;;;;;;;;;;;;;;;;AAkBG;MACU,IAAI,GAAG,CAClB,CAAa,EACb,MAAyD,KACvD;AACF,IAAA,QAAQ,MAAM;AACZ,QAAA,KAAK,iBAAiB;YACpB,oBAAoB,CAAC,CAAC,CAAC;YACvB;AACF,QAAA,KAAK,YAAY;YACf,eAAe,CAAC,CAAC,CAAC;YAClB;AACF,QAAA,KAAK,cAAc;YACjB,iBAAiB,CAAC,CAAC,CAAC;YACpB;;AAEF,QAAA;YACE,eAAe,CAAC,CAAC,CAAC;AACrB;AACH;AAEA;AACA,MAAM,iBAAiB,GAAG,WAAW;AAErC,MAAM,eAAe,GAAG,CAAC,CAAa,KAAI;IACxC,oBAAoB,CAAC,CAAC,CAAC;IACvBA,qBAAY,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,MAAM,oBAAoB,GAAG,CAAC,CAAa,KAAI;IAC7C,cAAc,CAAC,CAAC,CAAC;AACnB,CAAC;;;;"}

package/esm/algorithm/antv-dagre/rank/network-simplex.js

@@ -0,0 +1,234 @@
+import { simplify, dfs, minBy } from '../util.js';
+import { feasibleTree } from './feasible-tree.js';
+import { longestPath, slack } from './util.js';
+
+/*
+ * 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 = (og) => {
+    const g = simplify(og);
+    longestPath(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 = dfs(t, t.getAllNodes(), 'post');
+    vs = vs.slice(0, (vs === null || vs === void 0 ? void 0 : vs.length) - 1);
+    vs.forEach((v) => {
+        assignCutValue(t, g, v);
+    });
+};
+const assignCutValue = (t, g, child) => {
+    const childLab = t.getNode(child);
+    const parent = childLab.data.parent;
+    // FIXME: use undirected edge?
+    const edge = t
+        .getRelatedEdges(child, 'both')
+        .find((e) => e.target === parent || e.source === parent);
+    edge.data.cutvalue = calcCutValue(t, g, child);
+};
+/*
+ * Given the tight tree, its graph, and a child in the graph calculate and
+ * return the cut value for the edge between the child and its parent.
+ */
+const calcCutValue = (t, g, child) => {
+    const childLab = t.getNode(child);
+    const parent = childLab.data.parent;
+    // True if the child is on the tail end of the edge in the directed graph
+    let childIsTail = true;
+    // The graph's view of the tree edge we're inspecting
+    let graphEdge = g
+        .getRelatedEdges(child, 'out')
+        .find((e) => e.target === parent);
+    // The accumulated cut value for the edge between this node and its parent
+    let cutValue = 0;
+    if (!graphEdge) {
+        childIsTail = false;
+        graphEdge = g
+            .getRelatedEdges(parent, 'out')
+            .find((e) => e.target === child);
+    }
+    cutValue = graphEdge.data.weight;
+    g.getRelatedEdges(child, 'both').forEach((e) => {
+        const isOutEdge = e.source === child;
+        const other = isOutEdge ? e.target : e.source;
+        if (other !== parent) {
+            const pointsToHead = isOutEdge === childIsTail;
+            const otherWeight = e.data.weight;
+            cutValue += pointsToHead ? otherWeight : -otherWeight;
+            if (isTreeEdge(t, child, other)) {
+                // FIXME: use undirected edge?
+                const otherCutValue = t
+                    .getRelatedEdges(child, 'both')
+                    .find((e) => e.source === other || e.target === other).data
+                    .cutvalue;
+                cutValue += pointsToHead ? -otherCutValue : otherCutValue;
+            }
+        }
+    });
+    return cutValue;
+};
+const initLowLimValues = (tree, root = tree.getAllNodes()[0].id) => {
+    dfsAssignLowLim(tree, {}, 1, root);
+};
+const dfsAssignLowLim = (tree, visited, nextLim, v, parent) => {
+    var _a;
+    const low = nextLim;
+    let useNextLim = nextLim;
+    const label = tree.getNode(v);
+    visited[v] = true;
+    (_a = tree.getNeighbors(v)) === null || _a === void 0 ? void 0 : _a.forEach((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;
+};
+const leaveEdge = (tree) => {
+    return tree.getAllEdges().find((e) => {
+        return e.data.cutvalue < 0;
+    });
+};
+const enterEdge = (t, g, edge) => {
+    let v = edge.source;
+    let w = edge.target;
+    // For the rest of this function we assume that v is the tail and w is the
+    // head, so if we don't have this edge in the graph we should flip it to
+    // match the correct orientation.
+    if (!g.getRelatedEdges(v, 'out').find((e) => e.target === w)) {
+        v = edge.target;
+        w = edge.source;
+    }
+    const vLabel = t.getNode(v);
+    const wLabel = t.getNode(w);
+    let tailLabel = vLabel;
+    let flip = false;
+    // If the root is in the tail of the edge then we need to flip the logic that
+    // checks for the head and tail nodes in the candidates function below.
+    if (vLabel.data.lim > wLabel.data.lim) {
+        tailLabel = wLabel;
+        flip = true;
+    }
+    const candidates = g.getAllEdges().filter((edge) => {
+        return (flip === isDescendant(t.getNode(edge.source), tailLabel) &&
+            flip !== isDescendant(t.getNode(edge.target), tailLabel));
+    });
+    return minBy(candidates, (edge) => {
+        return slack(g, edge);
+    });
+};
+/**
+ *
+ * @param t
+ * @param g
+ * @param e edge to remove
+ * @param f edge to add
+ */
+const exchangeEdges = (t, g, e, f) => {
+    // FIXME: use undirected edge?
+    const existed = t
+        .getRelatedEdges(e.source, 'both')
+        .find((edge) => edge.source === e.target || edge.target === e.target);
+    if (existed) {
+        t.removeEdge(existed.id);
+    }
+    t.addEdge({
+        id: `e${Math.random()}`,
+        source: f.source,
+        target: f.target,
+        data: {},
+    });
+    initLowLimValues(t);
+    initCutValues(t, g);
+    updateRanks(t, g);
+};
+const updateRanks = (t, g) => {
+    const root = t.getAllNodes().find((v) => {
+        return !v.data.parent;
+    });
+    let vs = dfs(t, root, 'pre');
+    vs = vs.slice(1);
+    vs.forEach((v) => {
+        const parent = t.getNode(v).data.parent;
+        let edge = g.getRelatedEdges(v, 'out').find((e) => e.target === parent);
+        // let edge = g.edgeFromArgs(v, parent);
+        let flipped = false;
+        if (!edge && g.hasNode(parent)) {
+            // edge = g.edgeFromArgs(parent, v)!;
+            edge = g.getRelatedEdges(parent, 'out').find((e) => 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.
+ */
+const isTreeEdge = (tree, u, v) => {
+    // FIXME: use undirected edge?
+    return tree
+        .getRelatedEdges(u, 'both')
+        .find((e) => e.source === v || e.target === v);
+};
+/*
+ * Returns true if the specified node is descendant of the root node per the
+ * assigned low and lim attributes in the tree.
+ */
+const isDescendant = (vLabel, rootLabel) => {
+    return (rootLabel.data.low <= vLabel.data.lim &&
+        vLabel.data.lim <= rootLabel.data.lim);
+};
+
+export { calcCutValue, enterEdge, exchangeEdges, initCutValues, initLowLimValues, leaveEdge, networkSimplex };
+//# sourceMappingURL=network-simplex.js.map

package/esm/algorithm/antv-dagre/rank/network-simplex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"network-simplex.js","sources":["../../../../src/algorithm/antv-dagre/rank/src/algorithm/antv-dagre/rank/network-simplex.ts"],"sourcesContent":[null],"names":["initRank"],"mappings":";;;;AAMA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCG;AACI,MAAM,cAAc,GAAG,CAAC,EAAc,KAAI;AAC/C,IAAA,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC;IACtBA,WAAQ,CAAC,CAAC,CAAC;AACX,IAAA,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IACzB,gBAAgB,CAAC,CAAC,CAAC;AACnB,IAAA,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;AAEnB,IAAA,IAAI,CAAuB;AAC3B,IAAA,IAAI,CAAW;IACf,QAAQ,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG;QACzB,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACtB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAC1B,IAAA;AACH;AAEA;;AAEG;MACU,aAAa,GAAG,CAAC,CAAa,EAAE,CAAa,KAAI;AAC5D,IAAA,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE,MAAa,CAAC;AAC/C,IAAA,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAA,EAAE,KAAA,IAAA,IAAF,EAAE,uBAAF,EAAE,CAAE,MAAM,IAAG,CAAC,CAAC;AAChC,IAAA,EAAE,CAAC,OAAO,CAAC,CAAC,CAAK,KAAI;AACnB,QAAA,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACzB,IAAA,CAAC,CAAC;AACJ;AAEA,MAAM,cAAc,GAAG,CAAC,CAAa,EAAE,CAAa,EAAE,KAAS,KAAI;IACjE,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAE;AAClC,IAAA,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAa;;IAG1C,MAAM,IAAI,GAAG;AACV,SAAA,eAAe,CAAC,KAAK,EAAE,MAAM;AAC7B,SAAA,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAAE;AAC3D,IAAA,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;AAChD,CAAC;AAED;;;AAGG;AACI,MAAM,YAAY,GAAG,CAAC,CAAa,EAAE,CAAa,EAAE,KAAS,KAAI;IACtE,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAE;AAClC,IAAA,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAY;;IAEzC,IAAI,WAAW,GAAG,IAAI;;IAGtB,IAAI,SAAS,GAAG;AACb,SAAA,eAAe,CAAC,KAAK,EAAE,KAAK;AAC5B,SAAA,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,MAAM,CAAE;;IAEpC,IAAI,QAAQ,GAAG,CAAC;IAEhB,IAAI,CAAC,SAAS,EAAE;QACd,WAAW,GAAG,KAAK;AACnB,QAAA,SAAS,GAAG;AACT,aAAA,eAAe,CAAC,MAAM,EAAE,KAAK;AAC7B,aAAA,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,KAAK,CAAE;AACpC,IAAA;AAED,IAAA,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,MAAO;AAEjC,IAAA,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC7C,QAAA,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,KAAK,KAAK;AACpC,QAAA,MAAM,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;QAE7C,IAAI,KAAK,KAAK,MAAM,EAAE;AACpB,YAAA,MAAM,YAAY,GAAG,SAAS,KAAK,WAAW;AAC9C,YAAA,MAAM,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO;YAElC,QAAQ,IAAI,YAAY,GAAG,WAAW,GAAG,CAAC,WAAW;YACrD,IAAI,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE;;gBAE/B,MAAM,aAAa,GAAG;AACnB,qBAAA,eAAe,CAAC,KAAK,EAAE,MAAM;AAC7B,qBAAA,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,CAAE,CAAC;AACvD,qBAAA,QAAS;gBACZ,QAAQ,IAAI,YAAY,GAAG,CAAC,aAAa,GAAG,aAAa;AAC1D,YAAA;AACF,QAAA;AACH,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,QAAQ;AACjB;AAEO,MAAM,gBAAgB,GAAG,CAC9B,IAAgB,EAChB,IAAA,GAAW,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KACjC;IACF,eAAe,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC;AACpC;AAEA,MAAM,eAAe,GAAG,CACtB,IAAgB,EAChB,OAA4B,EAC5B,OAAe,EACf,CAAK,EACL,MAAW,KACT;;IACF,MAAM,GAAG,GAAG,OAAO;IACnB,IAAI,UAAU,GAAG,OAAO;IACxB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE;AAE9B,IAAA,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;AACjB,IAAA,CAAA,EAAA,GAAA,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;AAClC,QAAA,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;AAClB,YAAA,UAAU,GAAG,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACjE,QAAA;AACH,IAAA,CAAC,CAAC;AAEF,IAAA,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG;AACpB,IAAA,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,UAAU,EAAE;AAC7B,IAAA,IAAI,MAAM,EAAE;AACV,QAAA,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM;AAC3B,IAAA;AAAM,SAAA;;AAEL,QAAA,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM;AACzB,IAAA;AAED,IAAA,OAAO,UAAU;AACnB,CAAC;AAEM,MAAM,SAAS,GAAG,CAAC,IAAgB,KAAI;IAC5C,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAI;AACnC,QAAA,OAAO,CAAC,CAAC,IAAI,CAAC,QAAS,GAAG,CAAC;AAC7B,IAAA,CAAC,CAAC;AACJ;AAEO,MAAM,SAAS,GAAG,CAAC,CAAa,EAAE,CAAa,EAAE,IAAc,KAAI;AACxE,IAAA,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM;AACnB,IAAA,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM;;;;IAKnB,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE;AAC5D,QAAA,CAAC,GAAG,IAAI,CAAC,MAAM;AACf,QAAA,CAAC,GAAG,IAAI,CAAC,MAAM;AAChB,IAAA;IAED,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;IAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;IAC5B,IAAI,SAAS,GAAG,MAAM;IACtB,IAAI,IAAI,GAAG,KAAK;;;IAIhB,IAAI,MAAM,CAAC,IAAI,CAAC,GAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAI,EAAE;QACvC,SAAS,GAAG,MAAM;QAClB,IAAI,GAAG,IAAI;AACZ,IAAA;AAED,IAAA,MAAM,UAAU,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,KAAI;AACjD,QAAA,QACE,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC;AACxD,YAAA,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC;AAE5D,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,KAAK,CAAC,UAAU,EAAE,CAAC,IAAI,KAAI;AAChC,QAAA,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;AACvB,IAAA,CAAC,CAAC;AACJ;AAEA;;;;;;AAMG;AACI,MAAM,aAAa,GAAG,CAC3B,CAAa,EACb,CAAa,EACb,CAAW,EACX,CAAW,KACT;;IAEF,MAAM,OAAO,GAAG;AACb,SAAA,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM;SAChC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC;AACvE,IAAA,IAAI,OAAO,EAAE;AACX,QAAA,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;AACzB,IAAA;IAED,CAAC,CAAC,OAAO,CAAC;AACR,QAAA,EAAE,EAAE,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;QACvB,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,MAAM,EAAE,CAAC,CAAC,MAAM;AAChB,QAAA,IAAI,EAAE,EAAE;AACT,KAAA,CAAC;IAEF,gBAAgB,CAAC,CAAC,CAAC;AACnB,IAAA,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;AACnB,IAAA,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC;AACnB;AAEA,MAAM,WAAW,GAAG,CAAC,CAAa,EAAE,CAAa,KAAI;AACnD,IAAA,MAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAI;AACtC,QAAA,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;AACvB,IAAA,CAAC,CAAE;AAEH,IAAA,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAY,CAAC;AACnC,IAAA,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;AAChB,IAAA,EAAE,CAAC,OAAO,CAAC,CAAC,CAAK,KAAI;AACnB,QAAA,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAY;QAC7C,IAAI,IAAI,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC;;QAEvE,IAAI,OAAO,GAAG,KAAK;QAEnB,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;;YAE9B,IAAI,GAAG,CAAC,CAAC,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;YACnE,OAAO,GAAG,IAAI;AACf,QAAA;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,KAAK,CAAC;AACzD,iBAAC,OAAO,GAAG,IAAI,KAAA,IAAA,IAAJ,IAAI,KAAA,MAAA,GAAA,MAAA,GAAJ,IAAI,CAAE,IAAI,CAAC,MAAO,GAAG,EAAC,IAAI,KAAA,IAAA,IAAJ,IAAI,KAAA,MAAA,GAAA,MAAA,GAAJ,IAAI,CAAE,IAAI,CAAC,MAAO,CAAA,CAAC;AACxD,IAAA,CAAC,CAAC;AACJ,CAAC;AAED;;AAEG;AACH,MAAM,UAAU,GAAG,CAAC,IAAgB,EAAE,CAAK,EAAE,CAAK,KAAI;;AAEpD,IAAA,OAAO;AACJ,SAAA,eAAe,CAAC,CAAC,EAAE,MAAM;AACzB,SAAA,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;AAClD,CAAC;AAED;;;AAGG;AACH,MAAM,YAAY,GAAG,CAAC,MAAgB,EAAE,SAAmB,KAAI;IAC7D,QACE,SAAS,CAAC,IAAI,CAAC,GAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAI;QACvC,MAAM,CAAC,IAAI,CAAC,GAAI,IAAI,SAAS,CAAC,IAAI,CAAC,GAAI;AAE3C,CAAC;;;;"}

package/esm/algorithm/antv-dagre/rank/util.js

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

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sources":["../../../../src/algorithm/antv-dagre/rank/src/algorithm/antv-dagre/rank/util.ts"],"sourcesContent":[null],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;AAoBG;AACH,MAAM,WAAW,GAAG,CAAC,CAAa,KAAI;IACpC,MAAM,OAAO,GAAwB,EAAE;AAEvC,IAAA,MAAM,GAAG,GAAG,CAAC,CAAK,KAAI;;QACpB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;AAC3B,QAAA,IAAI,CAAC,KAAK;AAAE,YAAA,OAAO,CAAC;AACpB,QAAA,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;AACd,YAAA,OAAO,KAAK,CAAC,IAAI,CAAC,IAAK;AACxB,QAAA;AACD,QAAA,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;AAEjB,QAAA,IAAI,IAAY;AAEhB,QAAA,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;YACzC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;AAC3B,YAAA,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO;AAC7B,YAAA,MAAM,CAAC,GAAG,KAAK,GAAG,MAAM;AACxB,YAAA,IAAI,CAAC,EAAE;AACL,gBAAA,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,IAAI,EAAE;oBAClC,IAAI,GAAG,CAAC;AACT,gBAAA;AACF,YAAA;AACH,QAAA,CAAC,CAAC;QAEF,IAAI,CAAC,IAAK,EAAE;YACV,IAAI,GAAG,CAAC;AACT,QAAA;AAED,QAAA,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI;AACtB,QAAA,OAAO,IAAI;AACb,IAAA,CAAC;IAED,CAAC,CAAC,WAAW;SACV,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;AACxD,SAAA,OAAO,CAAC,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AACxC;AAEA,MAAM,oBAAoB,GAAG,CAAC,CAAa,KAAI;;IAE7C,MAAM,OAAO,GAAwB,EAAE;AACvC,IAAA,IAAI,OAAe;AAEnB,IAAA,MAAM,GAAG,GAAG,CAAC,CAAK,KAAI;;QACpB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;AAC3B,QAAA,IAAI,CAAC,KAAK;AAAE,YAAA,OAAO,CAAC;AACpB,QAAA,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;AACd,YAAA,OAAO,KAAK,CAAC,IAAI,CAAC,IAAK;AACxB,QAAA;AACD,QAAA,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;AAEjB,QAAA,IAAI,IAAY;AAEhB,QAAA,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;YACzC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;AAC3B,YAAA,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO;AAC7B,YAAA,MAAM,CAAC,GAAG,KAAK,GAAG,MAAM;AACxB,YAAA,IAAI,CAAC,EAAE;AACL,gBAAA,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,IAAI,EAAE;oBAClC,IAAI,GAAG,CAAC;AACT,gBAAA;AACF,YAAA;AACH,QAAA,CAAC,CAAC;QAEF,IAAI,CAAC,IAAK,EAAE;YACV,IAAI,GAAG,CAAC;AACT,QAAA;AAED,QAAA,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,GAAG,OAAO,EAAE;YAC3C,OAAO,GAAG,IAAI;AACf,QAAA;AAED,QAAA,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI;AACtB,QAAA,OAAO,IAAI;AACb,IAAA,CAAC;IAED,CAAC,CAAC,WAAW;SACV,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;AACxD,SAAA,OAAO,CAAC,CAAC,MAAM,KAAI;AAClB,QAAA,IAAI,MAAM;AAAE,YAAA,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;AAC5B,IAAA,CAAC,CAAC;IAEJ,IAAI,OAAQ,KAAK,SAAS,EAAE;QAC1B,OAAO,GAAG,CAAC;AACZ,IAAA;;;IAKD,MAAM,cAAc,GAA4B,EAAE;AAClD,IAAA,MAAM,UAAU,GAAG,CAAC,CAAK,EAAE,QAAgB,KAAI;;QAC7C,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;QAE3B,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAM,GAAG,QAAQ;;AAGzE,QAAA,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,IAAK,GAAG,QAAQ,EAAE;AAChE,YAAA,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,QAAQ;AAC3B,QAAA;QAED,IAAI,cAAc,CAAC,CAAC,CAAC;YAAE;AACvB,QAAA,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI;;AAGxB,QAAA,CAAA,EAAA,GAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAC,KAAI;AACzC,YAAA,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC;AACjD,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC;;IAGD,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI;AACpB,QAAA,IAAI,CAAC,KAAK;YAAE;AACZ,QAAA,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAM,CAAC,EAAE;YACxB,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,KAAM,CAAC,CAAC;AAChC,QAAA;AAAM,aAAA;AACL,YAAA,KAAK,CAAC,IAAK,IAAI,OAAO;AACvB,QAAA;AACH,IAAA,CAAC,CAAC;AACJ;AAEA;;;AAGG;AACH,MAAM,KAAK,GAAG,CAAC,CAAa,EAAE,CAAsB,KAAI;AACtD,IAAA,QACE,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;AAC9B,QAAA,CAAC,CAAC,IAAI,CAAC,MAAO;AAElB;;;;"}