effect 4.0.1 → 4.0.2

package/dist/Graph.d.ts

@@ -6,6 +6,7 @@
  * both nodes and edges. The module includes traversal, analysis, path-finding,
  * transformation, and diagram export utilities.
  *
+ * @stability unstable
  * @since 4.0.0
  */
 import * as Equal from "./Equal.ts";
@@ -33,6 +34,7 @@ declare const TypeId = "~effect/Graph";
  *
  * @see {@link EdgeIndex} for edge identifiers instead of node identifiers
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -52,6 +54,7 @@ export type NodeIndex = number;
  *
  * @see {@link NodeIndex} for node identifiers instead of edge identifiers
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -64,6 +67,7 @@ export type EdgeIndex = number;
  * Use as the graph edge value that carries source node, target node, and stored
  * edge data together.
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -80,6 +84,7 @@ export interface Edge<out E> {
  * Use when writing graph-polymorphic types or helpers that need to preserve
  * whether a graph is directed or undirected.
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -87,6 +92,7 @@ export type Kind = "directed" | "undirected";
 /**
  * A node and its stable index in a graph snapshot.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -97,6 +103,7 @@ export interface IndexedNode<out N> {
 /**
  * An edge and its stable index in a graph snapshot.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -122,6 +129,7 @@ export interface IndexedEdge<out E> extends Edge<E> {
  * reconstruction, new identifiers continue after the greatest active index.
  *
  * @see {@link fromSnapshot} for reconstructing a graph
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -145,6 +153,7 @@ export interface Snapshot<out N, out E, out T extends Kind> {
  *
  * @see {@link MutableGraph} for the mutable counterpart used inside mutation scopes
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -156,6 +165,7 @@ export interface Graph<out N, out E, T extends Kind = "directed"> extends Iterab
 /**
  * Companion namespace containing type-level metadata for immutable graphs.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -188,6 +198,7 @@ export declare namespace Graph {
  * @see {@link Graph} for the immutable graph interface
  * @see {@link mutate} for scoped mutation of an immutable graph
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -199,6 +210,7 @@ export interface MutableGraph<in out N, in out E, T extends Kind = "directed"> e
 /**
  * Companion namespace containing type-level metadata for scoped mutable graphs.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -230,6 +242,7 @@ export declare namespace MutableGraph {
  * @see {@link directed} for constructing directed graphs
  * @see {@link UndirectedGraph} for graphs whose edges connect both endpoints
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -249,6 +262,7 @@ export type DirectedGraph<N, E> = Graph<N, E, "directed">;
  * @see {@link undirected} for constructing undirected graphs
  * @see {@link DirectedGraph} for graphs whose edges have source-to-target direction
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -264,6 +278,7 @@ export type UndirectedGraph<N, E> = Graph<N, E, "undirected">;
  * @see {@link MutableGraph} for the generic mutable graph type
  * @see {@link MutableUndirectedGraph} for mutable graphs without edge direction
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -279,6 +294,7 @@ export type MutableDirectedGraph<N, E> = MutableGraph<N, E, "directed">;
  * @see {@link MutableDirectedGraph} for mutable graphs with directed edges
  * @see {@link MutableGraph} for the generic mutable graph type
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -296,6 +312,7 @@ declare const GraphError_base: new <A extends Record<string, any> = {}>(args: im
  * Use when handling failures thrown by graph operations that reject invalid
  * graph structure or unsupported algorithm inputs.
  *
+ * @stability unstable
  * @category errors
  * @since 3.18.0
  */
@@ -317,6 +334,7 @@ export declare class GraphError extends GraphError_base<{
  * distinguish immutable graphs from mutable graphs or directed graphs from
  * undirected graphs.
  *
+ * @stability unstable
  * @category guards
  * @since 4.0.0
  */
@@ -352,6 +370,7 @@ export declare const isGraph: <N = unknown, E = unknown, T extends Kind = Kind,
  * ```
  *
  * @see {@link toSnapshot} for capturing a graph snapshot
+ * @stability unstable
  * @category constructors
  * @since 4.0.0
  */
@@ -390,6 +409,7 @@ export declare const fromSnapshot: <N, E, T extends Kind>(snapshot: Snapshot<N,
  * ```
  *
  * @see {@link fromSnapshot} for reconstructing an immutable graph
+ * @stability unstable
  * @category converting
  * @since 4.0.0
  */
@@ -417,6 +437,7 @@ export declare const toSnapshot: <N, E, T extends Kind = "directed">(graph: Grap
  *
  * @see {@link directed} for constructing a directed graph directly
  * @see {@link undirected} for constructing an undirected graph directly
+ * @stability unstable
  * @category constructors
  * @since 4.0.0
  */
@@ -450,6 +471,7 @@ export declare const make: <T extends Kind>(type: T) => <N, E>(mutate?: (mutable
  * Array.of(Graph.nodeCount(graph), Graph.edgeCount(graph)) // => [3, 2]
  * ```
  *
+ * @stability unstable
  * @category constructors
  * @since 3.18.0
  */
@@ -483,6 +505,7 @@ export declare const directed: <N, E>(mutate?: (mutable: MutableDirectedGraph<N,
  * Array.of(Graph.nodeCount(graph), Graph.edgeCount(graph)) // => [3, 2]
  * ```
  *
+ * @stability unstable
  * @category constructors
  * @since 3.18.0
  */
@@ -514,6 +537,7 @@ export declare const undirected: <N, E>(mutate?: (mutable: MutableUndirectedGrap
  *
  * @see {@link endMutation} for finalizing the mutable graph
  * @see {@link mutate} for automatically scoped mutation
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -543,6 +567,7 @@ export declare const beginMutation: <N, E, T extends Kind = "directed">(graph: G
  *
  * @see {@link beginMutation} for opening a manual mutation scope
  * @see {@link mutate} for automatically scoped mutation
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -584,6 +609,7 @@ export declare const endMutation: <N, E, T extends Kind = "directed">(mutable: M
  *
  * @see {@link beginMutation} for opening a manual mutation scope
  * @see {@link endMutation} for finalizing a manual mutation scope
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -625,6 +651,7 @@ export declare const mutate: {
      *
      * @see {@link beginMutation} for opening a manual mutation scope
      * @see {@link endMutation} for finalizing a manual mutation scope
+     * @stability unstable
      * @category mutations
      * @since 3.18.0
      */
@@ -666,6 +693,7 @@ export declare const mutate: {
      *
      * @see {@link beginMutation} for opening a manual mutation scope
      * @see {@link endMutation} for finalizing a manual mutation scope
+     * @stability unstable
      * @category mutations
      * @since 3.18.0
      */
@@ -691,6 +719,7 @@ export declare const mutate: {
  * with the same endpoint identities and projected edge identity are treated as
  * the same member by graph set operations.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -748,6 +777,7 @@ export interface IdentityOptions<N, E, NI = N, EI = E> {
  * ```
  *
  * @see {@link sum} for combining graphs without merging equal nodes
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -802,6 +832,7 @@ export declare const compose: {
      * ```
      *
      * @see {@link sum} for combining graphs without merging equal nodes
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -856,6 +887,7 @@ export declare const compose: {
      * ```
      *
      * @see {@link sum} for combining graphs without merging equal nodes
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -909,6 +941,7 @@ export declare const compose: {
  * ```
  *
  * @see {@link compose} for identity-based graph union
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -961,6 +994,7 @@ export declare const intersection: {
      * ```
      *
      * @see {@link compose} for identity-based graph union
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1013,6 +1047,7 @@ export declare const intersection: {
      * ```
      *
      * @see {@link compose} for identity-based graph union
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1068,6 +1103,7 @@ export declare const intersection: {
  * ```
  *
  * @see {@link symmetricDifference} for retaining edges unique to either graph
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -1122,6 +1158,7 @@ export declare const difference: {
      * ```
      *
      * @see {@link symmetricDifference} for retaining edges unique to either graph
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1176,6 +1213,7 @@ export declare const difference: {
      * ```
      *
      * @see {@link symmetricDifference} for retaining edges unique to either graph
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1234,6 +1272,7 @@ export declare const difference: {
  * ```
  *
  * @see {@link difference} for removing only the edges found in another graph
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -1291,6 +1330,7 @@ export declare const symmetricDifference: {
      * ```
      *
      * @see {@link difference} for removing only the edges found in another graph
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1348,6 +1388,7 @@ export declare const symmetricDifference: {
      * ```
      *
      * @see {@link difference} for removing only the edges found in another graph
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1392,6 +1433,7 @@ export declare const symmetricDifference: {
  * ```
  *
  * @see {@link hasEdge} for testing one relationship
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -1435,6 +1477,7 @@ export declare const complement: {
      * ```
      *
      * @see {@link hasEdge} for testing one relationship
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1478,6 +1521,7 @@ export declare const complement: {
      * ```
      *
      * @see {@link hasEdge} for testing one relationship
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1493,6 +1537,7 @@ export declare const complement: {
  * `direction` controls how directed edges are traversed and defaults to
  * `"outgoing"`.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -1541,6 +1586,7 @@ export interface NeighborhoodConfig {
  * ```
  *
  * @see {@link inducedSubgraph} for selecting nodes while preserving identifiers
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -1586,6 +1632,7 @@ export declare const neighborhood: {
      * ```
      *
      * @see {@link inducedSubgraph} for selecting nodes while preserving identifiers
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1631,6 +1678,7 @@ export declare const neighborhood: {
      * ```
      *
      * @see {@link inducedSubgraph} for selecting nodes while preserving identifiers
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1656,6 +1704,7 @@ export declare const neighborhood: {
  *
  * @see {@link neighborhood} for selecting nodes by traversal distance
  *
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -1680,6 +1729,7 @@ export declare const inducedSubgraph: {
      *
      * @see {@link neighborhood} for selecting nodes by traversal distance
      *
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1704,6 +1754,7 @@ export declare const inducedSubgraph: {
      *
      * @see {@link neighborhood} for selecting nodes by traversal distance
      *
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1731,6 +1782,7 @@ export declare const inducedSubgraph: {
  *
  * @see {@link compose} for merging overlapping logical nodes by identity
  *
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -1757,6 +1809,7 @@ export declare const sum: {
      *
      * @see {@link compose} for merging overlapping logical nodes by identity
      *
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1783,6 +1836,7 @@ export declare const sum: {
      *
      * @see {@link compose} for merging overlapping logical nodes by identity
      *
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1820,6 +1874,7 @@ export declare const sum: {
  * @see {@link mutate} for obtaining a mutable graph from an immutable graph
  * @see {@link addEdge} for connecting existing nodes
  *
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -1839,6 +1894,7 @@ export declare const addNode: <N, E, T extends Kind = "directed">(mutable: Mutab
  * Graph.getNode(graph, 0) // => Option.some("Node A")
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -1858,6 +1914,7 @@ export declare const getNode: {
      * Graph.getNode(graph, 0) // => Option.some("Node A")
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -1877,6 +1934,7 @@ export declare const getNode: {
      * Graph.getNode(graph, 0) // => Option.some("Node A")
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -1898,6 +1956,7 @@ export declare const getNode: {
  * Graph.hasNode(graph, 999) // => false
  * ```
  *
+ * @stability unstable
  * @category predicates
  * @since 3.18.0
  */
@@ -1918,6 +1977,7 @@ export declare const hasNode: {
      * Graph.hasNode(graph, 999) // => false
      * ```
      *
+     * @stability unstable
      * @category predicates
      * @since 3.18.0
      */
@@ -1938,6 +1998,7 @@ export declare const hasNode: {
      * Graph.hasNode(graph, 999) // => false
      * ```
      *
+     * @stability unstable
      * @category predicates
      * @since 3.18.0
      */
@@ -1963,6 +2024,7 @@ export declare const hasNode: {
  * Graph.nodeCount(graphWithNodes) // => 3
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -1985,6 +2047,7 @@ export declare const nodeCount: <N, E, T extends Kind = "directed">(graph: Graph
  * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -2007,6 +2070,7 @@ export declare const findNode: {
      * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2029,6 +2093,7 @@ export declare const findNode: {
      * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2052,6 +2117,7 @@ export declare const findNode: {
  * Graph.findNodes(graph, (data) => data === "Not Found") // => []
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -2074,6 +2140,7 @@ export declare const findNodes: {
      * Graph.findNodes(graph, (data) => data === "Not Found") // => []
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2096,6 +2163,7 @@ export declare const findNodes: {
      * Graph.findNodes(graph, (data) => data === "Not Found") // => []
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2121,6 +2189,7 @@ export declare const findNodes: {
  * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -2145,6 +2214,7 @@ export declare const findEdge: {
      * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2169,6 +2239,7 @@ export declare const findEdge: {
      * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2195,6 +2266,7 @@ export declare const findEdge: {
  * Graph.findEdges(graph, (data) => data > 100) // => []
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -2220,6 +2292,7 @@ export declare const findEdges: {
      * Graph.findEdges(graph, (data) => data > 100) // => []
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2245,6 +2318,7 @@ export declare const findEdges: {
      * Graph.findEdges(graph, (data) => data > 100) // => []
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2277,6 +2351,7 @@ export declare const findEdges: {
  * Graph.getNode(graph, 0) // => Option.some("NODE A")
  * ```
  *
+ * @stability unstable
  * @category transforming
  * @since 3.18.0
  */
@@ -2309,6 +2384,7 @@ export declare const updateNode: <N, E, T extends Kind = "directed">(mutable: Mu
  * Option.map(Graph.getEdge(result, 0), (edge) => edge.data) // => Option.some(20)
  * ```
  *
+ * @stability unstable
  * @category transforming
  * @since 3.18.0
  */
@@ -2348,6 +2424,7 @@ export declare const updateEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  *
  * @see {@link updateNode} for updating one node
  * @see {@link filterMapNodes} for mapping while removing nodes
+ * @stability unstable
  * @category mapping
  * @since 3.18.0
  */
@@ -2388,6 +2465,7 @@ export declare const mapNodes: <N, E, T extends Kind = "directed">(mutable: Muta
  *
  * @see {@link updateEdge} for updating one edge
  * @see {@link filterMapEdges} for mapping while removing edges
+ * @stability unstable
  * @category mapping
  * @since 3.18.0
  */
@@ -2425,6 +2503,7 @@ export declare const mapEdges: <N, E, T extends Kind = "directed">(mutable: Muta
  * Option.map(Graph.getEdge(graph, 0), (edge) => edge.source) // => Option.some(1)
  * ```
  *
+ * @stability unstable
  * @category transforming
  * @since 3.18.0
  */
@@ -2461,6 +2540,7 @@ export declare const reverse: <N, E, T extends Kind = "directed">(mutable: Mutab
  * Graph.nodeCount(graph) // => 2
  * ```
  *
+ * @stability unstable
  * @category filtering
  * @since 3.18.0
  */
@@ -2497,6 +2577,7 @@ export declare const filterMapNodes: <N, E, T extends Kind = "directed">(mutable
  * Graph.edgeCount(graph) // => 2
  * ```
  *
+ * @stability unstable
  * @category filtering
  * @since 3.18.0
  */
@@ -2530,6 +2611,7 @@ export declare const filterMapEdges: <N, E, T extends Kind = "directed">(mutable
  * Graph.nodeCount(graph) // => 2
  * ```
  *
+ * @stability unstable
  * @category filtering
  * @since 3.18.0
  */
@@ -2565,6 +2647,7 @@ export declare const filterNodes: <N, E, T extends Kind = "directed">(mutable: M
  * Graph.edgeCount(graph) // => 2
  * ```
  *
+ * @stability unstable
  * @category filtering
  * @since 3.18.0
  */
@@ -2603,6 +2686,7 @@ export declare const filterEdges: <N, E, T extends Kind = "directed">(mutable: M
  * @see {@link mutate} for obtaining a mutable graph from an immutable graph
  * @see {@link addNode} for creating node indexes before connecting them
  *
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -2630,6 +2714,7 @@ export declare const addEdge: <N, E, T extends Kind = "directed">(mutable: Mutab
  * Array.of(Graph.nodeCount(result), Graph.edgeCount(result)) // => [1, 0]
  * ```
  *
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -2653,6 +2738,7 @@ export declare const removeNode: <N, E, T extends Kind = "directed">(mutable: Mu
  *
  * @see {@link removeNode} for removing one node
  *
+ * @stability unstable
  * @category mutations
  * @since 4.0.0
  */
@@ -2680,6 +2766,7 @@ export declare const removeNodes: <N, E, T extends Kind = "directed">(mutable: M
  * Array.of(Graph.nodeCount(result), Graph.edgeCount(result)) // => [2, 0]
  * ```
  *
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -2702,6 +2789,7 @@ export declare const removeEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  *
  * @see {@link removeEdge} for removing one edge
  *
+ * @stability unstable
  * @category mutations
  * @since 4.0.0
  */
@@ -2723,6 +2811,7 @@ export declare const removeEdges: <N, E, T extends Kind = "directed">(mutable: M
  * Graph.getEdge(graph, 0) // => Option.some({ source: 0, target: 1, data: 42 })
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -2744,6 +2833,7 @@ export declare const getEdge: {
      * Graph.getEdge(graph, 0) // => Option.some({ source: 0, target: 1, data: 42 })
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2765,6 +2855,7 @@ export declare const getEdge: {
      * Graph.getEdge(graph, 0) // => Option.some({ source: 0, target: 1, data: 42 })
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -2799,6 +2890,7 @@ export declare const getEdge: {
  * ```
  *
  * @see {@link edgesBetween} for all matching edge identifiers
+ * @stability unstable
  * @category predicates
  * @since 3.18.0
  */
@@ -2832,6 +2924,7 @@ export declare const hasEdge: {
      * ```
      *
      * @see {@link edgesBetween} for all matching edge identifiers
+     * @stability unstable
      * @category predicates
      * @since 3.18.0
      */
@@ -2865,6 +2958,7 @@ export declare const hasEdge: {
      * ```
      *
      * @see {@link edgesBetween} for all matching edge identifiers
+     * @stability unstable
      * @category predicates
      * @since 3.18.0
      */
@@ -2893,6 +2987,7 @@ export declare const hasEdge: {
  * Graph.edgeCount(graphWithEdges) // => 3
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -2905,6 +3000,7 @@ export declare const edgeCount: <N, E, T extends Kind = "directed">(graph: Graph
  * Each edge is returned once in graph edge order, including self-loops.
  * Throws a `GraphError` when the node does not exist.
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -2917,6 +3013,7 @@ export declare const incidentEdges: {
      * Each edge is returned once in graph edge order, including self-loops.
      * Throws a `GraphError` when the node does not exist.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -2929,6 +3026,7 @@ export declare const incidentEdges: {
      * Each edge is returned once in graph edge order, including self-loops.
      * Throws a `GraphError` when the node does not exist.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -2942,6 +3040,7 @@ export declare const incidentEdges: {
  * Parallel edges and self-loops are returned separately in adjacency order.
  * Throws a `GraphError` for an undirected graph or missing node.
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -2954,6 +3053,7 @@ export declare const outgoingEdges: {
      * Parallel edges and self-loops are returned separately in adjacency order.
      * Throws a `GraphError` for an undirected graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -2966,6 +3066,7 @@ export declare const outgoingEdges: {
      * Parallel edges and self-loops are returned separately in adjacency order.
      * Throws a `GraphError` for an undirected graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -2979,6 +3080,7 @@ export declare const outgoingEdges: {
  * Parallel edges and self-loops are returned separately in reverse-adjacency
  * order. Throws a `GraphError` for an undirected graph or missing node.
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -2991,6 +3093,7 @@ export declare const incomingEdges: {
      * Parallel edges and self-loops are returned separately in reverse-adjacency
      * order. Throws a `GraphError` for an undirected graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3003,6 +3106,7 @@ export declare const incomingEdges: {
      * Parallel edges and self-loops are returned separately in reverse-adjacency
      * order. Throws a `GraphError` for an undirected graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3017,6 +3121,7 @@ export declare const incomingEdges: {
  * graphs include either stored orientation. Parallel edges are retained.
  * Throws a `GraphError` when either node does not exist.
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -3030,6 +3135,7 @@ export declare const edgesBetween: {
      * graphs include either stored orientation. Parallel edges are retained.
      * Throws a `GraphError` when either node does not exist.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3043,6 +3149,7 @@ export declare const edgesBetween: {
      * graphs include either stored orientation. Parallel edges are retained.
      * Throws a `GraphError` when either node does not exist.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3056,6 +3163,7 @@ export declare const edgesBetween: {
  * Parallel edges count separately and a self-loop contributes two. Throws a
  * `GraphError` for a directed graph or missing node.
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -3068,6 +3176,7 @@ export declare const degree: {
      * Parallel edges count separately and a self-loop contributes two. Throws a
      * `GraphError` for a directed graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3080,6 +3189,7 @@ export declare const degree: {
      * Parallel edges count separately and a self-loop contributes two. Throws a
      * `GraphError` for a directed graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3093,6 +3203,7 @@ export declare const degree: {
  * Parallel edges count separately and a self-loop contributes one. Throws a
  * `GraphError` for an undirected graph or missing node.
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -3105,6 +3216,7 @@ export declare const outDegree: {
      * Parallel edges count separately and a self-loop contributes one. Throws a
      * `GraphError` for an undirected graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3117,6 +3229,7 @@ export declare const outDegree: {
      * Parallel edges count separately and a self-loop contributes one. Throws a
      * `GraphError` for an undirected graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3130,6 +3243,7 @@ export declare const outDegree: {
  * Parallel edges count separately and a self-loop contributes one. Throws a
  * `GraphError` for an undirected graph or missing node.
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -3142,6 +3256,7 @@ export declare const inDegree: {
      * Parallel edges count separately and a self-loop contributes one. Throws a
      * `GraphError` for an undirected graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3154,6 +3269,7 @@ export declare const inDegree: {
      * Parallel edges count separately and a self-loop contributes one. Throws a
      * `GraphError` for an undirected graph or missing node.
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3191,6 +3307,7 @@ export declare const inDegree: {
  * Graph.neighbors(graph, 1) // => []
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -3227,6 +3344,7 @@ export declare const neighbors: {
      * Graph.neighbors(graph, 1) // => []
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -3263,6 +3381,7 @@ export declare const neighbors: {
      * Graph.neighbors(graph, 1) // => []
      * ```
      *
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -3287,6 +3406,7 @@ export declare const neighbors: {
  * @see {@link predecessors} for incoming neighbors in a directed graph
  * @see {@link neighbors} for generic neighbor lookup across graph kinds
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -3310,6 +3430,7 @@ export declare const successors: {
      * @see {@link predecessors} for incoming neighbors in a directed graph
      * @see {@link neighbors} for generic neighbor lookup across graph kinds
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3333,6 +3454,7 @@ export declare const successors: {
      * @see {@link predecessors} for incoming neighbors in a directed graph
      * @see {@link neighbors} for generic neighbor lookup across graph kinds
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3357,6 +3479,7 @@ export declare const successors: {
  * @see {@link successors} for outgoing neighbors in a directed graph
  * @see {@link neighbors} for generic neighbor lookup across graph kinds
  *
+ * @stability unstable
  * @category getters
  * @since 4.0.0
  */
@@ -3380,6 +3503,7 @@ export declare const predecessors: {
      * @see {@link successors} for outgoing neighbors in a directed graph
      * @see {@link neighbors} for generic neighbor lookup across graph kinds
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3403,6 +3527,7 @@ export declare const predecessors: {
      * @see {@link successors} for outgoing neighbors in a directed graph
      * @see {@link neighbors} for generic neighbor lookup across graph kinds
      *
+     * @stability unstable
      * @category getters
      * @since 4.0.0
      */
@@ -3447,6 +3572,7 @@ export declare const predecessors: {
  * @deprecated Use {@link successors} for outgoing neighbors or {@link predecessors} for incoming neighbors.
  * @see {@link successors} for outgoing neighbors in a directed graph
  * @see {@link predecessors} for incoming neighbors in a directed graph
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -3490,6 +3616,7 @@ export declare const neighborsDirected: {
      * @deprecated Use {@link successors} for outgoing neighbors or {@link predecessors} for incoming neighbors.
      * @see {@link successors} for outgoing neighbors in a directed graph
      * @see {@link predecessors} for incoming neighbors in a directed graph
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -3533,6 +3660,7 @@ export declare const neighborsDirected: {
      * @deprecated Use {@link successors} for outgoing neighbors or {@link predecessors} for incoming neighbors.
      * @see {@link successors} for outgoing neighbors in a directed graph
      * @see {@link predecessors} for incoming neighbors in a directed graph
+     * @stability unstable
      * @category getters
      * @since 3.18.0
      */
@@ -3571,6 +3699,7 @@ export declare const neighborsDirected: {
  * ```
  *
  * @see {@link toGraphViz} for generating DOT output
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -3617,6 +3746,7 @@ export interface GraphVizOptions<N, E> {
  * ```
  *
  * @see {@link toMermaid} for Mermaid diagram output
+ * @stability unstable
  * @category converting
  * @since 3.18.0
  */
@@ -3647,6 +3777,7 @@ export declare const toGraphViz: {
      * ```
      *
      * @see {@link toMermaid} for Mermaid diagram output
+     * @stability unstable
      * @category converting
      * @since 3.18.0
      */
@@ -3677,6 +3808,7 @@ export declare const toGraphViz: {
      * ```
      *
      * @see {@link toMermaid} for Mermaid diagram output
+     * @stability unstable
      * @category converting
      * @since 3.18.0
      */
@@ -3717,6 +3849,7 @@ export declare const toGraphViz: {
  * options.nodeShape?.("decision") // => "diamond"
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -3754,6 +3887,7 @@ export type MermaidNodeShape = "rectangle" | "rounded" | "circle" | "diamond" |
  * Array.of(horizontalOptions.direction, verticalOptions.direction, bottomUpOptions.direction) // => ["LR", "TB", "BT"]
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -3790,6 +3924,7 @@ export type MermaidDirection = "TB" | "TD" | "BT" | "RL" | "LR";
  * Array.of(flowchartOptions.diagramType, graphOptions.diagramType, autoOptions.diagramType) // => ["flowchart", "graph", undefined]
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -3830,6 +3965,7 @@ export type MermaidDiagramType = "flowchart" | "graph";
  * ```
  *
  * @see {@link toMermaid} for generating Mermaid output
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -3890,6 +4026,7 @@ export interface MermaidOptions<N, E> {
  * ```
  *
  * @see {@link toGraphViz} for GraphViz DOT output
+ * @stability unstable
  * @category converting
  * @since 3.18.0
  */
@@ -3923,6 +4060,7 @@ export declare const toMermaid: {
      * ```
      *
      * @see {@link toGraphViz} for GraphViz DOT output
+     * @stability unstable
      * @category converting
      * @since 3.18.0
      */
@@ -3956,6 +4094,7 @@ export declare const toMermaid: {
      * ```
      *
      * @see {@link toGraphViz} for GraphViz DOT output
+     * @stability unstable
      * @category converting
      * @since 3.18.0
      */
@@ -3969,6 +4108,7 @@ export declare const toMermaid: {
  * `"outgoing"` selects edges whose source is the node, while `"incoming"`
  * selects edges whose target is the node.
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -4000,6 +4140,7 @@ export type Direction = "outgoing" | "incoming";
  * Array.from(Graph.indices(Graph.bfs(graph, { start: [1], direction: "undirected" }))) // => [1, 0, 2]
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -4012,6 +4153,7 @@ export type TraversalDirection = Direction | "undirected";
  * `path` repeats its first node at the end, so `edges.length` is always
  * `path.length - 1`.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -4033,6 +4175,7 @@ export interface CycleResult {
  * one-edge cycle, and two parallel undirected edges form a two-edge cycle.
  *
  * @see {@link isAcyclic} when only a boolean cycle check is needed
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4077,6 +4220,7 @@ export declare const findCycle: <N, E, T extends Kind = "directed">(graph: Graph
  *
  * @see {@link findCycle} for retrieving one cycle witness
  * @see {@link topo} for ordering a directed acyclic graph
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -4124,6 +4268,7 @@ export declare const isAcyclic: <N, E, T extends Kind = "directed">(graph: Graph
  * ```
  *
  * @see {@link maximumBipartiteMatching} for matching nodes after validation
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -4136,6 +4281,7 @@ export declare const isBipartite: <N, E>(graph: Graph<N, E, "undirected"> | Muta
  * `left` and `right` refer to the bipartition derived by
  * `maximumBipartiteMatching`, not to the stored edge orientation.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -4181,6 +4327,7 @@ export interface BipartiteMatch {
  * ```
  *
  * @see {@link isBipartite} for validating the graph without computing a matching
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4197,6 +4344,7 @@ export declare const maximumBipartiteMatching: <N, E>(graph: Graph<N, E, "undire
  *
  * `direction` defaults to `"outgoing"` and is ignored for undirected graphs.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -4224,6 +4372,7 @@ export interface ReachabilityConfig {
  * @see {@link bfs} for lazy traversal in increasing hop distance
  * @see {@link dijkstra} for weighted shortest paths
  *
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4249,6 +4398,7 @@ export declare const unweightedDistances: {
      * @see {@link bfs} for lazy traversal in increasing hop distance
      * @see {@link dijkstra} for weighted shortest paths
      *
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -4274,6 +4424,7 @@ export declare const unweightedDistances: {
      * @see {@link bfs} for lazy traversal in increasing hop distance
      * @see {@link dijkstra} for weighted shortest paths
      *
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -4299,6 +4450,7 @@ export declare const unweightedDistances: {
  * @see {@link unweightedDistances} for hop distances to all reachable nodes
  * @see {@link dijkstra} for a minimum-cost path
  *
+ * @stability unstable
  * @category predicates
  * @since 4.0.0
  */
@@ -4323,6 +4475,7 @@ export declare const hasPath: {
      * @see {@link unweightedDistances} for hop distances to all reachable nodes
      * @see {@link dijkstra} for a minimum-cost path
      *
+     * @stability unstable
      * @category predicates
      * @since 4.0.0
      */
@@ -4347,6 +4500,7 @@ export declare const hasPath: {
      * @see {@link unweightedDistances} for hop distances to all reachable nodes
      * @see {@link dijkstra} for a minimum-cost path
      *
+     * @stability unstable
      * @category predicates
      * @since 4.0.0
      */
@@ -4388,6 +4542,7 @@ export declare const hasPath: {
  * @see {@link isConnected} when only a boolean connectivity check is needed
  * @see {@link weaklyConnectedComponents} for directed graphs with orientation ignored
  * @see {@link stronglyConnectedComponents} for mutual directed reachability
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -4426,6 +4581,7 @@ export declare const connectedComponents: <N, E>(graph: Graph<N, E, "undirected"
  *
  * @see {@link articulationPoints} for single-node failure points
  * @see {@link biconnectedComponents} for maximal regions without an articulation split
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4463,6 +4619,7 @@ export declare const bridges: <N, E>(graph: Graph<N, E, "undirected"> | MutableG
  *
  * @see {@link bridges} for single-edge failure points
  * @see {@link biconnectedComponents} for the regions joined at articulation points
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4507,6 +4664,7 @@ export declare const articulationPoints: <N, E>(graph: Graph<N, E, "undirected">
  *
  * @see {@link articulationPoints} for the nodes shared between components
  * @see {@link bridges} for edges whose removal disconnects the graph
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4528,6 +4686,7 @@ export declare const biconnectedComponents: <N, E>(graph: Graph<N, E, "undirecte
  *
  * The source and target must be distinct existing nodes in a directed graph.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -4544,6 +4703,7 @@ export interface MaximumFlowConfig<E> {
  * `flows` contains every original edge, including zero-flow edges. `cut`
  * contains the crossing edge identifiers of the corresponding minimum cut.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -4560,6 +4720,7 @@ export interface MaximumFlowResult {
  * `source` contains nodes residual-reachable from the configured source and
  * `target` contains the remaining nodes.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -4605,6 +4766,7 @@ export interface MinimumCutResult {
  * ```
  *
  * @see {@link minimumCut} for the residual-reachability partition
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4645,6 +4807,7 @@ export declare const maximumFlow: {
      * ```
      *
      * @see {@link minimumCut} for the residual-reachability partition
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -4685,6 +4848,7 @@ export declare const maximumFlow: {
      * ```
      *
      * @see {@link minimumCut} for the residual-reachability partition
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -4726,6 +4890,7 @@ export declare const maximumFlow: {
  * ```
  *
  * @see {@link maximumFlow} for per-edge flow values
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4766,6 +4931,7 @@ export declare const minimumCut: {
      * ```
      *
      * @see {@link maximumFlow} for per-edge flow values
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -4806,6 +4972,7 @@ export declare const minimumCut: {
      * ```
      *
      * @see {@link maximumFlow} for per-edge flow values
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -4831,6 +4998,7 @@ export declare const minimumCut: {
  * @see {@link isWeaklyConnected} when only a boolean check is needed
  * @see {@link stronglyConnectedComponents} for mutual directed reachability
  *
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4871,6 +5039,7 @@ export declare const weaklyConnectedComponents: <N, E>(graph: Graph<N, E, "direc
  *
  * @see {@link isStronglyConnected} when only a boolean check is needed
  * @see {@link weaklyConnectedComponents} when edge orientation should be ignored
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -4890,6 +5059,7 @@ export declare const stronglyConnectedComponents: <N, E>(graph: Graph<N, E, "dir
  *
  * @see {@link connectedComponents} for the component partition
  *
+ * @stability unstable
  * @category predicates
  * @since 4.0.0
  */
@@ -4909,6 +5079,7 @@ export declare const isConnected: <N, E>(graph: Graph<N, E, "undirected"> | Muta
  *
  * @see {@link isStronglyConnected} when edge orientation must be respected
  *
+ * @stability unstable
  * @category predicates
  * @since 4.0.0
  */
@@ -4928,6 +5099,7 @@ export declare const isWeaklyConnected: <N, E>(graph: Graph<N, E, "directed"> |
  *
  * @see {@link isWeaklyConnected} when edge orientation should be ignored
  *
+ * @stability unstable
  * @category predicates
  * @since 4.0.0
  */
@@ -4944,6 +5116,7 @@ export declare const isStronglyConnected: <N, E>(graph: Graph<N, E, "directed">
  * The empty graph is not a tree. Parallel edges and self-loops prevent a graph
  * from being a tree. Throws a `GraphError` when used with a directed graph.
  *
+ * @stability unstable
  * @category predicates
  * @since 4.0.0
  */
@@ -4969,6 +5142,7 @@ export declare const isTree: <N, E>(graph: Graph<N, E, "undirected"> | MutableGr
  * Throws a `GraphError` for a directed graph or when a weight is `NaN` or
  * `-Infinity`. Edges weighted `Infinity` are omitted.
  *
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -4994,6 +5168,7 @@ export declare const minimumSpanningForest: {
      * Throws a `GraphError` for a directed graph or when a weight is `NaN` or
      * `-Infinity`. Edges weighted `Infinity` are omitted.
      *
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -5019,6 +5194,7 @@ export declare const minimumSpanningForest: {
      * Throws a `GraphError` for a directed graph or when a weight is `NaN` or
      * `-Infinity`. Edges weighted `Infinity` are omitted.
      *
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -5043,6 +5219,7 @@ export declare const minimumSpanningForest: {
  * coalesced by retaining the first edge for each required pair. Throws a
  * `GraphError` for an undirected graph or cyclic input.
  *
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -5066,6 +5243,7 @@ export declare const transitiveReduction: <N, E>(graph: Graph<N, E, "directed">
  * `costs` contains original edge data, not the numeric output of the cost
  * function unless the edge data is numeric.
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -5094,6 +5272,7 @@ export interface PathResult<E> {
  * `dijkstra` throws a `GraphError` when either endpoint does not exist or when
  * the cost function returns a negative weight or `NaN`.
  *
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -5148,6 +5327,7 @@ export interface DijkstraConfig<E> {
  * @see {@link astar} when a useful heuristic can guide the search
  * @see {@link bellmanFord} when edge costs may be negative
  * @see {@link floydWarshall} when shortest paths are needed for all pairs
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -5198,6 +5378,7 @@ export declare const dijkstra: {
      * @see {@link astar} when a useful heuristic can guide the search
      * @see {@link bellmanFord} when edge costs may be negative
      * @see {@link floydWarshall} when shortest paths are needed for all pairs
+     * @stability unstable
      * @category algorithms
      * @since 3.18.0
      */
@@ -5248,6 +5429,7 @@ export declare const dijkstra: {
      * @see {@link astar} when a useful heuristic can guide the search
      * @see {@link bellmanFord} when edge costs may be negative
      * @see {@link floydWarshall} when shortest paths are needed for all pairs
+     * @stability unstable
      * @category algorithms
      * @since 3.18.0
      */
@@ -5268,6 +5450,7 @@ export declare const dijkstra: {
  * source and target node indices. Unreachable pairs have distance `Infinity`,
  * path `null`, and empty edge and cost arrays.
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -5283,14 +5466,16 @@ export interface AllPairsResult<E> {
  *
  * **When to use**
  *
- * Use when many or all node pairs will be queried and cubic computation plus
- * quadratic result storage is acceptable.
+ * Use when many or all node pairs will be queried and cubic distance computation
+ * plus storage for reconstructed paths is acceptable.
  *
  * **Details**
  *
  * Computes distances, reconstructed node paths, and edge-data paths for every
- * source and target pair in O(V^3) time. Negative edge weights are allowed, and
- * `Infinity` behaves like an impassable edge.
+ * source and target pair. Distance computation takes O(V^3) time. Negative edge
+ * weights are allowed, and `Infinity` behaves like an impassable edge. Immutable
+ * path witnesses can require O(V^3) working storage; reconstructed paths have
+ * repeated nodes removed.
  *
  * **Gotchas**
  *
@@ -5319,6 +5504,7 @@ export interface AllPairsResult<E> {
  *
  * @see {@link dijkstra} for one query with non-negative edge costs
  * @see {@link bellmanFord} for one query that may include negative edge costs
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -5329,14 +5515,16 @@ export declare const floydWarshall: {
      *
      * **When to use**
      *
-     * Use when many or all node pairs will be queried and cubic computation plus
-     * quadratic result storage is acceptable.
+     * Use when many or all node pairs will be queried and cubic distance computation
+     * plus storage for reconstructed paths is acceptable.
      *
      * **Details**
      *
      * Computes distances, reconstructed node paths, and edge-data paths for every
-     * source and target pair in O(V^3) time. Negative edge weights are allowed, and
-     * `Infinity` behaves like an impassable edge.
+     * source and target pair. Distance computation takes O(V^3) time. Negative edge
+     * weights are allowed, and `Infinity` behaves like an impassable edge. Immutable
+     * path witnesses can require O(V^3) working storage; reconstructed paths have
+     * repeated nodes removed.
      *
      * **Gotchas**
      *
@@ -5365,6 +5553,7 @@ export declare const floydWarshall: {
      *
      * @see {@link dijkstra} for one query with non-negative edge costs
      * @see {@link bellmanFord} for one query that may include negative edge costs
+     * @stability unstable
      * @category algorithms
      * @since 3.18.0
      */
@@ -5375,14 +5564,16 @@ export declare const floydWarshall: {
      *
      * **When to use**
      *
-     * Use when many or all node pairs will be queried and cubic computation plus
-     * quadratic result storage is acceptable.
+     * Use when many or all node pairs will be queried and cubic distance computation
+     * plus storage for reconstructed paths is acceptable.
      *
      * **Details**
      *
      * Computes distances, reconstructed node paths, and edge-data paths for every
-     * source and target pair in O(V^3) time. Negative edge weights are allowed, and
-     * `Infinity` behaves like an impassable edge.
+     * source and target pair. Distance computation takes O(V^3) time. Negative edge
+     * weights are allowed, and `Infinity` behaves like an impassable edge. Immutable
+     * path witnesses can require O(V^3) working storage; reconstructed paths have
+     * repeated nodes removed.
      *
      * **Gotchas**
      *
@@ -5411,6 +5602,7 @@ export declare const floydWarshall: {
      *
      * @see {@link dijkstra} for one query with non-negative edge costs
      * @see {@link bellmanFord} for one query that may include negative edge costs
+     * @stability unstable
      * @category algorithms
      * @since 3.18.0
      */
@@ -5435,6 +5627,7 @@ export declare const floydWarshall: {
  * Heuristic values must be finite and the heuristic must be consistent for A*
  * to guarantee a shortest path.
  *
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -5496,6 +5689,7 @@ export interface AstarConfig<E, N> {
  *
  * @see {@link dijkstra} when no useful heuristic is available
  * @see {@link bellmanFord} when edge costs may be negative
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -5552,6 +5746,7 @@ export declare const astar: {
      *
      * @see {@link dijkstra} when no useful heuristic is available
      * @see {@link bellmanFord} when edge costs may be negative
+     * @stability unstable
      * @category algorithms
      * @since 3.18.0
      */
@@ -5608,6 +5803,7 @@ export declare const astar: {
      *
      * @see {@link dijkstra} when no useful heuristic is available
      * @see {@link bellmanFord} when edge costs may be negative
+     * @stability unstable
      * @category algorithms
      * @since 3.18.0
      */
@@ -5626,6 +5822,7 @@ export declare const astar: {
  * Specifies the source and target node indices, plus a cost function that maps
  * each edge's data to a numeric weight.
  *
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -5679,6 +5876,7 @@ export interface BellmanFordConfig<E> {
  * ```
  *
  * @see {@link dijkstra} for non-negative edge costs
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -5728,6 +5926,7 @@ export declare const bellmanFord: {
      * ```
      *
      * @see {@link dijkstra} for non-negative edge costs
+     * @stability unstable
      * @category algorithms
      * @since 3.18.0
      */
@@ -5777,6 +5976,7 @@ export declare const bellmanFord: {
      * ```
      *
      * @see {@link dijkstra} for non-negative edge costs
+     * @stability unstable
      * @category algorithms
      * @since 3.18.0
      */
@@ -5793,6 +5993,7 @@ export declare const bellmanFord: {
  *
  * Each fresh iterator repeats the path enumeration.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -5813,6 +6014,7 @@ export interface PathWalker<E> extends Iterable<PathResult<E>> {
  *
  * `limit` must be a non-negative integer or `Infinity`.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -5837,6 +6039,7 @@ export interface SimplePathsConfig {
  *
  * Invalid costs and limits throw a `GraphError` when evaluated.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -5864,6 +6067,7 @@ export interface AllShortestPathsConfig<E> extends DijkstraConfig<E> {
  *
  * @see {@link allShortestPaths} for enumerating only minimum-cost routes
  *
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -5889,6 +6093,7 @@ export declare const simplePaths: {
      *
      * @see {@link allShortestPaths} for enumerating only minimum-cost routes
      *
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -5914,6 +6119,7 @@ export declare const simplePaths: {
      *
      * @see {@link allShortestPaths} for enumerating only minimum-cost routes
      *
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -5940,6 +6146,7 @@ export declare const simplePaths: {
  * @see {@link dijkstra} when one shortest path is sufficient
  * @see {@link simplePaths} for routes regardless of cost
  *
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -5965,6 +6172,7 @@ export declare const allShortestPaths: {
      * @see {@link dijkstra} when one shortest path is sufficient
      * @see {@link simplePaths} for routes regardless of cost
      *
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -5990,6 +6198,7 @@ export declare const allShortestPaths: {
      * @see {@link dijkstra} when one shortest path is sufficient
      * @see {@link simplePaths} for routes regardless of cost
      *
+     * @stability unstable
      * @category algorithms
      * @since 4.0.0
      */
@@ -6029,6 +6238,7 @@ export declare const allShortestPaths: {
  * Array.from(Graph.entries(allNodes)) // => [[0, "A"], [1, "B"]]
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -6079,6 +6289,7 @@ export declare class Walker<T, N> implements Iterable<[T, N]> {
  * @see {@link Walker} for the generic lazy iterator wrapper
  * @see {@link EdgeWalker} for edge iterators
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -6097,6 +6308,7 @@ export type NodeWalker<N> = Walker<NodeIndex, N>;
  * @see {@link NodeWalker} for node iterators
  * @see {@link edges} for creating edge walkers
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -6119,6 +6331,7 @@ export type EdgeWalker<E> = Walker<EdgeIndex, Edge<E>>;
  * Array.from(Graph.indices(dfs)) // => [0, 1]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6141,6 +6354,7 @@ export declare const indices: <T, N>(walker: Walker<T, N>) => Iterable<T>;
  * Array.from(Graph.values(dfs)) // => ["A", "B"]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6163,6 +6377,7 @@ export declare const values: <T, N>(walker: Walker<T, N>) => Iterable<N>;
  * Array.from(Graph.entries(dfs)) // => [[0, "A"], [1, "B"]]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6191,6 +6406,7 @@ export declare const entries: <T, N>(walker: Walker<T, N>) => Iterable<[T, N]>;
  * revalidates those starts against the graph snapshot it captures. Later
  * mutations are not observed by an active iterator.
  *
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -6241,6 +6457,7 @@ export interface SearchConfig {
  *
  * @see {@link bfs} for traversal in increasing hop distance
  * @see {@link dfsPostOrder} for emitting descendants before ancestors
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6287,6 +6504,7 @@ export declare const dfs: {
      *
      * @see {@link bfs} for traversal in increasing hop distance
      * @see {@link dfsPostOrder} for emitting descendants before ancestors
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6333,6 +6551,7 @@ export declare const dfs: {
      *
      * @see {@link bfs} for traversal in increasing hop distance
      * @see {@link dfsPostOrder} for emitting descendants before ancestors
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6381,6 +6600,7 @@ export declare const dfs: {
  *
  * @see {@link dfs} for branch-first traversal
  * @see {@link unweightedDistances} for collecting hop counts
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6428,6 +6648,7 @@ export declare const bfs: {
      *
      * @see {@link dfs} for branch-first traversal
      * @see {@link unweightedDistances} for collecting hop counts
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6475,6 +6696,7 @@ export declare const bfs: {
      *
      * @see {@link dfs} for branch-first traversal
      * @see {@link unweightedDistances} for collecting hop counts
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6497,6 +6719,7 @@ export declare const bfs: {
  *
  * Throws a `GraphError` when any initial node has incoming edges.
  *
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -6540,6 +6763,7 @@ export interface TopoConfig {
  * ```
  *
  * @see {@link isAcyclic} for checking the required graph property
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6581,6 +6805,7 @@ export declare const topo: {
      * ```
      *
      * @see {@link isAcyclic} for checking the required graph property
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6622,6 +6847,7 @@ export declare const topo: {
      * ```
      *
      * @see {@link isAcyclic} for checking the required graph property
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6670,6 +6896,7 @@ export declare const topo: {
  * ```
  *
  * @see {@link dfs} for emitting nodes when first visited
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6717,6 +6944,7 @@ export declare const dfsPostOrder: {
      * ```
      *
      * @see {@link dfs} for emitting nodes when first visited
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6764,6 +6992,7 @@ export declare const dfsPostOrder: {
      * ```
      *
      * @see {@link dfs} for emitting nodes when first visited
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6797,6 +7026,7 @@ export declare const dfsPostOrder: {
  * Array.from(Graph.indices(Graph.nodes(graph))) // => [0, 1, 2]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6830,6 +7060,7 @@ export declare const nodes: <N, E, T extends Kind = "directed">(graph: Graph<N,
  * Array.from(Graph.indices(Graph.edges(graph))) // => [0, 1]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6849,6 +7080,7 @@ export declare const edges: <N, E, T extends Kind = "directed">(graph: Graph<N,
  * nodes with no incoming edges. If omitted, `direction` defaults to
  * `"outgoing"`.
  *
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -6895,6 +7127,7 @@ export interface ExternalsConfig {
  * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -6939,6 +7172,7 @@ export declare const externals: {
      * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
      * ```
      *
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */
@@ -6983,6 +7217,7 @@ export declare const externals: {
      * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
      * ```
      *
+     * @stability unstable
      * @category iterators
      * @since 3.18.0
      */