@antv/layout 0.3.12 → 1.0.0-alpha.0

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

@@ -1,53 +0,0 @@
-// "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

@@ -1 +0,0 @@
-{"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;AAG/C;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAE,EAAE;IACxB,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,CAAQ,EAAE,EAAE;IACnC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACxB,YAAY,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAQ,EAAE,EAAE;IACxC,cAAc,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC;AAEF,eAAe,IAAI,CAAC"}

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

@@ -1,9 +0,0 @@
-import { Edge, Graph } from '../../graph';
-declare const networkSimplex: (og: Graph) => void;
-export declare const initCutValues: (t: Graph, g: Graph) => void;
-export declare const calcCutValue: (t: Graph, g: Graph, child: string) => number;
-export declare const initLowLimValues: (tree: Graph, root?: string) => void;
-export declare const leaveEdge: (tree: Graph) => import("@antv/graphlib/lib/Graph").DefaultEdgeType<string, Partial<import("../../graph").EdgeConfig & Edge & import("../../graph").GraphEdge>> | undefined;
-export declare const enterEdge: (t: Graph, g: Graph, edge: any) => import("@antv/graphlib/lib/Graph").DefaultEdgeType<string, Partial<import("../../graph").EdgeConfig & Edge & import("../../graph").GraphEdge>>;
-export declare const exchangeEdges: (t: Graph, g: Graph, e: Edge, f: Edge) => void;
-export default networkSimplex;

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

@@ -1,195 +0,0 @@
-import { feasibleTree } from './feasible-tree';
-import { slack, longestPath as initRank } from './util';
-import { minBy, simplify } from '../util';
-import { algorithm } from '@antv/graphlib';
-const { preorder, postorder } = algorithm;
-/*
- * 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);
-    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.
- */
-export const initCutValues = (t, g) => {
-    let vs = postorder(t, t.nodes());
-    vs = vs === null || vs === void 0 ? void 0 : vs.slice(0, (vs === null || vs === void 0 ? void 0 : vs.length) - 1);
-    vs === null || vs === void 0 ? void 0 : vs.forEach((v) => {
-        assignCutValue(t, g, v);
-    });
-};
-const assignCutValue = (t, g, child) => {
-    const childLab = t.node(child);
-    const parent = childLab.parent;
-    t.edgeFromArgs(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.
- */
-export const calcCutValue = (t, g, child) => {
-    var _a;
-    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.edgeFromArgs(child, parent);
-    // The accumulated cut value for the edge between this node and its parent
-    let cutValue = 0;
-    if (!graphEdge) {
-        childIsTail = false;
-        graphEdge = g.edgeFromArgs(parent, child);
-    }
-    cutValue = graphEdge.weight;
-    (_a = g.nodeEdges(child)) === null || _a === void 0 ? void 0 : _a.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.edgeFromArgs(child, other).cutvalue;
-                cutValue += pointsToHead ? -otherCutValue : otherCutValue;
-            }
-        }
-    });
-    return cutValue;
-};
-export const initLowLimValues = (tree, 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[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;
-};
-export const leaveEdge = (tree) => {
-    return tree.edges().find((e) => {
-        return tree.edge(e).cutvalue < 0;
-    });
-};
-export 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); });
-};
-export 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) => { var _a; return !((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.parent); });
-    let vs = preorder(t, root);
-    vs = vs === null || vs === void 0 ? void 0 : vs.slice(1);
-    vs === null || vs === void 0 ? void 0 : vs.forEach((v) => {
-        const parent = t.node(v).parent;
-        let edge = g.edgeFromArgs(v, parent);
-        let flipped = false;
-        if (!edge) {
-            edge = g.edgeFromArgs(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;
-};
-export default networkSimplex;
-//# sourceMappingURL=network-simplex.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"network-simplex.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/rank/network-simplex.ts"],"names":[],"mappings":"AAAA,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,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAI3C,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,SAAS,CAAC;AAG1C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,cAAc,GAAG,CAAC,EAAS,EAAE,EAAE;IACnC,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IACvB,QAAQ,CAAC,CAAC,CAAC,CAAC;IACZ,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1B,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpB,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpB,IAAI,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,CAAC,MAAM,aAAa,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,EAAE;IAClD,IAAI,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IACjC,EAAE,GAAG,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,KAAK,CAAC,CAAC,EAAE,CAAA,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,MAAM,IAAG,CAAC,CAAC,CAAC;IAClC,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QACxB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,KAAa,EAAE,EAAE;IAC3D,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;IAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAO,CAAC;IAChC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAE,CAAC,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AACtE,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,KAAa,EAAE,EAAE;;IAChE,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;IAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAgB,CAAC;IACzC,yEAAyE;IACzE,IAAI,WAAW,GAAG,IAAI,CAAC;IACvB,qDAAqD;IACrD,IAAI,SAAS,GAAG,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAE,CAAC;IAC/C,0EAA0E;IAC1E,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,IAAI,CAAC,SAAS,EAAE;QACd,WAAW,GAAG,KAAK,CAAC;QACpB,SAAS,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAE,CAAC;KAC5C;IAED,QAAQ,GAAG,SAAS,CAAC,MAAO,CAAC;IAE7B,MAAA,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAChC,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,CAAE,CAAC,MAAO,CAAC;YAEvC,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,YAAY,CAAC,KAAK,EAAE,KAAK,CAAE,CAAC,QAAQ,CAAC;gBAC7D,QAAQ,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC;aAC3D;SACF;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,IAAW,EAAE,OAAe,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;IAC9E,eAAe,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,IAAW,EAAE,OAAgC,EAAE,OAAe,EAAE,CAAS,EAAE,MAAe,EAAE,EAAE;;IACrH,MAAM,GAAG,GAAG,OAAO,CAAC;IACpB,IAAI,UAAU,GAAG,OAAO,CAAC;IACzB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;IAE5B,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAClB,MAAA,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACf,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,CAAC,MAAM,SAAS,GAAG,CAAC,IAAW,EAAE,EAAE;IACvC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,IAAS,EAAE,EAAE;IACzD,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,CAAE,CAAC;IAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;IAC1B,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,CAAC,MAAM,aAAa,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,CAAO,EAAE,CAAO,EAAE,EAAE;IACpE,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,CAAQ,EAAE,CAAQ,EAAE,EAAE;IACzC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,WAAE,OAAO,CAAC,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,MAAM,CAAA,CAAC,CAAC,CAAC,CAAE,CAAC;IACnE,IAAI,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC3B,EAAE,GAAG,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QACxB,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,MAAgB,CAAC;QAC3C,IAAI,IAAI,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACrC,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAE,CAAC;YAClC,OAAO,GAAG,IAAI,CAAC;SAChB;QAED,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAK,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;IACrF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,GAAG,CAAC,IAAW,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;IACvD,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAAG,CAAC,IAAW,EAAE,MAAW,EAAE,SAAc,EAAE,EAAE;IAChE,OAAO,SAAS,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC;AACpE,CAAC,CAAC;AAEF,eAAe,cAAc,CAAC"}

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

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

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

@@ -1,141 +0,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.
- */
-const longestPath = (g) => {
-    var _a;
-    const visited = {};
-    const dfs = (v) => {
-        var _a;
-        const label = g.node(v);
-        if (!label)
-            return 0;
-        if (visited[v]) {
-            return label.rank;
-        }
-        visited[v] = true;
-        let rank;
-        (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.forEach((edgeObj) => {
-            const wRank = dfs(edgeObj.w);
-            const minLen = g.edge(edgeObj).minlen;
-            const r = wRank - minLen;
-            if (r) {
-                if (rank === undefined || r < rank) {
-                    rank = r;
-                }
-            }
-        });
-        if (!rank) {
-            rank = 0;
-        }
-        label.rank = rank;
-        return rank;
-    };
-    (_a = g.sources()) === null || _a === void 0 ? void 0 : _a.forEach((source) => dfs(source));
-};
-const longestPathWithLayer = (g) => {
-    var _a;
-    // 用longest path，找出最深的点
-    const visited = {};
-    let minRank;
-    const dfs = (v) => {
-        var _a;
-        const label = g.node(v);
-        if (!label)
-            return 0;
-        if (visited[v]) {
-            return label.rank;
-        }
-        visited[v] = true;
-        let rank;
-        (_a = g.outEdges(v)) === null || _a === void 0 ? void 0 : _a.forEach((edgeObj) => {
-            const wRank = dfs(edgeObj.w);
-            const minLen = g.edge(edgeObj).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.rank = rank;
-        return rank;
-    };
-    (_a = g.sources()) === null || _a === void 0 ? void 0 : _a.forEach((source) => {
-        if (g.node(source))
-            dfs(source);
-    });
-    if (minRank === undefined) {
-        minRank = 0;
-    }
-    // minRank += 1; // NOTE: 最小的层级是dummy root，+1
-    // forward一遍，赋值层级
-    const forwardVisited = {};
-    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;
-        }
-        if (forwardVisited[v])
-            return;
-        forwardVisited[v] = true;
-        // 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 (!label)
-            return;
-        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

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/rank/util.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,WAAW,GAAG,CAAC,CAAQ,EAAE,EAAE;;IAC/B,MAAM,OAAO,GAA4B,EAAE,CAAC;IAE5C,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;;QACxB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACzB,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC;QACrB,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;YACd,OAAO,KAAK,CAAC,IAAK,CAAC;SACpB;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAElB,IAAI,IAAY,CAAC;QAEjB,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,OAAO,CACpB,CAAC,OAAO,EAAE,EAAE;YACV,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAE,CAAC,MAAO,CAAC;YACxC,MAAM,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC;YACzB,IAAI,CAAC,EAAE;gBACL,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,IAAI,EAAE;oBAClC,IAAI,GAAG,CAAC,CAAC;iBACV;aACF;QACH,CAAC,CACF,CAAC;QAGF,IAAI,CAAC,IAAK,EAAE;YACV,IAAI,GAAG,CAAC,CAAC;SACV;QAED,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,MAAA,CAAC,CAAC,OAAO,EAAE,0CAAE,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAChD,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAQ,EAAE,EAAE;;IACxC,uBAAuB;IACvB,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,IAAI,OAAe,CAAC;IAEpB,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;;QACxB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACzB,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC;QACrB,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;YACd,OAAO,KAAK,CAAC,IAAK,CAAC;SACpB;QACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAElB,IAAI,IAAY,CAAC;QAEjB,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,OAAO,CACpB,CAAC,OAAO,EAAE,EAAE;YACV,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAE,CAAC,MAAO,CAAC;YACxC,MAAM,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC;YACzB,IAAI,CAAC,EAAE;gBACL,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,IAAI,EAAE;oBAClC,IAAI,GAAG,CAAC,CAAC;iBACV;aACF;QACH,CAAC,CACF,CAAC;QAGF,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,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,MAAA,CAAC,CAAC,OAAO,EAAE,0CAAE,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;QAC9B,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACjC,CAAC,CAAC,CAAC;IAEH,IAAI,OAAQ,KAAK,SAAS,EAAE;QAC1B,OAAO,GAAG,CAAC,CAAC;KACb;IAED,6CAA6C;IAE7C,iBAAiB;IACjB,MAAM,cAAc,GAA4B,EAAE,CAAC;IACnD,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,QAAgB,EAAE,EAAE;;QACjD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAEzB,MAAM,QAAQ,GAAG,CACf,CAAC,KAAK,CAAC,KAAK,CAAC,KAAe,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAC7C,CAAC;QAEZ,YAAY;QACZ,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,GAAG,QAAQ,EAAE;YACrD,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;SACvB;QAED,IAAI,cAAc,CAAC,CAAC,CAAC;YAAE,OAAO;QAC9B,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAEzB,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,CAAE,CAAC,MAAO,CAAC,CAAC;QACjD,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,CAAE,CAAC;QACzB,IAAG,CAAC,KAAK;YAAE,OAAO;QAClB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAe,CAAC,EAAE;YACjC,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,KAAe,CAAC,CAAC,CAAC,2BAA2B;SAClE;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,CAAO,EAAE,EAAE;IAClC,OAAO,CACJ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,IAAe;QAC5B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,IAAe;QAC5B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,MAAiB,CAC9B,CAAC;AACJ,CAAC,CAAC;AAEF,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;AAEpD,eAAe;IACb,WAAW;IACX,oBAAoB;IACpB,KAAK;CACN,CAAC"}

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

@@ -1,31 +0,0 @@
-import { Graph, Node } from "../graph";
-export declare const addDummyNode: (g: Graph, type: string, attrs: Node<Record<string, any>>, name: string) => string;
-export declare const simplify: (g: Graph) => Graph;
-export declare const asNonCompoundGraph: (g: Graph) => Graph;
-export declare const zipObject: <T = any>(keys: string[], values: T[]) => Record<string, T>;
-export declare const successorWeights: (g: Graph) => Record<string, Record<string, number>>;
-export declare const predecessorWeights: (g: Graph) => Record<string, Record<string, number>>;
-export declare const intersectRect: (rect: {
-    x?: number;
-    y?: number;
-    width?: number;
-    height?: number;
-}, point: {
-    x?: number;
-    y?: number;
-}) => {
-    x: number;
-    y: number;
-};
-export declare const buildLayerMatrix: (g: Graph) => string[][];
-export declare const normalizeRanks: (g: Graph) => void;
-export declare const removeEmptyRanks: (g: Graph) => void;
-export declare const addBorderNode: (g: Graph, prefix: string, rank?: number, order?: number) => string;
-export declare const maxRank: (g: Graph) => number;
-export declare const partition: <T = any>(collection: T[], fn: (val: T) => boolean) => {
-    lhs: T[];
-    rhs: T[];
-};
-export declare const time: (name: string, fn: () => void) => void;
-export declare const notime: (name: string, fn: () => void) => void;
-export declare const minBy: <T = any>(array: T[], func: (param: T) => number) => T;