@dagrejs/dagre 2.0.4 → 3.1.0

package/dist/types/index.d.ts

@@ -0,0 +1,26 @@
+import * as graphlib from '@dagrejs/graphlib';
+import { notime, time } from './lib/util';
+import { layout } from './lib/layout';
+import { debugOrdering as debug } from './lib/debug';
+export { graphlib };
+export { Graph } from '@dagrejs/graphlib';
+export { version } from './lib/version';
+export { layout } from './lib/layout';
+export { debugOrdering as debug } from './lib/debug';
+export declare const util: {
+    time: typeof time;
+    notime: typeof notime;
+};
+export type { GraphLabel, NodeConfig, EdgeConfig, LayoutConfig, LayoutOptions, NodeLabel, EdgeLabel, Point, OrderConstraint, WeightFunction, RankerFunction, Edge } from './lib/types';
+declare const dagre: {
+    graphlib: typeof graphlib;
+    version: string;
+    layout: typeof layout;
+    debug: typeof debug;
+    util: {
+        time: typeof time;
+        notime: typeof notime;
+    };
+};
+export default dagre;
+//# sourceMappingURL=index.d.ts.map

package/dist/types/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../index.ts"],"names":[],"mappings":"AAwBA,OAAO,KAAK,QAAQ,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAC,MAAM,EAAE,IAAI,EAAC,MAAM,YAAY,CAAC;AAExC,OAAO,EAAC,MAAM,EAAC,MAAM,cAAc,CAAC;AACpC,OAAO,EAAC,aAAa,IAAI,KAAK,EAAC,MAAM,aAAa,CAAC;AAEnD,OAAO,EAAC,QAAQ,EAAC,CAAC;AAElB,OAAO,EAAC,KAAK,EAAC,MAAM,mBAAmB,CAAC;AACxC,OAAO,EAAC,OAAO,EAAC,MAAM,eAAe,CAAC;AACtC,OAAO,EAAC,MAAM,EAAC,MAAM,cAAc,CAAC;AACpC,OAAO,EAAC,aAAa,IAAI,KAAK,EAAC,MAAM,aAAa,CAAC;AAEnD,eAAO,MAAM,IAAI;;;CAAiB,CAAC;AAGnC,YAAY,EACR,UAAU,EACV,UAAU,EACV,UAAU,EACV,YAAY,EACZ,aAAa,EACb,SAAS,EACT,SAAS,EACT,KAAK,EACL,eAAe,EACf,cAAc,EACd,cAAc,EACd,IAAI,EACP,MAAM,aAAa,CAAC;AAErB,QAAA,MAAM,KAAK;;;;;;;;;CAMV,CAAC;AAEF,eAAe,KAAK,CAAC"}

package/dist/types/lib/acyclic.d.ts

@@ -0,0 +1,6 @@
+import { Graph } from "@dagrejs/graphlib";
+import type { EdgeLabel, GraphLabel, NodeLabel } from "./types";
+export { run, undo };
+declare function run(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, oldGraph?: Graph | null): void;
+declare function undo(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+//# sourceMappingURL=acyclic.d.ts.map

package/dist/types/lib/acyclic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"acyclic.d.ts","sourceRoot":"","sources":["../../../lib/acyclic.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,mBAAmB,CAAC;AAGxC,OAAO,KAAK,EAAO,SAAS,EAAE,UAAU,EAAE,SAAS,EAAiB,MAAM,SAAS,CAAC;AAEpF,OAAO,EAAC,GAAG,EAAE,IAAI,EAAC,CAAC;AAEnB,iBAAS,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,QAAQ,CAAC,EAAE,KAAK,GAAG,IAAI,GAAG,IAAI,CAiB1F;AAmDD,iBAAS,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAYlE"}

package/dist/types/lib/add-border-segments.d.ts

@@ -0,0 +1,4 @@
+import type { EdgeLabel, Graph, GraphLabel, NodeLabel } from "./types";
+export default addBorderSegments;
+declare function addBorderSegments(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+//# sourceMappingURL=add-border-segments.d.ts.map

package/dist/types/lib/add-border-segments.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-border-segments.d.ts","sourceRoot":"","sources":["../../../lib/add-border-segments.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,SAAS,CAAC;AAErE,eAAe,iBAAiB,CAAC;AAEjC,iBAAS,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAuB/E"}

package/dist/types/lib/coordinate-system.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Transforms a point from subgraph-local coordinates to parent context coordinates.
+ * @param x X in subgraph
+ * @param y Y in subgraph
+ * @param clusterX X of cluster node in parent
+ * @param clusterY Y of cluster node in parent
+ * @param subgraphCenterX Center X of subgraph in subgraph coords
+ * @param subgraphCenterY Center Y of subgraph in subgraph coords
+ * @returns [x, y] in parent context
+ */
+export declare function toParentCoords(x: number, y: number, clusterX: number, clusterY: number, subgraphCenterX: number, subgraphCenterY: number): [number, number];
+/**
+ * Transforms a point from parent context coordinates to subgraph-local coordinates.
+ * @param x X in parent
+ * @param y Y in parent
+ * @param clusterX X of cluster node in parent
+ * @param clusterY Y of cluster node in parent
+ * @param subgraphCenterX Center X of subgraph in subgraph coords
+ * @param subgraphCenterY Center Y of subgraph in subgraph coords
+ * @returns [x, y] in subgraph-local coords
+ */
+export declare function toSubgraphCoords(x: number, y: number, clusterX: number, clusterY: number, subgraphCenterX: number, subgraphCenterY: number): [number, number];
+import type { Graph } from './types';
+export declare function adjust(graph: Graph): void;
+export declare function undo(graph: Graph): void;
+//# sourceMappingURL=coordinate-system.d.ts.map

package/dist/types/lib/coordinate-system.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate-system.d.ts","sourceRoot":"","sources":["../../../lib/coordinate-system.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAE3J;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAE7J;AACD,OAAO,KAAK,EAAY,KAAK,EAA+B,MAAM,SAAS,CAAC;AAE5E,wBAAgB,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAKzC;AAED,wBAAgB,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAUvC"}

package/dist/types/lib/data/list.d.ts

@@ -0,0 +1,14 @@
+interface ListNode {
+    _next?: ListNode;
+    _prev?: ListNode;
+    [key: string]: unknown;
+}
+declare class List {
+    private _sentinel;
+    constructor();
+    dequeue(): ListNode | undefined;
+    enqueue(entry: ListNode): void;
+    toString(): string;
+}
+export default List;
+//# sourceMappingURL=list.d.ts.map

package/dist/types/lib/data/list.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../../../../lib/data/list.ts"],"names":[],"mappings":"AAKA,UAAU,QAAQ;IACd,KAAK,CAAC,EAAE,QAAQ,CAAC;IACjB,KAAK,CAAC,EAAE,QAAQ,CAAC;IAEjB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CAC1B;AAED,cAAM,IAAI;IACN,OAAO,CAAC,SAAS,CAAW;;IAQ5B,OAAO,IAAI,QAAQ,GAAG,SAAS;IAU/B,OAAO,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI;IAW9B,QAAQ,IAAI,MAAM;CAUrB;AAgBD,eAAe,IAAI,CAAC"}

package/dist/types/lib/debug.d.ts

@@ -0,0 +1,3 @@
+import { Graph } from "./graph-lib";
+export declare function debugOrdering(graph: Graph): Graph;
+//# sourceMappingURL=debug.d.ts.map

package/dist/types/lib/debug.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug.d.ts","sourceRoot":"","sources":["../../../lib/debug.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,KAAK,EAAC,MAAM,aAAa,CAAC;AAGlC,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAsBjD"}

package/dist/types/lib/graph-lib.d.ts

@@ -0,0 +1,3 @@
+import { alg, Graph } from "@dagrejs/graphlib";
+export { Graph, alg };
+//# sourceMappingURL=graph-lib.d.ts.map

package/dist/types/lib/graph-lib.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-lib.d.ts","sourceRoot":"","sources":["../../../lib/graph-lib.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,GAAG,EAAE,KAAK,EAAC,MAAM,mBAAmB,CAAC;AAE7C,OAAO,EAAC,KAAK,EAAE,GAAG,EAAC,CAAC"}

package/dist/types/lib/greedy-fas.d.ts

@@ -0,0 +1,4 @@
+import { Graph } from "./graph-lib";
+import type { Edge, WeightFunction } from './types';
+export default function greedyFAS(graph: Graph, weightFn?: WeightFunction): Edge[];
+//# sourceMappingURL=greedy-fas.d.ts.map

package/dist/types/lib/greedy-fas.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-fas.d.ts","sourceRoot":"","sources":["../../../lib/greedy-fas.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,aAAa,CAAC;AAElC,OAAO,KAAK,EAAC,IAAI,EAAE,cAAc,EAAC,MAAM,SAAS,CAAC;AAyBlD,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,IAAI,EAAE,CASjF"}

package/dist/types/lib/layout.d.ts

@@ -0,0 +1,4 @@
+import { Graph } from "./graph-lib";
+import type { EdgeLabel, GraphLabel, LayoutOptions, NodeLabel } from "./types";
+export declare function layout(g: Graph<GraphLabel, NodeLabel, EdgeLabel>, opts?: LayoutOptions): Graph<GraphLabel, NodeLabel, EdgeLabel>;
+//# sourceMappingURL=layout.d.ts.map

package/dist/types/lib/layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../../../lib/layout.ts"],"names":[],"mappings":"AAWA,OAAO,EAAC,KAAK,EAAC,MAAM,aAAa,CAAC;AAClC,OAAO,KAAK,EAAO,SAAS,EAAE,UAAU,EAAE,aAAa,EAAkB,SAAS,EAAQ,MAAM,SAAS,CAAC;AA2B1G,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,IAAI,GAAE,aAAkB,GAAG,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,CAGpI"}

package/dist/types/lib/nesting-graph.d.ts

@@ -0,0 +1,5 @@
+import type { EdgeLabel, Graph, GraphLabel, NodeLabel } from "./types";
+export { run, cleanup, };
+declare function run(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+declare function cleanup(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+//# sourceMappingURL=nesting-graph.d.ts.map

package/dist/types/lib/nesting-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.d.ts","sourceRoot":"","sources":["../../../lib/nesting-graph.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,SAAS,CAAC;AAErE,OAAO,EACH,GAAG,EACH,OAAO,GACV,CAAC;AAyBF,iBAAS,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAuBjE;AA0ED,iBAAS,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAUrE"}

package/dist/types/lib/normalize.d.ts

@@ -0,0 +1,5 @@
+import type { EdgeLabel, Graph, GraphLabel, NodeLabel } from "./types";
+export { run, undo };
+declare function run(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+declare function undo(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+//# sourceMappingURL=normalize.d.ts.map

package/dist/types/lib/normalize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../../lib/normalize.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAO,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,SAAS,CAAC;AAE3E,OAAO,EACH,GAAG,EACH,IAAI,EACP,CAAC;AAkBF,iBAAS,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAGjE;AA4CD,iBAAS,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAoBlE"}

package/dist/types/lib/order/add-subgraph-constraints.d.ts

@@ -0,0 +1,3 @@
+import type { Graph } from '../types';
+export default function addSubgraphConstraints(graph: Graph, constraintGraph: Graph, vs: string[]): void;
+//# sourceMappingURL=add-subgraph-constraints.d.ts.map

package/dist/types/lib/order/add-subgraph-constraints.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-subgraph-constraints.d.ts","sourceRoot":"","sources":["../../../../lib/order/add-subgraph-constraints.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,UAAU,CAAC;AAEpC,MAAM,CAAC,OAAO,UAAU,sBAAsB,CAAC,KAAK,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,IAAI,CAgDvG"}

package/dist/types/lib/order/barycenter.d.ts

@@ -0,0 +1,9 @@
+import type { Graph } from '../types';
+interface BarycenterEntry {
+    v: string;
+    barycenter?: number;
+    weight?: number;
+}
+export default function barycenter(graph: Graph, movable?: string[]): BarycenterEntry[];
+export {};
+//# sourceMappingURL=barycenter.d.ts.map

package/dist/types/lib/order/barycenter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"barycenter.d.ts","sourceRoot":"","sources":["../../../../lib/order/barycenter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,UAAU,CAAC;AAEpC,UAAU,eAAe;IACrB,CAAC,EAAE,MAAM,CAAC;IACV,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,CAAC,OAAO,UAAU,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,GAAE,MAAM,EAAO,GAAG,eAAe,EAAE,CAsB1F"}

package/dist/types/lib/order/build-layer-graph.d.ts

@@ -0,0 +1,3 @@
+import type { Graph as GraphType } from '../types';
+export default function buildLayerGraph(graph: GraphType, rank: number, relationship: "inEdges" | "outEdges", nodesWithRank?: string[]): GraphType;
+//# sourceMappingURL=build-layer-graph.d.ts.map

package/dist/types/lib/order/build-layer-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-layer-graph.d.ts","sourceRoot":"","sources":["../../../../lib/order/build-layer-graph.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,KAAK,IAAI,SAAS,EAAC,MAAM,UAAU,CAAC;AAsCjD,MAAM,CAAC,OAAO,UAAU,eAAe,CACnC,KAAK,EAAE,SAAS,EAChB,IAAI,EAAE,MAAM,EACZ,YAAY,EAAE,SAAS,GAAG,UAAU,EACpC,aAAa,CAAC,EAAE,MAAM,EAAE,GACzB,SAAS,CAsCX"}

package/dist/types/lib/order/cross-count.d.ts

@@ -0,0 +1,3 @@
+import type { Graph } from '../types';
+export default function crossCount(graph: Graph, layering: string[][]): number;
+//# sourceMappingURL=cross-count.d.ts.map

package/dist/types/lib/order/cross-count.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-count.d.ts","sourceRoot":"","sources":["../../../../lib/order/cross-count.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,UAAU,CAAC;AAkBpC,MAAM,CAAC,OAAO,UAAU,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,CAM7E"}

package/dist/types/lib/order/index.d.ts

@@ -0,0 +1,3 @@
+import type { Graph as GraphType, NodeCollection, OrderOptions } from '../types';
+export default function order(graph: GraphType, opts?: OrderOptions, oldNodes?: NodeCollection): void;
+//# sourceMappingURL=index.d.ts.map

package/dist/types/lib/order/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../lib/order/index.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAC,KAAK,IAAI,SAAS,EAAE,cAAc,EAAmB,YAAY,EAAC,MAAM,UAAU,CAAC;AAiBhG,MAAM,CAAC,OAAO,UAAU,KAAK,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,GAAE,YAAiB,EAAE,QAAQ,GAAE,cAAqB,GAAG,IAAI,CAoC9G"}

package/dist/types/lib/order/init-order.d.ts

@@ -0,0 +1,3 @@
+import type { Graph, NodeCollection } from '../types';
+export default function initOrder(graph: Graph, oldNodes?: NodeCollection): string[][];
+//# sourceMappingURL=init-order.d.ts.map

package/dist/types/lib/order/init-order.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"init-order.d.ts","sourceRoot":"","sources":["../../../../lib/order/init-order.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,KAAK,EAAE,cAAc,EAAC,MAAM,UAAU,CAAC;AAapD,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,GAAE,cAAqB,GAAG,MAAM,EAAE,EAAE,CA8B3F"}

package/dist/types/lib/order/resolve-conflicts.d.ts

@@ -0,0 +1,15 @@
+import type { Graph } from '../types';
+interface BarycenterEntry {
+    v: string;
+    barycenter?: number;
+    weight?: number;
+}
+export interface ResolvedEntry {
+    vs: string[];
+    i: number;
+    barycenter?: number;
+    weight?: number;
+}
+export default function resolveConflicts(entries: BarycenterEntry[], constraintGraph: Graph): ResolvedEntry[];
+export {};
+//# sourceMappingURL=resolve-conflicts.d.ts.map

package/dist/types/lib/order/resolve-conflicts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve-conflicts.d.ts","sourceRoot":"","sources":["../../../../lib/order/resolve-conflicts.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,UAAU,CAAC;AAEpC,UAAU,eAAe;IACrB,CAAC,EAAE,MAAM,CAAC;IACV,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAcD,MAAM,WAAW,aAAa;IAC1B,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;IACV,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AA2BD,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAO,EAAE,eAAe,EAAE,EAAE,eAAe,EAAE,KAAK,GAAG,aAAa,EAAE,CA6B5G"}

package/dist/types/lib/order/sort-subgraph.d.ts

@@ -0,0 +1,12 @@
+import type { Graph, NodeCollection } from '../types';
+interface SubgraphResult {
+    vs: string[];
+    barycenter?: number;
+    weight?: number;
+}
+export default function sortSubgraph(graph: Graph, v: string, constraintGraph: Graph, oldNodes?: NodeCollection | boolean, biasRight?: boolean): SubgraphResult & {
+    result: SubgraphResult;
+    usedBias: boolean;
+};
+export {};
+//# sourceMappingURL=sort-subgraph.d.ts.map

package/dist/types/lib/order/sort-subgraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort-subgraph.d.ts","sourceRoot":"","sources":["../../../../lib/order/sort-subgraph.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAC,KAAK,EAAE,cAAc,EAAC,MAAM,UAAU,CAAC;AAEpD,UAAU,cAAc;IACpB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAQD,MAAM,CAAC,OAAO,UAAU,YAAY,CAChC,KAAK,EAAE,KAAK,EACZ,CAAC,EAAE,MAAM,EACT,eAAe,EAAE,KAAK,EACtB,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,EACnC,SAAS,CAAC,EAAE,OAAO,GACpB,cAAc,GAAG;IAAE,MAAM,EAAE,cAAc,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAA;CAAE,CA2FhE"}

package/dist/types/lib/order/sort.d.ts

@@ -0,0 +1,16 @@
+import type { Graph, NodeCollection } from '../types';
+import { ResolvedEntry } from "./resolve-conflicts";
+interface SortEntry {
+    vs: string[];
+    i: number;
+    barycenter?: number;
+    weight?: number;
+}
+interface SortResult {
+    vs: string[];
+    barycenter?: number;
+    weight?: number;
+}
+export default function sort(entries: SortEntry[], reversedPairs?: Record<string, ResolvedEntry> | boolean, oldNodes?: NodeCollection, graph?: Graph | null, biasRight?: boolean): SortResult;
+export {};
+//# sourceMappingURL=sort.d.ts.map

package/dist/types/lib/order/sort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.d.ts","sourceRoot":"","sources":["../../../../lib/order/sort.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,KAAK,EAAE,cAAc,EAAC,MAAM,UAAU,CAAC;AACpD,OAAO,EAAC,aAAa,EAAC,MAAM,qBAAqB,CAAC;AAElD,UAAU,SAAS;IACf,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;IACV,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,UAAU,UAAU;IAChB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,CAAC,OAAO,UAAU,IAAI,CACxB,OAAO,EAAE,SAAS,EAAE,EACpB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,GAAG,OAAO,EACvD,QAAQ,CAAC,EAAE,cAAc,EACzB,KAAK,CAAC,EAAE,KAAK,GAAG,IAAI,EACpB,SAAS,CAAC,EAAE,OAAO,GACpB,UAAU,CAiDZ"}

package/dist/types/lib/parent-dummy-chains.d.ts

@@ -0,0 +1,4 @@
+import type { EdgeLabel, Graph, GraphLabel, NodeLabel } from "./types";
+export default parentDummyChains;
+declare function parentDummyChains(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+//# sourceMappingURL=parent-dummy-chains.d.ts.map

package/dist/types/lib/parent-dummy-chains.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parent-dummy-chains.d.ts","sourceRoot":"","sources":["../../../lib/parent-dummy-chains.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAO,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,SAAS,CAAC;AAG3E,eAAe,iBAAiB,CAAC;AAYjC,iBAAS,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CA2C/E"}

package/dist/types/lib/position/bk.d.ts

@@ -0,0 +1,37 @@
+import { Graph } from "../graph-lib";
+import type { EdgeLabel, GraphLabel, NodeLabel } from "../types";
+export { positionX, findType1Conflicts, findType2Conflicts, addConflict, hasConflict, verticalAlignment, horizontalCompaction, alignCoordinates, findSmallestWidthAlignment, balance };
+type Conflicts = {
+    [key: string]: {
+        [key: string]: boolean;
+    };
+};
+type PositionMap = {
+    [key: string]: number;
+};
+type AlignmentResult = {
+    root: {
+        [key: string]: string;
+    };
+    align: {
+        [key: string]: string;
+    };
+};
+type XssMap = {
+    [key: string]: PositionMap;
+};
+declare function findType1Conflicts(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, layering: string[][]): Conflicts;
+declare function findType2Conflicts(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, layering: string[][]): Conflicts;
+declare function addConflict(conflicts: Conflicts, v: string, w: string): void;
+declare function hasConflict(conflicts: Conflicts, v: string, w: string): boolean;
+declare function verticalAlignment(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, layering: string[][], conflicts: Conflicts, neighborFn: (v: string) => string[], corePath?: string[]): AlignmentResult;
+declare function horizontalCompaction(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, layering: string[][], root: {
+    [key: string]: string;
+}, align: {
+    [key: string]: string;
+}, reverseSep?: boolean): PositionMap;
+declare function findSmallestWidthAlignment(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, xss: XssMap): PositionMap;
+declare function alignCoordinates(xss: XssMap, alignTo: PositionMap): void;
+declare function balance(xss: XssMap, align?: string | undefined): PositionMap;
+declare function positionX(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, corePath?: string[]): PositionMap;
+//# sourceMappingURL=bk.d.ts.map

package/dist/types/lib/position/bk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bk.d.ts","sourceRoot":"","sources":["../../../../lib/position/bk.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,cAAc,CAAC;AAEnC,OAAO,KAAK,EAAC,SAAS,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,UAAU,CAAC;AAO/D,OAAO,EACH,SAAS,EACT,kBAAkB,EAClB,kBAAkB,EAClB,WAAW,EACX,WAAW,EACX,iBAAiB,EACjB,oBAAoB,EACpB,gBAAgB,EAChB,0BAA0B,EAC1B,OAAO,EACV,CAAC;AAEF,KAAK,SAAS,GAAG;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAA;KAAE,CAAA;CAAE,CAAC;AAC/D,KAAK,WAAW,GAAG;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,CAAC;AAC7C,KAAK,eAAe,GAAG;IAAE,IAAI,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;KAAE,CAAC;IAAC,KAAK,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;KAAE,CAAA;CAAE,CAAC;AAC7F,KAAK,MAAM,GAAG;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,WAAW,CAAA;CAAE,CAAC;AAmB7C,iBAAS,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,SAAS,CA6C3G;AAED,iBAAS,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,GAAG,SAAS,CAoD3G;AAYD,iBAAS,WAAW,CAAC,SAAS,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAYrE;AAED,iBAAS,WAAW,CAAC,SAAS,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAQxE;AAUD,iBAAS,iBAAiB,CACtB,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAC9C,QAAQ,EAAE,MAAM,EAAE,EAAE,EACpB,SAAS,EAAE,SAAS,EACpB,UAAU,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,EAAE,EACnC,QAAQ,CAAC,EAAE,MAAM,EAAE,GACpB,eAAe,CAuEjB;AAED,iBAAS,oBAAoB,CACzB,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAC9C,QAAQ,EAAE,MAAM,EAAE,EAAE,EACpB,IAAI,EAAE;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,EAC/B,KAAK,EAAE;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,EAChC,UAAU,GAAE,OAAe,GAC5B,WAAW,CAoFb;AAqCD,iBAAS,0BAA0B,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,WAAW,CAkB5G;AASD,iBAAS,gBAAgB,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI,CAuBjE;AAED,iBAAS,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,GAAE,MAAM,GAAG,SAAqB,GAAG,WAAW,CAmBhF;AAED,iBAAS,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,QAAQ,CAAC,EAAE,MAAM,EAAE,GAAG,WAAW,CAmCnG"}

package/dist/types/lib/position/index.d.ts

@@ -0,0 +1,5 @@
+import type { Graph } from '@dagrejs/graphlib';
+import type { EdgeLabel, GraphLabel, NodeLabel } from "../types";
+export { position };
+declare function position(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, corePath?: string[]): void;
+//# sourceMappingURL=index.d.ts.map

package/dist/types/lib/position/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../lib/position/index.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,mBAAmB,CAAC;AAC7C,OAAO,KAAK,EAAC,SAAS,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,UAAU,CAAC;AAE/D,OAAO,EAAC,QAAQ,EAAC,CAAC;AAElB,iBAAS,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,QAAQ,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAK3F"}

package/dist/types/lib/rank/feasible-tree.d.ts

@@ -0,0 +1,14 @@
+import { Graph } from "../graph-lib";
+import type { EdgeLabel, GraphLabel, NodeLabel } from "../types";
+interface TreeNodeLabel {
+    low?: number;
+    lim?: number;
+    parent?: string;
+}
+interface TreeEdgeLabel {
+    cutvalue?: number;
+}
+export default feasibleTree;
+export type { TreeNodeLabel, TreeEdgeLabel };
+declare function feasibleTree(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Graph<object, TreeNodeLabel, TreeEdgeLabel>;
+//# sourceMappingURL=feasible-tree.d.ts.map

package/dist/types/lib/rank/feasible-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"feasible-tree.d.ts","sourceRoot":"","sources":["../../../../lib/rank/feasible-tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,cAAc,CAAC;AAEnC,OAAO,KAAK,EAAO,SAAS,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,UAAU,CAAC;AAGrE,UAAU,aAAa;IACnB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAGD,UAAU,aAAa;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,eAAe,YAAY,CAAC;AAC5B,YAAY,EAAC,aAAa,EAAE,aAAa,EAAC,CAAC;AA2B3C,iBAAS,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC,CAsBjH"}

package/dist/types/lib/rank/index.d.ts

@@ -0,0 +1,4 @@
+import type { EdgeLabel, Graph, GraphLabel, NodeLabel } from "../types";
+export default rank;
+declare function rank(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+//# sourceMappingURL=index.d.ts.map

package/dist/types/lib/rank/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../lib/rank/index.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAC,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAiB,MAAM,UAAU,CAAC;AAEtF,eAAe,IAAI,CAAC;AAqBpB,iBAAS,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAoBlE"}

package/dist/types/lib/rank/network-simplex.d.ts

@@ -0,0 +1,13 @@
+import { type TreeEdgeLabel, type TreeNodeLabel } from "./feasible-tree";
+import type { Edge, EdgeLabel, Graph, GraphLabel, NodeLabel } from "../types";
+export default networkSimplex;
+declare function networkSimplex(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+declare namespace networkSimplex {
+    var initLowLimValues: (tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, root?: string) => void;
+    var initCutValues: (tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>) => void;
+    var calcCutValue: (tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, child: string) => number;
+    var leaveEdge: (tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>) => Edge | undefined;
+    var enterEdge: (tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, edge: Edge) => Edge;
+    var exchangeEdges: (t: Graph<object, TreeNodeLabel, TreeEdgeLabel>, g: Graph<GraphLabel, NodeLabel, EdgeLabel>, e: Edge, f: Edge) => void;
+}
+//# sourceMappingURL=network-simplex.d.ts.map

package/dist/types/lib/rank/network-simplex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"network-simplex.d.ts","sourceRoot":"","sources":["../../../../lib/rank/network-simplex.ts"],"names":[],"mappings":"AAAA,OAAqB,EAAC,KAAK,aAAa,EAAE,KAAK,aAAa,EAAC,MAAM,iBAAiB,CAAC;AAIrF,OAAO,KAAK,EAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,UAAU,CAAC;AAI5E,eAAe,cAAc,CAAC;AA2C9B,iBAAS,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAc5E;kBAdQ,cAAc;iCA4ES,KAAK,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC,SAAS,MAAM,KAAG,IAAI;8BAzDpE,KAAK,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC,SAAS,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,KAAG,IAAI;6BAiBnG,KAAK,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC,SAAS,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,SAAS,MAAM,KAAG,MAAM;0BA2EtH,KAAK,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC,KAAG,IAAI,GAAG,SAAS;0BAO9D,KAAK,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC,SAAS,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,QAAQ,IAAI,KAAG,IAAI;2BAsC7G,KAAK,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC,KAAK,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,KAAG,IAAI"}

package/dist/types/lib/rank/util.d.ts

@@ -0,0 +1,5 @@
+import type { Edge, EdgeLabel, Graph, GraphLabel, NodeLabel } from "../types";
+export { longestPath, slack };
+declare function longestPath(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+declare function slack(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, edge: Edge): number;
+//# sourceMappingURL=util.d.ts.map

package/dist/types/lib/rank/util.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../../../../lib/rank/util.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,UAAU,CAAC;AAE5E,OAAO,EAAC,WAAW,EAAE,KAAK,EAAC,CAAC;AAuB5B,iBAAS,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CA6BzE;AAMD,iBAAS,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAEjF"}

package/dist/types/lib/type.d.ts

@@ -0,0 +1,2 @@
+export * from "@dagrejs/graphlib";
+//# sourceMappingURL=type.d.ts.map

package/dist/types/lib/type.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"type.d.ts","sourceRoot":"","sources":["../../../lib/type.ts"],"names":[],"mappings":"AAAA,cAAc,mBAAmB,CAAC"}

package/dist/types/lib/types.d.ts

@@ -0,0 +1,142 @@
+import { Graph } from '@dagrejs/graphlib';
+export type { Graph, Edge as GraphEdge } from '@dagrejs/graphlib';
+export interface Point {
+    x: number;
+    y: number;
+}
+export interface NodeLabel {
+    width: number;
+    height: number;
+    x?: number;
+    y?: number;
+    rank?: number;
+    order?: number;
+    e?: number;
+    dummy?: 'edge' | 'border' | 'edge-label' | 'edge-proxy' | 'selfedge' | 'root';
+    borderType?: 'borderLeft' | 'borderRight';
+    borderTop?: string;
+    borderBottom?: string;
+    borderLeft?: string[];
+    borderRight?: string[];
+    minRank?: number;
+    maxRank?: number;
+    label?: string;
+    labelpos?: 'l' | 'c' | 'r';
+    class?: string;
+    padding?: number;
+    paddingX?: number;
+    paddingY?: number;
+    rx?: number;
+    ry?: number;
+    shape?: string;
+    edgeLabel?: EdgeLabel;
+    edgeObj?: Edge;
+    /**
+     * Optional direction for clusters/subgraphs. If set, overrides the global graph direction for this cluster.
+     */
+    rankdir?: 'TB' | 'BT' | 'LR' | 'RL';
+    /**
+     * Optional rank separation override for this cluster/subgraph.
+     */
+    ranksep?: number;
+    /**
+     * Optional node separation override for this cluster/subgraph.
+     */
+    nodesep?: number;
+    /**
+     * Optional alignment override for this cluster/subgraph.
+     */
+    align?: 'UL' | 'UR' | 'DL' | 'DR';
+    [key: string]: unknown;
+}
+export interface EdgeLabel {
+    points?: Point[];
+    width?: number;
+    height?: number;
+    minlen?: number;
+    weight?: number;
+    labelpos?: 'l' | 'c' | 'r';
+    labeloffset?: number;
+    labelRank?: number;
+    x?: number;
+    y?: number;
+    e?: number;
+    reversed?: boolean;
+    forwardName?: string;
+    selfEdge?: boolean;
+    nestingEdge?: boolean;
+    cutvalue?: number;
+    lim?: number;
+    low?: number;
+    parent?: string;
+    edgeLabel?: EdgeLabel;
+    edgeObj?: Edge;
+    [key: string]: unknown;
+}
+export interface GraphLabel {
+    width?: number;
+    height?: number;
+    compound?: boolean;
+    rankdir?: 'TB' | 'BT' | 'LR' | 'RL';
+    align?: 'UL' | 'UR' | 'DL' | 'DR';
+    nodesep?: number;
+    edgesep?: number;
+    ranksep?: number;
+    marginx?: number;
+    marginy?: number;
+    acyclicer?: 'greedy';
+    ranker?: 'network-simplex' | 'tight-tree' | 'longest-path';
+    rankalign?: 'top' | 'center' | 'bottom';
+    nestingRoot?: string;
+    nodeRankFactor?: number;
+    dummyChains?: string[];
+    [key: string]: unknown;
+}
+export interface NodeConfig {
+    width?: number;
+    height?: number;
+}
+export interface EdgeConfig {
+    minlen?: number;
+    weight?: number;
+    width?: number;
+    height?: number;
+    labelpos?: 'l' | 'c' | 'r';
+    labeloffset?: number;
+}
+export interface OrderOptions {
+    customOrder?: (graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, order: (graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, opts?: LayoutOptions, oldNodes?: NodeCollection) => void) => void;
+    disableOptimalOrderHeuristic?: boolean;
+    constraints?: OrderConstraint[];
+}
+export interface LayoutConfig extends OrderOptions {
+    useDynamic?: boolean;
+    corePath?: string[];
+}
+export interface OrderConstraint {
+    left: string;
+    right: string;
+}
+export type LayoutOptions = GraphLabel & NodeConfig & EdgeConfig & LayoutConfig;
+export type RankerFunction = (graph: Graph<GraphLabel, NodeLabel, EdgeLabel>) => void;
+export type WeightFunction = (edge: Edge) => number;
+export type TimingFunction = (name: string, fn: () => void) => void;
+export type WeightMap = {
+    [key: string]: number;
+};
+export interface PartitionResult<T> {
+    lhs: T[];
+    rhs: T[];
+}
+export interface ListEntry<T> {
+    value: T;
+    prev?: ListEntry<T>;
+    next?: ListEntry<T>;
+}
+export interface Edge {
+    v: string;
+    w: string;
+    name?: string;
+}
+export type NodeCollection = Record<string, NodeLabel> | null;
+//# sourceMappingURL=types.d.ts.map

package/dist/types/lib/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../lib/types.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,KAAK,EAAC,MAAM,mBAAmB,CAAC;AAExC,YAAY,EAAC,KAAK,EAAE,IAAI,IAAI,SAAS,EAAC,MAAM,mBAAmB,CAAC;AAGhE,MAAM,WAAW,KAAK;IAClB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACb;AAGD,MAAM,WAAW,SAAS;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,KAAK,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,YAAY,GAAG,YAAY,GAAG,UAAU,GAAG,MAAM,CAAC;IAC9E,UAAU,CAAC,EAAE,YAAY,GAAG,aAAa,CAAC;IAC1C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IACvB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAC3B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,OAAO,CAAC,EAAE,IAAI,CAAC;IACf;;OAEG;IACH,OAAO,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;IACpC;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,KAAK,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;IAElC,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CAC1B;AAGD,MAAM,WAAW,SAAS;IACtB,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,OAAO,CAAC,EAAE,IAAI,CAAC;IAEf,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CAC1B;AAGD,MAAM,WAAW,UAAU;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,OAAO,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;IACpC,KAAK,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;IAClC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,SAAS,CAAC,EAAE,QAAQ,CAAC;IACrB,MAAM,CAAC,EAAE,iBAAiB,GAAG,YAAY,GAAG,cAAc,CAAC;IAC3D,SAAS,CAAC,EAAE,KAAK,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACxC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IAEvB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CAC1B;AAGD,MAAM,WAAW,UAAU;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,UAAU;IACvB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,YAAY;IACzB,WAAW,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,EAAE,aAAa,EAAE,QAAQ,CAAC,EAAE,cAAc,KAAK,IAAI,KAAK,IAAI,CAAC;IACzL,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,WAAW,CAAC,EAAE,eAAe,EAAE,CAAC;CACnC;AAED,MAAM,WAAW,YAAa,SAAQ,YAAY;IAC9C,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAGD,MAAM,WAAW,eAAe;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACjB;AAGD,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,UAAU,GAAG,UAAU,GAAG,YAAY,CAAC;AAGhF,MAAM,MAAM,cAAc,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,KAAK,IAAI,CAAC;AACtF,MAAM,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC;AACpD,MAAM,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,IAAI,KAAK,IAAI,CAAC;AAGpE,MAAM,MAAM,SAAS,GAAG;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,CAAC;AAElD,MAAM,WAAW,eAAe,CAAC,CAAC;IAC9B,GAAG,EAAE,CAAC,EAAE,CAAC;IACT,GAAG,EAAE,CAAC,EAAE,CAAC;CACZ;AAED,MAAM,WAAW,SAAS,CAAC,CAAC;IACxB,KAAK,EAAE,CAAC,CAAC;IACT,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;CACvB;AAGD,MAAM,WAAW,IAAI;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,IAAI,CAAA"}

package/dist/types/lib/util.d.ts

@@ -0,0 +1,40 @@
+import { Graph } from "./graph-lib";
+import type { EdgeLabel, GraphLabel, NodeCollection, NodeLabel, PartitionResult, Point } from "./types";
+export { addBorderNode, addDummyNode, applyWithChunking, asNonCompoundGraph, buildLayerMatrix, compareByOldOrder, intersectRect, mapValues, maxRank, normalizeRanks, notime, partition, pick, predecessorWeights, range, removeEmptyRanks, simplify, successorWeights, time, uniqueId, zipObject, };
+declare function addDummyNode(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, type: 'root' | "edge" | "border" | "edge-label" | "edge-proxy" | "selfedge", attrs: Partial<NodeLabel>, name: string): string;
+declare function simplify(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Graph<GraphLabel, NodeLabel, EdgeLabel>;
+declare function asNonCompoundGraph(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Graph<GraphLabel, NodeLabel, EdgeLabel>;
+declare function successorWeights(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): {
+    [key: string]: {
+        [key: string]: number;
+    };
+};
+declare function predecessorWeights(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): {
+    [key: string]: {
+        [key: string]: number;
+    };
+};
+declare function intersectRect(rect: NodeLabel, point: Point): Point;
+declare function buildLayerMatrix(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): string[][];
+declare function normalizeRanks(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+declare function removeEmptyRanks(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void;
+declare function addBorderNode(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, prefix: string, rank?: number, order?: number): string;
+declare function applyWithChunking(fn: (...args: number[]) => number, argsArray: number[]): number;
+declare function maxRank(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): number;
+declare function partition<T>(collection: T[], fn: (value: T) => boolean): PartitionResult<T>;
+declare function time<T>(name: string, fn: () => T): T;
+declare function notime<T>(name: string, fn: () => T): T;
+declare function uniqueId(prefix: string): string;
+declare function range(start: number, limit?: number, step?: number): number[];
+declare function pick<T extends Record<string, unknown>>(source: T, keys: string[]): Partial<T>;
+declare function mapValues<T, R>(obj: {
+    [key: string]: T;
+}, funcOrProp: ((val: T, key: string) => R) | string): {
+    [key: string]: R;
+};
+declare function zipObject<T>(props: string[], values: T[]): {
+    [key: string]: T;
+};
+export declare const GRAPH_NODE = "\0";
+declare function compareByOldOrder(oldNodes: NodeCollection, nodeA: NodeLabel, nodeB: NodeLabel): number;
+//# sourceMappingURL=util.d.ts.map