@statelyai/graph 1.0.0 → 2.0.0

package/dist/{index-D9Kj6Fe3.d.mts → index-D51lJnt2.d.mts}

@@ -1,4 +1,4 @@
-import { h as GraphFormatConverter, u as Graph } from "./types-3-FS9NV2.mjs";
+import { d as Graph, g as GraphFormatConverter } from "./types-DNYdIU21.mjs";
 
 //#region src/formats/converter/index.d.ts
 

package/dist/{index-CHoriXZD.d.mts → index-DWmo1mIp.d.mts}

@@ -1,4 +1,4 @@
-import { B as WeightedWalkOptions, E as PortConfig, M as VisualGraph, N as VisualGraphConfig, _ as GraphNode, b as GraphPort, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphMode, i as DeleteNodeOptions, k as TransitionOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, u as Graph, v as GraphPatch, w as NodeConfig, x as GraphStep, z as WalkOptions } from "./types-3-FS9NV2.mjs";
+import { E as NodeUpdate, F as VisualGraphConfig, H as WeightedWalkOptions, O as PortConfig, P as VisualGraph, S as GraphStep, T as NodeConfig, V as WalkOptions, _ as GraphMode, c as EntitiesConfig, d as Graph, f as GraphConfig, i as DeleteNodeOptions, j as TransitionOptions, l as EntitiesUpdate, m as GraphEdge, o as EdgeConfig, p as GraphDiff, r as CoverageStats, s as EdgeUpdate, v as GraphNode, x as GraphPort, y as GraphPatch } from "./types-DNYdIU21.mjs";
 
 //#region src/graph.d.ts
 
@@ -193,18 +193,23 @@ declare function deleteNode(graph: Graph, id: string, opts?: DeleteNodeOptions):
 declare function deleteEdge(graph: Graph, id: string): void;
 /**
  * **Mutable.** Update a node in place.
+ * Optional fields (`x`, `y`, `width`, `height`, `shape`, `color`, `style`,
+ * `ports`) accept `null` to unset; `undefined` leaves them unchanged.
  * @returns The updated node.
  *
  * @example
  * ```ts
  * const graph = createGraph({ nodes: [{ id: 'a', label: 'old' }] });
- * const updated = updateNode(graph, 'a', { label: 'new' });
- * // updated.label === 'new'
+ * const updated = updateNode(graph, 'a', { label: 'new', x: 100 });
+ * // updated.label === 'new', updated.x === 100
  * ```
  */
-declare function updateNode<N, P = any>(graph: Graph<N, any, any, P>, id: string, update: Partial<Omit<NodeConfig<N, P>, 'id'>>): GraphNode<N, P>;
+declare function updateNode<N, P = any>(graph: Graph<N, any, any, P>, id: string, update: NodeUpdate<N, P>): GraphNode<N, P>;
 /**
  * **Mutable.** Update an edge in place.
+ * Optional fields (`weight`, `mode`, `sourcePort`, `targetPort`, `x`, `y`,
+ * `width`, `height`, `color`, `style`) accept `null` to unset; `undefined`
+ * leaves them unchanged.
  * @returns The updated edge.
  *
  * @example
@@ -213,11 +218,11 @@ declare function updateNode<N, P = any>(graph: Graph<N, any, any, P>, id: string
  *   nodes: [{ id: 'a' }, { id: 'b' }],
  *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b', label: 'old' }],
  * });
- * const updated = updateEdge(graph, 'e1', { label: 'new' });
- * // updated.label === 'new'
+ * const updated = updateEdge(graph, 'e1', { label: 'new', weight: 2 });
+ * // updated.label === 'new', updated.weight === 2
  * ```
  */
-declare function updateEdge<N, E>(graph: Graph<N, E>, id: string, update: Partial<Omit<EdgeConfig<E>, 'id'>>): GraphEdge<E>;
+declare function updateEdge<N, E>(graph: Graph<N, E>, id: string, update: EdgeUpdate<E>): GraphEdge<E>;
 /**
  * **Mutable.** Add multiple nodes and edges to the graph.
  * Nodes are added first, then edges (so edges can reference new nodes).
@@ -308,8 +313,8 @@ declare class GraphInstance<N = any, E = any, G = any, P = any> {
   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>;
+  updateNode(id: string, update: NodeUpdate<N, P>): GraphNode<N, P>;
+  updateEdge(id: string, update: EdgeUpdate<E>): GraphEdge<E>;
   addEntities(entities: EntitiesConfig<N, E, P>): void;
   deleteEntities(ids: string | string[], opts?: DeleteNodeOptions): void;
   updateEntities(updates: EntitiesUpdate<N, E, P>): void;
@@ -325,17 +330,66 @@ declare function getEdgeMode(graph: Graph, edge: GraphEdge): GraphMode;
 /** Whether an edge points only from source to target. */
 declare function isEdgeDirected(graph: Graph, edge: GraphEdge): boolean;
 //#endregion
+//#region src/validate.d.ts
+/**
+ * A structural problem found in a graph by {@link getGraphIssues}.
+ */
+interface GraphIssue {
+  /** Stable machine-readable code, e.g. `'duplicate-node-id'`. */
+  code: string;
+  /** What is wrong, which entity is affected, and how to fix it. */
+  message: string;
+  /** Location of the offending value, e.g. `['nodes', 0, 'id']`. */
+  path?: (string | number)[];
+}
+/**
+ * Validates the structural invariants of a graph and returns the issues
+ * found, or `[]` when the graph is valid. Pure — never throws, never mutates.
+ *
+ * This is the recommended gate for untrusted or imported graphs (e.g. parsed
+ * from a file or received over the wire) before handing them to queries and
+ * algorithms: the mutation APIs (`addNode`, `addEdge`, `updateNode`, …)
+ * validate incrementally, but `createGraph` does **not** — it accepts
+ * dangling `parentId`/edge references and even `parentId` cycles as-is.
+ *
+ * For Zod-based shape validation of arbitrary unknown values, see
+ * `validateGraph` in `@statelyai/graph/schemas` (which reuses these checks).
+ *
+ * Issue codes: `duplicate-node-id`, `duplicate-edge-id`,
+ * `missing-initial-node`, `missing-parent`, `missing-node-initial`,
+ * `duplicate-port-name`, `parent-cycle`, `dangling-edge-endpoint`,
+ * `missing-source-port`, `missing-target-port`.
+ *
+ * @example
+ * ```ts
+ * const graph = createGraph({
+ *   nodes: [{ id: 'a', parentId: 'ghost' }],
+ *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
+ * });
+ * getGraphIssues(graph);
+ * // => [
+ * //   { code: 'missing-parent', message: '...', path: ['nodes', 0, 'parentId'] },
+ * //   { code: 'dangling-edge-endpoint', message: '...', path: ['edges', 0, 'targetId'] },
+ * // ]
+ * ```
+ */
+declare function getGraphIssues(graph: Graph): GraphIssue[];
+//#endregion
 //#region src/indexing.d.ts
 /**
- * Clear the cached index. Call this if you mutate graph.nodes/edges directly.
+ * Clear the cached index. Call this if you mutate fields of existing
+ * nodes/edges in place (e.g. `edge.targetId = 'a'`) — such mutations are not
+ * auto-detected. Array replacement and length changes are auto-detected.
  *
  * @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 });
+ * const graph = createGraph({
+ *   nodes: [{ id: 'a' }, { id: 'b' }],
+ *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
+ * });
+ * graph.edges[0].targetId = 'a'; // in-place field mutation
  * invalidateIndex(graph); // forces rebuild on next getIndex()
  * ```
  */
@@ -441,7 +495,8 @@ declare function isEmptyDiff(diff: GraphDiff): boolean;
 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.
+ * Order (see {@link toPatches}): add nodes → update edges → delete edges →
+ * delete nodes → add edges → update nodes.
  *
  * @example
  * ```ts
@@ -587,7 +642,8 @@ declare function reverseGraph<N, E, G>(graph: Graph<N, E, G>, filterEdge?: (edge
 //#endregion
 //#region src/walks.d.ts
 /**
- * Random walk. At each node, picks a uniformly random outgoing edge.
+ * Random walk. At each node, picks a uniformly random traversable edge
+ * (outgoing edges, plus non-directed edges both ways).
  * 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>>;
@@ -597,13 +653,16 @@ declare function genRandomWalk<N, E>(graph: Graph<N, E>, options?: WalkOptions<E
 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.
+ * If unvisited traversable edges exist at the current node, picks one randomly.
+ * Otherwise, walks the fewest-hop path (BFS, honoring `filter` and edge modes)
+ * to the nearest unvisited edge. Ends when no unvisited edge is reachable.
  */
 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.
+ * Edges whose effective mode is not `'directed'` may be traversed
+ * target → source as well.
  */
 declare function genPredefinedWalk<N, E>(graph: Graph<N, E>, edgeIds: string[], options?: Pick<WalkOptions<E>, 'from'>): Generator<GraphStep<N, E>>;
 /**
@@ -635,4 +694,4 @@ declare function getCoverage<N, E>(graph: Graph<N, E>, steps: GraphStep<N, E>[],
   from?: string;
 }): CoverageStats;
 //#endregion
-export { addEntities as A, deleteNode as B, isLayoutEqual as C, isEdgeDirected as D, getEdgeMode as E, createGraphNode as F, updateEdge as G, getNode as H, createGraphPort as I, updateEntities as K, createVisualGraph as L, createGraph as M, createGraphEdge as N, GraphInstance as O, createGraphFromTransition as P, deleteEdge as R, areEntitiesEqual as S, invalidateIndex as T, hasEdge as U, getEdge as V, hasNode as W, invertDiff as _, getCoverage as a, toPatches as b, takeUntilEdgeCoverage as c, flatten as d, getSubgraph as f, getPatches as g, getDiff as h, genWeightedRandomWalk as i, addNode as j, addEdge as k, takeUntilNode as l, applyPatches as m, genQuickRandomWalk as n, takeSteps as o, reverseGraph as p, updateNode as q, genRandomWalk as r, takeUntilEdge as s, genPredefinedWalk as t, takeUntilNodeCoverage as u, isEmptyDiff as v, isNonLayoutEqual as w, LAYOUT_KEYS as x, toDiff as y, deleteEntities as z };
+export { GraphInstance as A, deleteEdge as B, isLayoutEqual as C, getGraphIssues as D, GraphIssue as E, createGraphEdge as F, hasEdge as G, deleteNode as H, createGraphFromTransition as I, updateEntities as J, hasNode as K, createGraphNode as L, addEntities as M, addNode as N, getEdgeMode as O, createGraph as P, createGraphPort as R, areEntitiesEqual as S, invalidateIndex as T, getEdge as U, deleteEntities as V, getNode as W, updateNode as Y, invertDiff as _, getCoverage as a, toPatches as b, takeUntilEdgeCoverage as c, flatten as d, getSubgraph as f, getPatches as g, getDiff as h, genWeightedRandomWalk as i, addEdge as j, isEdgeDirected as k, takeUntilNode as l, applyPatches as m, genQuickRandomWalk as n, takeSteps as o, reverseGraph as p, updateEdge as q, genRandomWalk as r, takeUntilEdge as s, genPredefinedWalk as t, takeUntilNodeCoverage as u, isEmptyDiff as v, isNonLayoutEqual as w, LAYOUT_KEYS as x, toDiff as y, createVisualGraph as z };

package/dist/index.d.mts

@@ -1,6 +1,6 @@
-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 };
+import { A as SinglePathOptions, B as WalkContext, C as MSTOptions, D as PathOptions, E as NodeUpdate, F as VisualGraphConfig, H as WeightedWalkOptions, I as VisualGraphEntity, L as VisualGraphFormatConverter, M as TraversalOptions, N as VisualEdge, O as PortConfig, P as VisualGraph, R as VisualNode, S as GraphStep, T as NodeConfig, V as WalkOptions, _ as GraphMode, a as EdgeChange, b as GraphPath, c as EntitiesConfig, d as Graph, f as GraphConfig, g as GraphFormatConverter, h as GraphEntity, i as DeleteNodeOptions, j as TransitionOptions, k as PortDirection, l as EntitiesUpdate, m as GraphEdge, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphDiff, r as CoverageStats, s as EdgeUpdate, t as AStarOptions, u as EntityRect, v as GraphNode, w as NodeChange, x as GraphPort, y as GraphPatch, z as VisualPort } from "./types-DNYdIU21.mjs";
+import { $ as getTopologicalSort, A as getPageRank, B as genSimplePaths, C as getBetweennessCentrality, D as getHITS, E as getEigenvectorCentrality, F as getPostorders, G as getShortestPaths, H as getAllPairsShortestPaths, I as getPreorder, J as getStronglyConnectedComponents, K as getSimplePath, L as getPreorders, M as genPostorders, N as genPreorders, O as getInDegreeCentrality, P as getPostorder, Q as getConnectedComponents, R as genCycles, S as IterativeCentralityOptions, T as getDegreeCentrality, U as getCycles, V as getAStarPath, W as getShortestPath, X as bfs, Y as joinPaths, Z as dfs, _ as getGirvanNewmanCommunities, a as MaxFlowResult, b as getModularity, c as getLouvainCommunities, d as getArticulationPoints, et as hasPath, f as getBiconnectedComponents, g as genGirvanNewmanCommunities, h as LabelPropagationOptions, i as MaxFlowOptions, j as getMinimumSpanningTree, k as getOutDegreeCentrality, l as IsomorphismOptions, m as GirvanNewmanOptions, n as DominatorTreeOptions, nt as isConnected, o as getMaxFlow, p as getBridges, q as getSimplePaths, r as getDominatorTree, rt as isTree, s as LouvainOptions, t as getTransitiveReduction, tt as isAcyclic, u as isIsomorphic, v as getGreedyModularityCommunities, w as getClosenessCentrality, x as HITSResult, y as getLabelPropagationCommunities, z as genShortestPaths } from "./algorithms-CsGNehct.mjs";
+import { n as createFormatConverter } from "./index-D51lJnt2.mjs";
+import { A as GraphInstance, B as deleteEdge, C as isLayoutEqual, D as getGraphIssues, E as GraphIssue, F as createGraphEdge, G as hasEdge, H as deleteNode, I as createGraphFromTransition, J as updateEntities, K as hasNode, L as createGraphNode, M as addEntities, N as addNode, O as getEdgeMode, P as createGraph, R as createGraphPort, S as areEntitiesEqual, T as invalidateIndex, U as getEdge, V as deleteEntities, W as getNode, Y as updateNode, _ 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 addEdge, k as isEdgeDirected, l as takeUntilNode, m as applyPatches, n as genQuickRandomWalk, o as takeSteps, p as reverseGraph, q as updateEdge, 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 createVisualGraph } from "./index-DWmo1mIp.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-BfXeTXRf.mjs";
+export { AStarOptions, AllPairsShortestPathsOptions, CoverageStats, DeleteNodeOptions, DominatorTreeOptions, EdgeChange, EdgeConfig, EdgeUpdate, EntitiesConfig, EntitiesUpdate, EntityRect, GirvanNewmanOptions, Graph, GraphConfig, GraphDiff, GraphEdge, GraphEntity, GraphFormatConverter, GraphInstance, GraphIssue, GraphMode, GraphNode, GraphPatch, GraphPath, GraphPort, GraphStep, HITSResult, IsomorphismOptions, IterativeCentralityOptions, LAYOUT_KEYS, LabelPropagationOptions, LouvainOptions, MSTOptions, MaxFlowOptions, MaxFlowResult, NodeChange, NodeConfig, NodeUpdate, 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, getDominatorTree, getEdge, getEdgeMode, getEdgesBetween, getEdgesByPort, getEdgesOf, getEigenvectorCentrality, getGirvanNewmanCommunities, getGraphIssues, getGreedyModularityCommunities, getHITS, getInDegree, getInDegreeCentrality, getInEdges, getLCA, getLabelPropagationCommunities, getLouvainCommunities, getMaxFlow, 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, getTransitiveReduction, 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 };