@statelyai/graph 0.13.0 → 1.0.0

package/dist/index.d.mts

@@ -1,631 +1,6 @@
-import { A as VisualEdge, C as NodeConfig, D as SinglePathOptions, E as PortDirection, F as VisualNode, I as VisualPort, L as WalkContext, M as VisualGraphConfig, N as VisualGraphEntity, O as TransitionOptions, P as VisualGraphFormatConverter, R as WalkOptions, S as NodeChange, T as PortConfig, _ as GraphPatch, a as EdgeChange, b as GraphStep, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphNode, h as GraphFormatConverter, i as DeleteNodeOptions, j as VisualGraph, k as TraversalOptions, l as EntityRect, m as GraphEntity, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, t as AStarOptions, u as Graph, v as GraphPath, w as PathOptions, x as MSTOptions, y as GraphPort, z as WeightedWalkOptions } from "./types-CnZ01raw.mjs";
-import { A as genCycles, B as getStronglyConnectedComponents, C as getMinimumSpanningTree, D as getPostorders, E as getPostorder, F as getCycles, G as getTopologicalSort, H as bfs, I as getShortestPath, J as isConnected, K as hasPath, L as getShortestPaths, M as genSimplePaths, N as getAStarPath, O as getPreorder, P as getAllPairsShortestPaths, R as getSimplePath, S as getPageRank, T as genPreorders, U as dfs, V as joinPaths, W as getConnectedComponents, Y as isTree, _ as getDegreeCentrality, a as getBridges, b as getInDegreeCentrality, c as genGirvanNewmanCommunities, d as getLabelPropagationCommunities, f as getModularity, g as getClosenessCentrality, h as getBetweennessCentrality, i as getBiconnectedComponents, j as genShortestPaths, k as getPreorders, l as getGirvanNewmanCommunities, m as IterativeCentralityOptions, n as isIsomorphic, o as GirvanNewmanOptions, p as HITSResult, q as isAcyclic, r as getArticulationPoints, s as LabelPropagationOptions, t as IsomorphismOptions, u as getGreedyModularityCommunities, v as getEigenvectorCentrality, w as genPostorders, x as getOutDegreeCentrality, y as getHITS, z as getSimplePaths } from "./algorithms-BlM-qoJb.mjs";
-import { createFormatConverter } from "./formats/converter/index.mjs";
-import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgesBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
-
-//#region src/graph.d.ts
-
-/**
- * Create a resolved graph port from a config. Fills in defaults.
- *
- * @example
- * ```ts
- * const port = createGraphPort({ name: 'output', direction: 'out' });
- * // { name: 'output', direction: 'out', data: null }
- * ```
- */
-declare function createGraphPort<P = any>(config: PortConfig<P>): GraphPort<P>;
-/**
- * Create a resolved graph node from a config. Fills in defaults.
- *
- * @example
- * ```ts
- * const node = createGraphNode({ id: 'a', data: { label: 'hi' } });
- * // { type: 'node', id: 'a', label: '', data: { label: 'hi' } }
- * ```
- */
-declare function createGraphNode<N = any, P = any>(config: NodeConfig<N, P>): GraphNode<N, P>;
-/**
- * Create a resolved graph edge from a config. Fills in defaults.
- *
- * @example
- * ```ts
- * const edge = createGraphEdge({ id: 'e1', sourceId: 'a', targetId: 'b' });
- * // { type: 'edge', id: 'e1', sourceId: 'a', targetId: 'b', label: null, data: null }
- * ```
- */
-declare function createGraphEdge<T = any>(config: EdgeConfig<T>): GraphEdge<T>;
-/**
- * Create a graph from a config. Resolves defaults for all fields.
- *
- * @example
- * ```ts
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
- * });
- * ```
- */
-declare function createGraph<N = any, E = any, G = any, P = any>(config?: GraphConfig<N, E, G, P>): Graph<N, E, G, P>;
-/**
- * Create a visual graph with required position/size on all nodes and edges.
- *
- * @example
- * ```ts
- * const graph = createVisualGraph({
- *   nodes: [{ id: 'a', x: 0, y: 0, width: 100, height: 50 }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'a', x: 0, y: 0, width: 0, height: 0 }],
- * });
- * // graph.nodes[0].x === 0
- * ```
- */
-declare function createVisualGraph<N = any, E = any, G = any, P = any>(config?: VisualGraphConfig<N, E, G, P>): VisualGraph<N, E, G, P>;
-/**
- * Create a graph by BFS exploration of a transition function.
- * Each unique state becomes a node; each (state, event) -> nextState becomes an edge.
- *
- * - Node IDs are determined by `serializeState` (default: `JSON.stringify`).
- * - Edge IDs use the format `sourceId|serializedEvent|targetId` for uniqueness
- *   and debuggability. Edge labels are just the serialized event string.
- *
- * @example
- * ```ts
- * const graph = createGraphFromTransition(
- *   (state, event) => {
- *     if (state === 'green' && event === 'TIMER') return 'yellow';
- *     if (state === 'yellow' && event === 'TIMER') return 'red';
- *     if (state === 'red' && event === 'TIMER') return 'green';
- *     return state;
- *   },
- *   {
- *     initialState: 'green',
- *     events: ['TIMER'],
- *     serializeState: (s) => s,
- *     serializeEvent: (e) => e,
- *   },
- * );
- * // graph.nodes.length === 3
- * ```
- */
-declare function createGraphFromTransition<TState, TEvent>(transition: (state: TState, event: TEvent) => TState, options: TransitionOptions<TState, TEvent>): Graph<TState, TEvent>;
-/**
- * Get a node by id, or `undefined` if not found.
- *
- * @example
- * ```ts
- * const graph = createGraph({ nodes: [{ id: 'a' }] });
- * const node = getNode(graph, 'a'); // GraphNode
- * const missing = getNode(graph, 'z'); // undefined
- * ```
- */
-declare function getNode<N>(graph: Graph<N>, id: string): GraphNode<N> | undefined;
-/**
- * Get an edge by id, or `undefined` if not found.
- *
- * @example
- * ```ts
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
- * });
- * const edge = getEdge(graph, 'e1'); // GraphEdge
- * const missing = getEdge(graph, 'z'); // undefined
- * ```
- */
-declare function getEdge<N, E>(graph: Graph<N, E>, id: string): GraphEdge<E> | undefined;
-/**
- * Check if a node exists in the graph.
- *
- * @example
- * ```ts
- * const graph = createGraph({ nodes: [{ id: 'a' }] });
- * hasNode(graph, 'a'); // true
- * hasNode(graph, 'z'); // false
- * ```
- */
-declare function hasNode(graph: Graph, id: string): boolean;
-/**
- * Check if an edge exists in the graph.
- *
- * @example
- * ```ts
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
- * });
- * hasEdge(graph, 'e1'); // true
- * hasEdge(graph, 'z'); // false
- * ```
- */
-declare function hasEdge(graph: Graph, id: string): boolean;
-/**
- * **Mutable.** Add a node to the graph. Mutates `graph.nodes` in place.
- * @returns The resolved node that was added.
- *
- * @example
- * ```ts
- * const graph = createGraph();
- * const node = addNode(graph, { id: 'a', label: 'Node A' });
- * // graph.nodes.length === 1
- * ```
- */
-declare function addNode<N, P = any>(graph: Graph<N, any, any, P>, config: NodeConfig<N, P>): GraphNode<N, P>;
-/**
- * **Mutable.** Add an edge to the graph. Mutates `graph.edges` in place.
- * @returns The resolved edge that was added.
- *
- * @example
- * ```ts
- * const graph = createGraph({ nodes: [{ id: 'a' }, { id: 'b' }] });
- * const edge = addEdge(graph, { id: 'e1', sourceId: 'a', targetId: 'b' });
- * // graph.edges.length === 1
- * ```
- */
-declare function addEdge<N, E>(graph: Graph<N, E>, config: EdgeConfig<E>): GraphEdge<E>;
-/**
- * **Mutable.** Delete a node and its connected edges. Mutates `graph.nodes`
- * and `graph.edges` in place.
- *
- * By default, children are deleted recursively.
- * With `{ reparent: true }`, children are re-parented to the deleted node's parent.
- *
- * @example
- * ```ts
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
- * });
- * deleteNode(graph, 'a');
- * // graph.nodes.length === 1, edge e1 also removed
- * ```
- */
-declare function deleteNode(graph: Graph, id: string, opts?: DeleteNodeOptions): void;
-/**
- * **Mutable.** Delete an edge. Mutates `graph.edges` in place.
- *
- * @example
- * ```ts
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
- * });
- * deleteEdge(graph, 'e1');
- * // graph.edges.length === 0
- * ```
- */
-declare function deleteEdge(graph: Graph, id: string): void;
-/**
- * **Mutable.** Update a node in place.
- * @returns The updated node.
- *
- * @example
- * ```ts
- * const graph = createGraph({ nodes: [{ id: 'a', label: 'old' }] });
- * const updated = updateNode(graph, 'a', { label: 'new' });
- * // updated.label === 'new'
- * ```
- */
-declare function updateNode<N, P = any>(graph: Graph<N, any, any, P>, id: string, update: Partial<Omit<NodeConfig<N, P>, 'id'>>): GraphNode<N, P>;
-/**
- * **Mutable.** Update an edge in place.
- * @returns The updated edge.
- *
- * @example
- * ```ts
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b', label: 'old' }],
- * });
- * const updated = updateEdge(graph, 'e1', { label: 'new' });
- * // updated.label === 'new'
- * ```
- */
-declare function updateEdge<N, E>(graph: Graph<N, E>, id: string, update: Partial<Omit<EdgeConfig<E>, 'id'>>): GraphEdge<E>;
-/**
- * **Mutable.** Add multiple nodes and edges to the graph.
- * Nodes are added first, then edges (so edges can reference new nodes).
- *
- * @example
- * ```ts
- * const graph = createGraph();
- * addEntities(graph, {
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
- * });
- * // graph.nodes.length === 2, graph.edges.length === 1
- * ```
- */
-declare function addEntities<N, E>(graph: Graph<N, E>, entities: EntitiesConfig<N, E>): void;
-/**
- * **Mutable.** Delete entities by id(s). Automatically detects whether each id
- * is a node or edge. Node deletions cascade to children and connected edges.
- *
- * @example
- * ```ts
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
- * });
- * deleteEntities(graph, ['a', 'e1']);
- * // graph.nodes.length === 1, graph.edges.length === 0
- * ```
- */
-declare function deleteEntities(graph: Graph, ids: string | string[], opts?: DeleteNodeOptions): void;
-/**
- * **Mutable.** Update multiple nodes and edges in place.
- * Each entry must include an `id` to identify which entity to update.
- *
- * @example
- * ```ts
- * const graph = createGraph({
- *   nodes: [{ id: 'a', label: 'old' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'a', label: 'old' }],
- * });
- * updateEntities(graph, {
- *   nodes: [{ id: 'a', label: 'new' }],
- *   edges: [{ id: 'e1', label: 'new' }],
- * });
- * ```
- */
-declare function updateEntities<N, E>(graph: Graph<N, E>, updates: EntitiesUpdate<N, E>): void;
-/**
- * OOP wrapper around a plain `Graph` object.
- * Delegates to the standalone mutable functions.
- *
- * @example
- * ```ts
- * const instance = new GraphInstance({
- *   nodes: [{ id: 'a' }, { id: 'b' }],
- *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
- * });
- * instance.addNode({ id: 'c' });
- * instance.hasNode('c'); // true
- * instance.toJSON(); // plain Graph object
- * ```
- */
-declare class GraphInstance<N = any, E = any, G = any, P = any> {
-  graph: Graph<N, E, G, P>;
-  constructor(config?: GraphConfig<N, E, G, P>);
-  /**
-   * Wrap an existing plain graph object.
-   *
-   * @example
-   * ```ts
-   * const graph = createGraph({ nodes: [{ id: 'a' }] });
-   * const instance = GraphInstance.from(graph);
-   * instance.hasNode('a'); // true
-   * ```
-   */
-  static from<N = any, E = any, G = any, P = any>(graph: Graph<N, E, G, P>): GraphInstance<N, E, G, P>;
-  get id(): string;
-  get type(): "directed" | "undirected";
-  get nodes(): GraphNode<N, P>[];
-  get edges(): GraphEdge<E>[];
-  get data(): G;
-  getNode(id: string): GraphNode<N, any> | undefined;
-  getEdge(id: string): GraphEdge<E> | undefined;
-  hasNode(id: string): boolean;
-  hasEdge(id: string): boolean;
-  addNode(config: NodeConfig<N, P>): GraphNode<N, P>;
-  addEdge(config: EdgeConfig<E>): GraphEdge<E>;
-  deleteNode(id: string, opts?: DeleteNodeOptions): void;
-  deleteEdge(id: string): void;
-  updateNode(id: string, update: Partial<Omit<NodeConfig<N, P>, 'id'>>): GraphNode<N, P>;
-  updateEdge(id: string, update: Partial<Omit<EdgeConfig<E>, 'id'>>): GraphEdge<E>;
-  addEntities(entities: EntitiesConfig<N, E, P>): void;
-  deleteEntities(ids: string | string[], opts?: DeleteNodeOptions): void;
-  updateEntities(updates: EntitiesUpdate<N, E, P>): void;
-  toJSON(): Graph<N, E, G, P>;
-}
-//#endregion
-//#region src/indexing.d.ts
-/**
- * Clear the cached index. Call this if you mutate graph.nodes/edges directly.
- *
- * @example
- * ```ts
- * import { createGraph, invalidateIndex, getIndex } from '@statelyai/graph';
- *
- * const graph = createGraph({ nodes: [{ id: 'a' }], edges: [] });
- * // manually mutate nodes array
- * graph.nodes.push({ type: 'node', id: 'b', parentId: null, initialNodeId: null, label: '', data: undefined });
- * invalidateIndex(graph); // forces rebuild on next getIndex()
- * ```
- */
-declare function invalidateIndex(graph: Graph): void;
-//#endregion
-//#region src/equivalence.d.ts
-declare const LAYOUT_KEYS: {
-  node: readonly ["x", "y", "width", "height", "style", "color", "shape"];
-  edge: readonly ["x", "y", "width", "height", "style", "color"];
-};
-/**
- * Compare two entities on a given set of keys.
- * If `keys` is omitted or empty, compares all own keys of `a`.
- *
- * @example
- * ```ts
- * import { createGraphNode, areEntitiesEqual, LAYOUT_KEYS } from '@statelyai/graph';
- *
- * const a = createGraphNode({ id: 'n1', label: 'hello', x: 0 });
- * const b = createGraphNode({ id: 'n1', label: 'hello', x: 100 });
- *
- * areEntitiesEqual(a, b, LAYOUT_KEYS.node); // false (x differs)
- * areEntitiesEqual(a, b, NON_LAYOUT_KEYS.node); // true
- * areEntitiesEqual(a, b); // false (compares all keys)
- * ```
- */
-declare function areEntitiesEqual<T extends GraphNode | GraphEdge>(a: T, b: T, keys?: readonly (keyof T)[]): boolean;
-/**
- * Compare two entities on layout keys only (position, size, style, color, shape).
- *
- * @example
- * ```ts
- * import { createGraphNode, isLayoutEqual } from '@statelyai/graph';
- *
- * const a = createGraphNode({ id: 'n1', x: 0, y: 0 });
- * const b = createGraphNode({ id: 'n1', x: 100, y: 200 });
- *
- * isLayoutEqual(a, b); // false
- * ```
- */
-declare function isLayoutEqual<T extends GraphNode | GraphEdge>(a: T, b: T): boolean;
-/**
- * Compare two entities on non-layout keys only (id, data, connections, labels, etc.).
- *
- * @example
- * ```ts
- * import { createGraphNode, isNonLayoutEqual } from '@statelyai/graph';
- *
- * const a = createGraphNode({ id: 'n1', label: 'hello', x: 0 });
- * const b = createGraphNode({ id: 'n1', label: 'hello', x: 100 });
- *
- * isNonLayoutEqual(a, b); // true (layout changed, but non-layout didn't)
- * ```
- */
-declare function isNonLayoutEqual<T extends GraphNode | GraphEdge>(a: T, b: T): boolean;
-//#endregion
-//#region src/diff.d.ts
-/**
- * Compute a structured diff from graph `a` to graph `b` by matching IDs.
- *
- * @example
- * ```ts
- * import { createGraph, getDiff } from '@statelyai/graph';
- *
- * const a = createGraph({ nodes: [{ id: 'n1' }], edges: [] });
- * const b = createGraph({ nodes: [{ id: 'n1', label: 'hello' }, { id: 'n2' }], edges: [] });
- *
- * const diff = getDiff(a, b);
- * // diff.nodes.added → [{ id: 'n2' }]
- * // diff.nodes.updated → [{ id: 'n1', old: { label: '' }, new: { label: 'hello' } }]
- * ```
- */
-declare function getDiff<N, E>(a: Graph<N, E>, b: Graph<N, E>): GraphDiff<N, E>;
-/**
- * Check if a diff has zero changes.
- *
- * @example
- * ```ts
- * import { createGraph, getDiff, isEmptyDiff } from '@statelyai/graph';
- *
- * const g = createGraph({ nodes: [{ id: 'n1' }], edges: [] });
- * const diff = getDiff(g, g);
- * isEmptyDiff(diff); // true
- * ```
- */
-declare function isEmptyDiff(diff: GraphDiff): boolean;
-/**
- * Invert a diff: swap added/removed, swap old/new in updates.
- *
- * @example
- * ```ts
- * import { createGraph, getDiff, invertDiff } from '@statelyai/graph';
- *
- * const a = createGraph({ nodes: [{ id: 'n1' }], edges: [] });
- * const b = createGraph({ nodes: [{ id: 'n2' }], edges: [] });
- *
- * const diff = getDiff(a, b);
- * const inv = invertDiff(diff);
- * // inv.nodes.added contains n1 (was removed)
- * // inv.nodes.removed contains n2 (was added)
- * ```
- */
-declare function invertDiff<N, E>(diff: GraphDiff<N, E>): GraphDiff<N, E>;
-/**
- * Compute an ordered patch list from graph `a` to graph `b`.
- * Order: delete edges → delete nodes → add nodes → add edges → update nodes → update edges.
- *
- * @example
- * ```ts
- * import { createGraph, getPatches } from '@statelyai/graph';
- *
- * const a = createGraph({ nodes: [{ id: 'n1' }], edges: [] });
- * const b = createGraph({ nodes: [{ id: 'n1' }, { id: 'n2' }], edges: [] });
- *
- * const patches = getPatches(a, b);
- * // patches → [{ op: 'addNode', node: { id: 'n2' } }]
- * ```
- */
-declare function getPatches<N, E>(a: Graph<N, E>, b: Graph<N, E>): GraphPatch<N, E>[];
-/**
- * **Mutable.** Apply patches to a graph in order.
- * Delegates to addNode/deleteNode/updateNode/addEdge/deleteEdge/updateEdge.
- *
- * @example
- * ```ts
- * import { createGraph, getPatches, applyPatches } from '@statelyai/graph';
- *
- * const a = createGraph({ nodes: [{ id: 'n1' }], edges: [] });
- * const b = createGraph({ nodes: [{ id: 'n1' }, { id: 'n2' }], edges: [] });
- *
- * const patches = getPatches(a, b);
- * applyPatches(a, patches);
- * // a now contains both n1 and n2
- * ```
- */
-declare function applyPatches<N, E>(graph: Graph<N, E>, patches: GraphPatch<N, E>[]): void;
-/**
- * Flatten a structured diff into an ordered patch list.
- * Order: add nodes → update edges → delete edges → delete nodes → add edges → update nodes.
- * This avoids cascading deletes removing edges that are being updated,
- * and ensures new nodes exist before edges reference them.
- *
- * @example
- * ```ts
- * import { createGraph, getDiff, toPatches } from '@statelyai/graph';
- *
- * const a = createGraph({ nodes: [{ id: 'n1' }], edges: [] });
- * const b = createGraph({ nodes: [{ id: 'n2' }], edges: [] });
- *
- * const diff = getDiff(a, b);
- * const patches = toPatches(diff);
- * // patches → [{ op: 'addNode', ... }, { op: 'deleteNode', ... }]
- * ```
- */
-declare function toPatches<N, E>(diff: GraphDiff<N, E>): GraphPatch<N, E>[];
-/**
- * Group a patch list into a structured diff.
- *
- * @example
- * ```ts
- * import { createGraph, getPatches, toDiff } from '@statelyai/graph';
- *
- * const a = createGraph({ nodes: [{ id: 'n1' }], edges: [] });
- * const b = createGraph({ nodes: [{ id: 'n1' }, { id: 'n2' }], edges: [] });
- *
- * const patches = getPatches(a, b);
- * const diff = toDiff(patches);
- * // diff.nodes.added → [{ id: 'n2' }]
- * ```
- */
-declare function toDiff<N, E>(patches: GraphPatch<N, E>[]): GraphDiff<N, E>;
-//#endregion
-//#region src/transforms.d.ts
-/**
- * Flattens a hierarchical graph into a flat graph with only leaf nodes.
- *
- * - Edges targeting a compound node resolve to its initial child (recursively).
- * - Edges originating from a compound node expand to all leaf descendants.
- * - Only leaf nodes (nodes with no children) appear in the result.
- * - Duplicate edges (same source + target) are deduplicated.
- *
- * @example
- * ```ts
- * import { createGraph, flatten } from '@statelyai/graph';
- *
- * const graph = createGraph({
- *   nodes: [
- *     { id: 'parent', initialNodeId: 'child1' },
- *     { id: 'child1', parentId: 'parent' },
- *     { id: 'child2', parentId: 'parent' },
- *     { id: 'other' },
- *   ],
- *   edges: [{ id: 'e1', sourceId: 'other', targetId: 'parent' }],
- * });
- *
- * const flat = flatten(graph);
- * // flat.nodes → [child1, child2, other] (leaf nodes only)
- * // flat.edges → edge from 'other' → 'child1' (resolved via initialNodeId)
- * ```
- */
-declare function flatten<N, E, G>(graph: Graph<N, E, G>): Graph<N, E, G>;
-/**
- * Returns the induced subgraph containing only the given node IDs
- * and edges whose endpoints are both in the set.
- *
- * Parent references to nodes outside the set are removed.
- *
- * @example
- * ```ts
- * import { createGraph, getSubgraph } from '@statelyai/graph';
- *
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }, { id: 'c' }],
- *   edges: [
- *     { id: 'ab', sourceId: 'a', targetId: 'b' },
- *     { id: 'bc', sourceId: 'b', targetId: 'c' },
- *   ],
- * });
- *
- * const sub = getSubgraph(graph, ['a', 'b']);
- * // sub.nodes: [a, b], sub.edges: [ab]
- * ```
- */
-declare function getSubgraph<N, E, G>(graph: Graph<N, E, G>, nodeIds: string[]): Graph<N, E, G>;
-/**
- * Returns a new graph with all edge directions flipped (source ↔ target).
- * Optionally filters which edges to include.
- *
- * @example
- * ```ts
- * import { createGraph, reverseGraph } from '@statelyai/graph';
- *
- * const graph = createGraph({
- *   nodes: [{ id: 'a' }, { id: 'b' }, { id: 'c' }],
- *   edges: [
- *     { id: 'ab', sourceId: 'a', targetId: 'b' },
- *     { id: 'bc', sourceId: 'b', targetId: 'c' },
- *   ],
- * });
- *
- * const rev = reverseGraph(graph);
- * // rev edges: b→a, c→b
- *
- * const filtered = reverseGraph(graph, (e) => e.id !== 'bc');
- * // filtered edges: b→a (only ab reversed, bc excluded)
- * ```
- */
-declare function reverseGraph<N, E, G>(graph: Graph<N, E, G>, filterEdge?: (edge: GraphEdge<E>) => boolean): Graph<N, E, G>;
-//#endregion
-//#region src/walks.d.ts
-/**
- * Random walk. At each node, picks a uniformly random outgoing edge.
- * Yields steps indefinitely (may revisit nodes) until a sink node is reached.
- */
-declare function genRandomWalk<N, E>(graph: Graph<N, E>, options?: WalkOptions<E>): Generator<GraphStep<N, E>>;
-/**
- * Weighted random walk. Edge selection probability proportional to weight.
- */
-declare function genWeightedRandomWalk<N, E>(graph: Graph<N, E>, options?: WeightedWalkOptions<E>): Generator<GraphStep<N, E>>;
-/**
- * Quick random walk targeting unvisited edges.
- * If unvisited outgoing edges exist, picks one randomly.
- * Otherwise, finds shortest path to a node with unvisited outgoing edges.
- */
-declare function genQuickRandomWalk<N, E>(graph: Graph<N, E>, options?: WalkOptions<E>): Generator<GraphStep<N, E>>;
-/**
- * Walk a predefined sequence of edge IDs.
- * Validates each edge exists and connects from the current position.
- */
-declare function genPredefinedWalk<N, E>(graph: Graph<N, E>, edgeIds: string[], options?: Pick<WalkOptions<E>, 'from'>): Generator<GraphStep<N, E>>;
-/**
- * Yield at most `n` steps from the source generator.
- */
-declare function takeSteps<N, E>(gen: Generator<GraphStep<N, E>>, n: number): Generator<GraphStep<N, E>>;
-/**
- * Yield steps until a specific node is reached.
- */
-declare function takeUntilNode<N, E>(gen: Generator<GraphStep<N, E>>, nodeId: string): Generator<GraphStep<N, E>>;
-/**
- * Yield steps until a specific edge is traversed.
- */
-declare function takeUntilEdge<N, E>(gen: Generator<GraphStep<N, E>>, edgeId: string): Generator<GraphStep<N, E>>;
-/**
- * Yield steps until node coverage reaches the target (0–1).
- */
-declare function takeUntilNodeCoverage<N, E>(gen: Generator<GraphStep<N, E>>, graph: Graph<N, E>, coverage: number, options?: {
-  from?: string;
-}): Generator<GraphStep<N, E>>;
-/**
- * Yield steps until edge coverage reaches the target (0–1).
- */
-declare function takeUntilEdgeCoverage<N, E>(gen: Generator<GraphStep<N, E>>, graph: Graph<N, E>, coverage: number): Generator<GraphStep<N, E>>;
-/**
- * Compute coverage statistics for a completed walk.
- */
-declare function getCoverage<N, E>(graph: Graph<N, E>, steps: GraphStep<N, E>[], options?: {
-  from?: string;
-}): CoverageStats;
-//#endregion
-export { type AStarOptions, type AllPairsShortestPathsOptions, type CoverageStats, type DeleteNodeOptions, type EdgeChange, type EdgeConfig, type EntitiesConfig, type EntitiesUpdate, type EntityRect, type GirvanNewmanOptions, type Graph, type GraphConfig, type GraphDiff, type GraphEdge, type GraphEntity, type GraphFormatConverter, GraphInstance, type GraphNode, type GraphPatch, type GraphPath, type GraphPort, type GraphStep, type HITSResult, type IsomorphismOptions, type IterativeCentralityOptions, LAYOUT_KEYS, type LabelPropagationOptions, type MSTOptions, type NodeChange, type NodeConfig, type PathOptions, type PortConfig, type PortDirection, type SinglePathOptions, type TransitionOptions, type TraversalOptions, type VisualEdge, type VisualGraph, type VisualGraphConfig, type VisualGraphEntity, type VisualGraphFormatConverter, type VisualNode, type VisualPort, type WalkContext, type WalkOptions, type WeightedWalkOptions, addEdge, addEntities, addNode, applyPatches, areEntitiesEqual, bfs, createFormatConverter, createGraph, createGraphEdge, createGraphFromTransition, createGraphNode, createGraphPort, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genGirvanNewmanCommunities, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getArticulationPoints, getBetweennessCentrality, getBiconnectedComponents, getBridges, getChildren, getClosenessCentrality, getConnectedComponents, getCoverage, getCycles, getDegree, getDegreeCentrality, getDepth, getDescendants, getDiff, getEdge, getEdgesBetween, getEdgesByPort, getEdgesOf, getEigenvectorCentrality, getGirvanNewmanCommunities, getGreedyModularityCommunities, getHITS, getInDegree, getInDegreeCentrality, getInEdges, getLCA, getLabelPropagationCommunities, getMinimumSpanningTree, getModularity, getNeighbors, getNode, getOutDegree, getOutDegreeCentrality, getOutEdges, getPageRank, getParent, getPatches, getPort, getPorts, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isIsomorphic, isLayoutEqual, isLeaf, isNonLayoutEqual, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };
+import { A as TraversalOptions, B as WeightedWalkOptions, C as NodeChange, D as PortDirection, E as PortConfig, F as VisualGraphFormatConverter, I as VisualNode, L as VisualPort, M as VisualGraph, N as VisualGraphConfig, O as SinglePathOptions, P as VisualGraphEntity, R as WalkContext, S as MSTOptions, T as PathOptions, _ as GraphNode, a as EdgeChange, b as GraphPort, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphMode, h as GraphFormatConverter, i as DeleteNodeOptions, j as VisualEdge, k as TransitionOptions, l as EntityRect, m as GraphEntity, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, t as AStarOptions, u as Graph, v as GraphPatch, w as NodeConfig, x as GraphStep, y as GraphPath, z as WalkOptions } from "./types-3-FS9NV2.mjs";
+import { A as genCycles, B as getStronglyConnectedComponents, C as getMinimumSpanningTree, D as getPostorders, E as getPostorder, F as getCycles, G as getTopologicalSort, H as bfs, I as getShortestPath, J as isConnected, K as hasPath, L as getShortestPaths, M as genSimplePaths, N as getAStarPath, O as getPreorder, P as getAllPairsShortestPaths, R as getSimplePath, S as getPageRank, T as genPreorders, U as dfs, V as joinPaths, W as getConnectedComponents, Y as isTree, _ as getDegreeCentrality, a as getBridges, b as getInDegreeCentrality, c as genGirvanNewmanCommunities, d as getLabelPropagationCommunities, f as getModularity, g as getClosenessCentrality, h as getBetweennessCentrality, i as getBiconnectedComponents, j as genShortestPaths, k as getPreorders, l as getGirvanNewmanCommunities, m as IterativeCentralityOptions, n as isIsomorphic, o as GirvanNewmanOptions, p as HITSResult, q as isAcyclic, r as getArticulationPoints, s as LabelPropagationOptions, t as IsomorphismOptions, u as getGreedyModularityCommunities, v as getEigenvectorCentrality, w as genPostorders, x as getOutDegreeCentrality, y as getHITS, z as getSimplePaths } from "./algorithms-fTqmvhzP.mjs";
+import { n as createFormatConverter } from "./index-D9Kj6Fe3.mjs";
+import { A as addEntities, B as deleteNode, C as isLayoutEqual, D as isEdgeDirected, E as getEdgeMode, F as createGraphNode, G as updateEdge, H as getNode, I as createGraphPort, K as updateEntities, L as createVisualGraph, M as createGraph, N as createGraphEdge, O as GraphInstance, P as createGraphFromTransition, R as deleteEdge, S as areEntitiesEqual, T as invalidateIndex, U as hasEdge, V as getEdge, W as hasNode, _ as invertDiff, a as getCoverage, b as toPatches, c as takeUntilEdgeCoverage, d as flatten, f as getSubgraph, g as getPatches, h as getDiff, i as genWeightedRandomWalk, j as addNode, k as addEdge, l as takeUntilNode, m as applyPatches, n as genQuickRandomWalk, o as takeSteps, p as reverseGraph, q as updateNode, r as genRandomWalk, s as takeUntilEdge, t as genPredefinedWalk, u as takeUntilNodeCoverage, v as isEmptyDiff, w as isNonLayoutEqual, x as LAYOUT_KEYS, y as toDiff, z as deleteEntities } from "./index-CHoriXZD.mjs";
+import { C as getSinks, D as isLeaf, E as isCompound, S as getSiblings, T as getSuccessors, _ as getPorts, a as getDescendants, b as getRelativeDistanceMap, c as getEdgesOf, d as getLCA, f as getNeighbors, g as getPort, h as getParent, i as getDepth, l as getInDegree, m as getOutEdges, n as getChildren, o as getEdgesBetween, p as getOutDegree, r as getDegree, s as getEdgesByPort, t as getAncestors, u as getInEdges, v as getPredecessors, w as getSources, x as getRoots, y as getRelativeDistance } from "./queries-BlkA1HAN.mjs";
+export { AStarOptions, AllPairsShortestPathsOptions, CoverageStats, DeleteNodeOptions, EdgeChange, EdgeConfig, EntitiesConfig, EntitiesUpdate, EntityRect, GirvanNewmanOptions, Graph, GraphConfig, GraphDiff, GraphEdge, GraphEntity, GraphFormatConverter, GraphInstance, GraphMode, GraphNode, GraphPatch, GraphPath, GraphPort, GraphStep, HITSResult, IsomorphismOptions, IterativeCentralityOptions, LAYOUT_KEYS, LabelPropagationOptions, MSTOptions, NodeChange, NodeConfig, PathOptions, PortConfig, PortDirection, SinglePathOptions, TransitionOptions, TraversalOptions, VisualEdge, VisualGraph, VisualGraphConfig, VisualGraphEntity, VisualGraphFormatConverter, VisualNode, VisualPort, WalkContext, WalkOptions, WeightedWalkOptions, addEdge, addEntities, addNode, applyPatches, areEntitiesEqual, bfs, createFormatConverter, createGraph, createGraphEdge, createGraphFromTransition, createGraphNode, createGraphPort, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genGirvanNewmanCommunities, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getArticulationPoints, getBetweennessCentrality, getBiconnectedComponents, getBridges, getChildren, getClosenessCentrality, getConnectedComponents, getCoverage, getCycles, getDegree, getDegreeCentrality, getDepth, getDescendants, getDiff, getEdge, getEdgeMode, getEdgesBetween, getEdgesByPort, getEdgesOf, getEigenvectorCentrality, getGirvanNewmanCommunities, getGreedyModularityCommunities, getHITS, getInDegree, getInDegreeCentrality, getInEdges, getLCA, getLabelPropagationCommunities, getMinimumSpanningTree, getModularity, getNeighbors, getNode, getOutDegree, getOutDegreeCentrality, getOutEdges, getPageRank, getParent, getPatches, getPort, getPorts, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEdgeDirected, isEmptyDiff, isIsomorphic, isLayoutEqual, isLeaf, isNonLayoutEqual, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };