export as namespace dagre; export namespace graphlib { class Graph { constructor( opt?: { directed?: boolean | undefined; multigraph?: boolean | undefined; compound?: boolean | undefined }, ); graph(): GraphLabel; isDirected(): boolean; isMultigraph(): boolean; setGraph(label: GraphLabel): Graph; edge(edgeObj: Edge): GraphEdge; edge(outNodeName: string, inNodeName: string, name?: string): GraphEdge; edgeCount(): number; edges(): Edge[]; hasEdge(edgeObj: Edge): boolean; hasEdge(outNodeName: string, inNodeName: string, name?: string): boolean; inEdges(inNodeName: string, outNodeName?: string): Edge[] | undefined; outEdges(outNodeName: string, inNodeName?: string): Edge[] | undefined; removeEdge(outNodeName: string, inNodeName: string, name?: string): Graph; setDefaultEdgeLabel(callback: string | ((v: string, w: string, name?: string) => string | Label)): Graph; setEdge(params: Edge, value?: string | { [key: string]: any }): Graph; setEdge(sourceId: string, targetId: string, value?: string | Label, name?: string): Graph; children(parentName: string): string | undefined; hasNode(name: string): boolean; neighbors(name: string): Array> | undefined; node(id: string | Label): Node; nodeCount(): number; nodes(): string[]; parent(childName: string): string | undefined; predecessors(name: string): Array> | undefined; removeNode(name: string): Graph; filterNodes(callback: (nodeId: string) => boolean): Graph; setDefaultNodeLabel(callback: string | ((nodeId: string) => string | Label)): Graph; setNode(name: string, label: string | Label): Graph; setParent(childName: string, parentName: string): void; sinks(): string[]; sources(): string[]; successors(name: string): Array> | undefined; } namespace json { function read(graph: any): Graph; function write(graph: Graph): any; } namespace alg { function components(graph: Graph): string[][]; function dijkstra( graph: Graph, source: string, weightFn?: WeightFn, edgeFn?: EdgeFn, ): Record; function dijkstraAll( graph: Graph, weightFn?: WeightFn, edgeFn?: EdgeFn, ): Record>; function findCycles(graph: Graph): string[][]; function floydWarshall( graph: Graph, weightFn?: WeightFn, edgeFn?: EdgeFn, ): Record>; function isAcyclic(graph: Graph): boolean; function postorder(graph: Graph, nodeNames: string | string[]): string[]; function preorder(graph: Graph, nodeNames: string | string[]): string[]; function prim(graph: Graph, weightFn?: WeightFn): Graph; function tarjam(graph: Graph): string[][]; function topsort(graph: Graph): string[]; } } export interface Label { [key: string]: any; } export type WeightFn = (edge: Edge) => number; export type EdgeFn = (outNodeName: string) => GraphEdge[]; export interface GraphLabel { width?: number | undefined; height?: number | undefined; compound?: boolean | undefined; rankdir?: string | undefined; align?: string | undefined; nodesep?: number | undefined; edgesep?: number | undefined; ranksep?: number | undefined; marginx?: number | undefined; marginy?: number | undefined; acyclicer?: string | undefined; ranker?: string | undefined; } export interface NodeConfig { width?: number | undefined; height?: number | undefined; } export interface EdgeConfig { minlen?: number | undefined; weight?: number | undefined; width?: number | undefined; height?: number | undefined; lablepos?: "l" | "c" | "r" | undefined; labeloffest?: number | undefined; } export function layout(graph: graphlib.Graph, layout?: GraphLabel & NodeConfig & EdgeConfig): void; export interface Edge { v: string; w: string; name?: string | undefined; } export interface GraphEdge { points: Array<{ x: number; y: number }>; [key: string]: any; } export type Node = T & { x: number; y: number; width: number; height: number; class?: string | undefined; label?: string | undefined; padding?: number | undefined; paddingX?: number | undefined; paddingY?: number | undefined; rx?: number | undefined; ry?: number | undefined; shape?: string | undefined; };