effect 4.0.1 → 4.0.2

package/src/Graph.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
  */
 
@@ -42,6 +43,7 @@ const TypeId = internal.TypeId
  *
  * @see {@link EdgeIndex} for edge identifiers instead of node identifiers
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -62,6 +64,7 @@ export type NodeIndex = number
  *
  * @see {@link NodeIndex} for node identifiers instead of edge identifiers
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -75,6 +78,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
  */
@@ -92,6 +96,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
  */
@@ -100,6 +105,7 @@ export type Kind = "directed" | "undirected"
 /**
  * A node and its stable index in a graph snapshot.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -111,6 +117,7 @@ export interface IndexedNode<out N> {
 /**
  * An edge and its stable index in a graph snapshot.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -137,6 +144,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
  */
@@ -161,6 +169,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
  */
@@ -175,6 +184,7 @@ export interface Graph<out N, out E, T extends Kind = "directed">
 /**
  * Companion namespace containing type-level metadata for immutable graphs.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -208,6 +218,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
  */
@@ -222,6 +233,7 @@ export interface MutableGraph<in out N, in out E, T extends Kind = "directed">
 /**
  * Companion namespace containing type-level metadata for scoped mutable graphs.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -261,6 +273,7 @@ const copyEdge = <E>(edge: Edge<E>): Edge<E> => ({
  * @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
  */
@@ -281,6 +294,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
  */
@@ -297,6 +311,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
  */
@@ -313,6 +328,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
  */
@@ -334,6 +350,7 @@ export type MutableUndirectedGraph<N, E> = MutableGraph<N, E, "undirected">
  * 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
  */
@@ -398,6 +415,7 @@ const withMutationGuard = <N, E, T extends Kind, A>(
  * distinguish immutable graphs from mutable graphs or directed graphs from
  * undirected graphs.
  *
+ * @stability unstable
  * @category guards
  * @since 4.0.0
  */
@@ -436,6 +454,7 @@ export const isGraph: <N = unknown, E = unknown, T extends Kind = Kind, U = neve
  * ```
  *
  * @see {@link toSnapshot} for capturing a graph snapshot
+ * @stability unstable
  * @category constructors
  * @since 4.0.0
  */
@@ -526,6 +545,7 @@ export const fromSnapshot = <N, E, T extends Kind>(snapshot: Snapshot<N, E, T>):
  * ```
  *
  * @see {@link fromSnapshot} for reconstructing an immutable graph
+ * @stability unstable
  * @category converting
  * @since 4.0.0
  */
@@ -568,6 +588,7 @@ export const toSnapshot = <N, E, T extends Kind = "directed">(
  *
  * @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
  */
@@ -614,6 +635,7 @@ export const make =
  * Array.of(Graph.nodeCount(graph), Graph.edgeCount(graph)) // => [3, 2]
  * ```
  *
+ * @stability unstable
  * @category constructors
  * @since 3.18.0
  */
@@ -650,6 +672,7 @@ export const directed: <N, E>(
  * Array.of(Graph.nodeCount(graph), Graph.edgeCount(graph)) // => [3, 2]
  * ```
  *
+ * @stability unstable
  * @category constructors
  * @since 3.18.0
  */
@@ -688,6 +711,7 @@ export const undirected: <N, E>(
  *
  * @see {@link endMutation} for finalizing the mutable graph
  * @see {@link mutate} for automatically scoped mutation
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -724,6 +748,7 @@ export const beginMutation = <N, E, T extends Kind = "directed">(
  *
  * @see {@link beginMutation} for opening a manual mutation scope
  * @see {@link mutate} for automatically scoped mutation
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -795,6 +820,7 @@ const mutateScoped = <N, E, T extends Kind>(
  *
  * @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
  */
@@ -836,6 +862,7 @@ export 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
    */
@@ -877,6 +904,7 @@ export 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
    */
@@ -962,6 +990,7 @@ class EdgeIdentity<NI, EI> implements Equal.Equal {
  * 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
  */
@@ -1094,6 +1123,7 @@ const assertSameKind = <N, E>(self: Graph<N, E, Kind>, that: Graph<N, E, Kind>):
  * ```
  *
  * @see {@link sum} for combining graphs without merging equal nodes
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -1148,6 +1178,7 @@ export const compose: {
    * ```
    *
    * @see {@link sum} for combining graphs without merging equal nodes
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1202,6 +1233,7 @@ export const compose: {
    * ```
    *
    * @see {@link sum} for combining graphs without merging equal nodes
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1272,6 +1304,7 @@ export const compose: {
      * ```
      *
      * @see {@link sum} for combining graphs without merging equal nodes
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1325,6 +1358,7 @@ export const compose: {
      * ```
      *
      * @see {@link sum} for combining graphs without merging equal nodes
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1392,6 +1426,7 @@ export const compose: {
      * ```
      *
      * @see {@link sum} for combining graphs without merging equal nodes
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1445,6 +1480,7 @@ export const compose: {
      * ```
      *
      * @see {@link sum} for combining graphs without merging equal nodes
+     * @stability unstable
      * @category set operations
      * @since 4.0.0
      */
@@ -1506,6 +1542,7 @@ export const compose: {
  * ```
  *
  * @see {@link compose} for identity-based graph union
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -1558,6 +1595,7 @@ export const intersection: {
    * ```
    *
    * @see {@link compose} for identity-based graph union
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1610,6 +1648,7 @@ export const intersection: {
    * ```
    *
    * @see {@link compose} for identity-based graph union
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1677,6 +1716,7 @@ export const intersection: {
    * ```
    *
    * @see {@link compose} for identity-based graph union
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1728,6 +1768,7 @@ export const intersection: {
    * ```
    *
    * @see {@link compose} for identity-based graph union
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1781,6 +1822,7 @@ export const intersection: {
    * ```
    *
    * @see {@link compose} for identity-based graph union
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1832,6 +1874,7 @@ export const intersection: {
    * ```
    *
    * @see {@link compose} for identity-based graph union
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1900,6 +1943,7 @@ export const intersection: {
    * ```
    *
    * @see {@link compose} for identity-based graph union
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -1951,6 +1995,7 @@ export const intersection: {
    * ```
    *
    * @see {@link compose} for identity-based graph union
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2015,6 +2060,7 @@ export const intersection: {
  * ```
  *
  * @see {@link symmetricDifference} for retaining edges unique to either graph
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -2069,6 +2115,7 @@ export const difference: {
    * ```
    *
    * @see {@link symmetricDifference} for retaining edges unique to either graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2123,6 +2170,7 @@ export const difference: {
    * ```
    *
    * @see {@link symmetricDifference} for retaining edges unique to either graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2194,6 +2242,7 @@ export const difference: {
    * ```
    *
    * @see {@link symmetricDifference} for retaining edges unique to either graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2247,6 +2296,7 @@ export const difference: {
    * ```
    *
    * @see {@link symmetricDifference} for retaining edges unique to either graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2317,6 +2367,7 @@ export const difference: {
  * ```
  *
  * @see {@link difference} for removing only the edges found in another graph
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -2374,6 +2425,7 @@ export const symmetricDifference: {
    * ```
    *
    * @see {@link difference} for removing only the edges found in another graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2431,6 +2483,7 @@ export const symmetricDifference: {
    * ```
    *
    * @see {@link difference} for removing only the edges found in another graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2502,6 +2555,7 @@ export const symmetricDifference: {
    * ```
    *
    * @see {@link difference} for removing only the edges found in another graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2558,6 +2612,7 @@ export const symmetricDifference: {
    * ```
    *
    * @see {@link difference} for removing only the edges found in another graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2626,6 +2681,7 @@ export const symmetricDifference: {
    * ```
    *
    * @see {@link difference} for removing only the edges found in another graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2682,6 +2738,7 @@ export const symmetricDifference: {
    * ```
    *
    * @see {@link difference} for removing only the edges found in another graph
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2741,6 +2798,7 @@ export const symmetricDifference: {
  * ```
  *
  * @see {@link hasEdge} for testing one relationship
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -2784,6 +2842,7 @@ export const complement: {
    * ```
    *
    * @see {@link hasEdge} for testing one relationship
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2827,6 +2886,7 @@ export const complement: {
    * ```
    *
    * @see {@link hasEdge} for testing one relationship
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2878,6 +2938,7 @@ export const complement: {
    * ```
    *
    * @see {@link hasEdge} for testing one relationship
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2920,6 +2981,7 @@ export const complement: {
    * ```
    *
    * @see {@link hasEdge} for testing one relationship
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -2957,6 +3019,7 @@ export const complement: {
  * `direction` controls how directed edges are traversed and defaults to
  * `"outgoing"`.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -3006,6 +3069,7 @@ export interface NeighborhoodConfig {
  * ```
  *
  * @see {@link inducedSubgraph} for selecting nodes while preserving identifiers
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -3051,6 +3115,7 @@ export const neighborhood: {
    * ```
    *
    * @see {@link inducedSubgraph} for selecting nodes while preserving identifiers
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3096,6 +3161,7 @@ export const neighborhood: {
    * ```
    *
    * @see {@link inducedSubgraph} for selecting nodes while preserving identifiers
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3155,6 +3221,7 @@ export const neighborhood: {
    * ```
    *
    * @see {@link inducedSubgraph} for selecting nodes while preserving identifiers
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3199,6 +3266,7 @@ export const neighborhood: {
    * ```
    *
    * @see {@link inducedSubgraph} for selecting nodes while preserving identifiers
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3241,6 +3309,7 @@ export const neighborhood: {
  *
  * @see {@link neighborhood} for selecting nodes by traversal distance
  *
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -3265,6 +3334,7 @@ export const inducedSubgraph: {
    *
    * @see {@link neighborhood} for selecting nodes by traversal distance
    *
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3289,6 +3359,7 @@ export const inducedSubgraph: {
    *
    * @see {@link neighborhood} for selecting nodes by traversal distance
    *
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3343,6 +3414,7 @@ export const inducedSubgraph: {
  *
  * @see {@link compose} for merging overlapping logical nodes by identity
  *
+ * @stability unstable
  * @category set operations
  * @since 4.0.0
  */
@@ -3369,6 +3441,7 @@ export const sum: {
    *
    * @see {@link compose} for merging overlapping logical nodes by identity
    *
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3395,6 +3468,7 @@ export const sum: {
    *
    * @see {@link compose} for merging overlapping logical nodes by identity
    *
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3423,6 +3497,7 @@ export const sum: {
    *
    * @see {@link compose} for merging overlapping logical nodes by identity
    *
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3448,6 +3523,7 @@ export const sum: {
    *
    * @see {@link compose} for merging overlapping logical nodes by identity
    *
+   * @stability unstable
    * @category set operations
    * @since 4.0.0
    */
@@ -3510,6 +3586,7 @@ export 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
  */
@@ -3551,6 +3628,7 @@ export const addNode = <N, E, T extends Kind = "directed">(
  * Graph.getNode(graph, 0) // => Option.some("Node A")
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -3570,6 +3648,7 @@ export const getNode: {
    * Graph.getNode(graph, 0) // => Option.some("Node A")
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -3591,6 +3670,7 @@ export const getNode: {
    * Graph.getNode(graph, 0) // => Option.some("Node A")
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -3619,6 +3699,7 @@ export const getNode: {
  * Graph.hasNode(graph, 999) // => false
  * ```
  *
+ * @stability unstable
  * @category predicates
  * @since 3.18.0
  */
@@ -3639,6 +3720,7 @@ export const hasNode: {
    * Graph.hasNode(graph, 999) // => false
    * ```
    *
+   * @stability unstable
    * @category predicates
    * @since 3.18.0
    */
@@ -3659,6 +3741,7 @@ export const hasNode: {
    * Graph.hasNode(graph, 999) // => false
    * ```
    *
+   * @stability unstable
    * @category predicates
    * @since 3.18.0
    */
@@ -3688,6 +3771,7 @@ export const hasNode: {
  * Graph.nodeCount(graphWithNodes) // => 3
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -3713,6 +3797,7 @@ export const nodeCount = <N, E, T extends Kind = "directed">(
  * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -3735,6 +3820,7 @@ export const findNode: {
    * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -3757,6 +3843,7 @@ export const findNode: {
    * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -3797,6 +3884,7 @@ export const findNode: {
  * Graph.findNodes(graph, (data) => data === "Not Found") // => []
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -3819,6 +3907,7 @@ export const findNodes: {
    * Graph.findNodes(graph, (data) => data === "Not Found") // => []
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -3841,6 +3930,7 @@ export const findNodes: {
    * Graph.findNodes(graph, (data) => data === "Not Found") // => []
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -3884,6 +3974,7 @@ export const findNodes: {
  * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -3908,6 +3999,7 @@ export const findEdge: {
    * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -3932,6 +4024,7 @@ export const findEdge: {
    * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -3975,6 +4068,7 @@ export const findEdge: {
  * Graph.findEdges(graph, (data) => data > 100) // => []
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -4000,6 +4094,7 @@ export const findEdges: {
    * Graph.findEdges(graph, (data) => data > 100) // => []
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -4025,6 +4120,7 @@ export const findEdges: {
    * Graph.findEdges(graph, (data) => data > 100) // => []
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -4075,6 +4171,7 @@ export const findEdges: {
  * Graph.getNode(graph, 0) // => Option.some("NODE A")
  * ```
  *
+ * @stability unstable
  * @category transforming
  * @since 3.18.0
  */
@@ -4123,6 +4220,7 @@ export const updateNode = <N, E, T extends Kind = "directed">(
  * Option.map(Graph.getEdge(result, 0), (edge) => edge.data) // => Option.some(20)
  * ```
  *
+ * @stability unstable
  * @category transforming
  * @since 3.18.0
  */
@@ -4182,6 +4280,7 @@ export const updateEdge = <N, E, T extends Kind = "directed">(
  *
  * @see {@link updateNode} for updating one node
  * @see {@link filterMapNodes} for mapping while removing nodes
+ * @stability unstable
  * @category mapping
  * @since 3.18.0
  */
@@ -4235,6 +4334,7 @@ export const mapNodes = <N, E, T extends Kind = "directed">(
  *
  * @see {@link updateEdge} for updating one edge
  * @see {@link filterMapEdges} for mapping while removing edges
+ * @stability unstable
  * @category mapping
  * @since 3.18.0
  */
@@ -4289,6 +4389,7 @@ export const mapEdges = <N, E, T extends Kind = "directed">(
  * Option.map(Graph.getEdge(graph, 0), (edge) => edge.source) // => Option.some(1)
  * ```
  *
+ * @stability unstable
  * @category transforming
  * @since 3.18.0
  */
@@ -4349,6 +4450,7 @@ export const reverse = <N, E, T extends Kind = "directed">(
  * Graph.nodeCount(graph) // => 2
  * ```
  *
+ * @stability unstable
  * @category filtering
  * @since 3.18.0
  */
@@ -4408,6 +4510,7 @@ export const filterMapNodes = <N, E, T extends Kind = "directed">(
  * Graph.edgeCount(graph) // => 2
  * ```
  *
+ * @stability unstable
  * @category filtering
  * @since 3.18.0
  */
@@ -4468,6 +4571,7 @@ export const filterMapEdges = <N, E, T extends Kind = "directed">(
  * Graph.nodeCount(graph) // => 2
  * ```
  *
+ * @stability unstable
  * @category filtering
  * @since 3.18.0
  */
@@ -4522,6 +4626,7 @@ export const filterNodes = <N, E, T extends Kind = "directed">(
  * Graph.edgeCount(graph) // => 2
  * ```
  *
+ * @stability unstable
  * @category filtering
  * @since 3.18.0
  */
@@ -4607,6 +4712,7 @@ const invalidateCycleFlagOnAddition = <N, E, T extends Kind = "directed">(
  * @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
  */
@@ -4692,6 +4798,7 @@ export const addEdge = <N, E, T extends Kind = "directed">(
  * Array.of(Graph.nodeCount(result), Graph.edgeCount(result)) // => [1, 0]
  * ```
  *
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -4724,6 +4831,7 @@ export const removeNode = <N, E, T extends Kind = "directed">(
  *
  * @see {@link removeNode} for removing one node
  *
+ * @stability unstable
  * @category mutations
  * @since 4.0.0
  */
@@ -4817,6 +4925,7 @@ const removeNodeInternal = <N, E, T extends Kind = "directed">(
  * Array.of(Graph.nodeCount(result), Graph.edgeCount(result)) // => [2, 0]
  * ```
  *
+ * @stability unstable
  * @category mutations
  * @since 3.18.0
  */
@@ -4850,6 +4959,7 @@ export const removeEdge = <N, E, T extends Kind = "directed">(
  *
  * @see {@link removeEdge} for removing one edge
  *
+ * @stability unstable
  * @category mutations
  * @since 4.0.0
  */
@@ -4952,6 +5062,7 @@ const removeEdgeInternal = <N, E, T extends Kind = "directed">(
  * Graph.getEdge(graph, 0) // => Option.some({ source: 0, target: 1, data: 42 })
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -4977,6 +5088,7 @@ export const getEdge: {
    * Graph.getEdge(graph, 0) // => Option.some({ source: 0, target: 1, data: 42 })
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -5004,6 +5116,7 @@ export const getEdge: {
    * Graph.getEdge(graph, 0) // => Option.some({ source: 0, target: 1, data: 42 })
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -5045,6 +5158,7 @@ export const getEdge: {
  * ```
  *
  * @see {@link edgesBetween} for all matching edge identifiers
+ * @stability unstable
  * @category predicates
  * @since 3.18.0
  */
@@ -5078,6 +5192,7 @@ export const hasEdge: {
    * ```
    *
    * @see {@link edgesBetween} for all matching edge identifiers
+   * @stability unstable
    * @category predicates
    * @since 3.18.0
    */
@@ -5111,6 +5226,7 @@ export const hasEdge: {
    * ```
    *
    * @see {@link edgesBetween} for all matching edge identifiers
+   * @stability unstable
    * @category predicates
    * @since 3.18.0
    */
@@ -5167,6 +5283,7 @@ export const hasEdge: {
  * Graph.edgeCount(graphWithEdges) // => 3
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -5182,6 +5299,7 @@ export const edgeCount = <N, E, T extends Kind = "directed">(
  * 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
  */
@@ -5194,6 +5312,7 @@ export 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
    */
@@ -5206,6 +5325,7 @@ export 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
    */
@@ -5263,6 +5383,7 @@ export 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
  */
@@ -5275,6 +5396,7 @@ export 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
    */
@@ -5289,6 +5411,7 @@ export 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
    */
@@ -5318,6 +5441,7 @@ export 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
  */
@@ -5330,6 +5454,7 @@ export 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
    */
@@ -5344,6 +5469,7 @@ export 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
    */
@@ -5374,6 +5500,7 @@ export 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
  */
@@ -5387,6 +5514,7 @@ export 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
    */
@@ -5402,6 +5530,7 @@ export 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
    */
@@ -5446,6 +5575,7 @@ export 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
  */
@@ -5458,6 +5588,7 @@ export 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
    */
@@ -5472,6 +5603,7 @@ export 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
    */
@@ -5501,6 +5633,7 @@ export 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
  */
@@ -5513,6 +5646,7 @@ export 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
    */
@@ -5527,6 +5661,7 @@ export 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
    */
@@ -5556,6 +5691,7 @@ export 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
  */
@@ -5568,6 +5704,7 @@ export 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
    */
@@ -5582,6 +5719,7 @@ export 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
    */
@@ -5707,6 +5845,7 @@ const ScanDegreeLimit = 32
  * Graph.neighbors(graph, 1) // => []
  * ```
  *
+ * @stability unstable
  * @category getters
  * @since 3.18.0
  */
@@ -5743,6 +5882,7 @@ export const neighbors: {
    * Graph.neighbors(graph, 1) // => []
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -5779,6 +5919,7 @@ export const neighbors: {
    * Graph.neighbors(graph, 1) // => []
    * ```
    *
+   * @stability unstable
    * @category getters
    * @since 3.18.0
    */
@@ -5814,6 +5955,7 @@ export 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
  */
@@ -5837,6 +5979,7 @@ export 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
    */
@@ -5860,6 +6003,7 @@ export 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
    */
@@ -5896,6 +6040,7 @@ export 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
  */
@@ -5919,6 +6064,7 @@ export 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
    */
@@ -5942,6 +6088,7 @@ export 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
    */
@@ -5998,6 +6145,7 @@ export 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
  */
@@ -6041,6 +6189,7 @@ export 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
    */
@@ -6084,6 +6233,7 @@ export 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
    */
@@ -6140,6 +6290,7 @@ export const neighborsDirected: {
  * ```
  *
  * @see {@link toGraphViz} for generating DOT output
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -6192,6 +6343,7 @@ const escapeGraphVizString = (value: string): string =>
  * ```
  *
  * @see {@link toMermaid} for Mermaid diagram output
+ * @stability unstable
  * @category converting
  * @since 3.18.0
  */
@@ -6222,6 +6374,7 @@ export const toGraphViz: {
    * ```
    *
    * @see {@link toMermaid} for Mermaid diagram output
+   * @stability unstable
    * @category converting
    * @since 3.18.0
    */
@@ -6252,6 +6405,7 @@ export const toGraphViz: {
    * ```
    *
    * @see {@link toMermaid} for Mermaid diagram output
+   * @stability unstable
    * @category converting
    * @since 3.18.0
    */
@@ -6335,6 +6489,7 @@ export const toGraphViz: {
  * options.nodeShape?.("decision") // => "diamond"
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -6381,6 +6536,7 @@ export type MermaidNodeShape =
  * Array.of(horizontalOptions.direction, verticalOptions.direction, bottomUpOptions.direction) // => ["LR", "TB", "BT"]
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -6423,6 +6579,7 @@ export type MermaidDirection =
  * Array.of(flowchartOptions.diagramType, graphOptions.diagramType, autoOptions.diagramType) // => ["flowchart", "graph", undefined]
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -6466,6 +6623,7 @@ export type MermaidDiagramType =
  * ```
  *
  * @see {@link toMermaid} for generating Mermaid output
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -6584,6 +6742,7 @@ const formatMermaidNode = (
  * ```
  *
  * @see {@link toGraphViz} for GraphViz DOT output
+ * @stability unstable
  * @category converting
  * @since 3.18.0
  */
@@ -6617,6 +6776,7 @@ export const toMermaid: {
    * ```
    *
    * @see {@link toGraphViz} for GraphViz DOT output
+   * @stability unstable
    * @category converting
    * @since 3.18.0
    */
@@ -6650,6 +6810,7 @@ export const toMermaid: {
    * ```
    *
    * @see {@link toGraphViz} for GraphViz DOT output
+   * @stability unstable
    * @category converting
    * @since 3.18.0
    */
@@ -6719,6 +6880,7 @@ export 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
  */
@@ -6751,6 +6913,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
  */
@@ -6768,6 +6931,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
  */
@@ -6790,6 +6954,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
  */
@@ -6893,6 +7058,7 @@ export const findCycle = <N, E, T extends Kind = "directed">(
  *
  * @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
  */
@@ -7026,6 +7192,7 @@ export const isAcyclic = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @see {@link maximumBipartiteMatching} for matching nodes after validation
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -7077,6 +7244,7 @@ export const isBipartite = <N, E>(
  * `left` and `right` refer to the bipartition derived by
  * `maximumBipartiteMatching`, not to the stored edge orientation.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -7161,6 +7329,7 @@ const bipartiteColors = <N, E>(
  * ```
  *
  * @see {@link isBipartite} for validating the graph without computing a matching
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -7337,6 +7506,7 @@ const getTraversableNeighbor = <N, E, T extends Kind>(
  *
  * `direction` defaults to `"outgoing"` and is ignored for undirected graphs.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -7412,6 +7582,7 @@ const getUnweightedDistances = <N, E, T extends Kind>(
  * @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
  */
@@ -7437,6 +7608,7 @@ export 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
    */
@@ -7464,6 +7636,7 @@ export 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
    */
@@ -7498,6 +7671,7 @@ export 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
  */
@@ -7522,6 +7696,7 @@ export 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
    */
@@ -7548,6 +7723,7 @@ export 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
    */
@@ -7654,6 +7830,7 @@ export 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
  */
@@ -7877,6 +8054,7 @@ const analyzeLowLinks = <N, E>(
  *
  * @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
  */
@@ -7917,6 +8095,7 @@ export const bridges = <N, E>(
  *
  * @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
  */
@@ -7964,6 +8143,7 @@ export const articulationPoints = <N, E>(
  *
  * @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
  */
@@ -7988,6 +8168,7 @@ export const biconnectedComponents = <N, E>(
  *
  * The source and target must be distinct existing nodes in a directed graph.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -8005,6 +8186,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
  */
@@ -8022,6 +8204,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
  */
@@ -8217,6 +8400,7 @@ const solveMaximumFlow = <N, E>(
  * ```
  *
  * @see {@link minimumCut} for the residual-reachability partition
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -8257,6 +8441,7 @@ export const maximumFlow: {
    * ```
    *
    * @see {@link minimumCut} for the residual-reachability partition
+   * @stability unstable
    * @category algorithms
    * @since 4.0.0
    */
@@ -8299,6 +8484,7 @@ export const maximumFlow: {
    * ```
    *
    * @see {@link minimumCut} for the residual-reachability partition
+   * @stability unstable
    * @category algorithms
    * @since 4.0.0
    */
@@ -8350,6 +8536,7 @@ export const maximumFlow: {
  * ```
  *
  * @see {@link maximumFlow} for per-edge flow values
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -8390,6 +8577,7 @@ export const minimumCut: {
    * ```
    *
    * @see {@link maximumFlow} for per-edge flow values
+   * @stability unstable
    * @category algorithms
    * @since 4.0.0
    */
@@ -8432,6 +8620,7 @@ export const minimumCut: {
    * ```
    *
    * @see {@link maximumFlow} for per-edge flow values
+   * @stability unstable
    * @category algorithms
    * @since 4.0.0
    */
@@ -8472,6 +8661,7 @@ export 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
  */
@@ -8557,6 +8747,7 @@ export const weaklyConnectedComponents = <N, E>(
  *
  * @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
  */
@@ -8690,6 +8881,7 @@ const csrReachesAll = (
  *
  * @see {@link connectedComponents} for the component partition
  *
+ * @stability unstable
  * @category predicates
  * @since 4.0.0
  */
@@ -8718,6 +8910,7 @@ export const isConnected = <N, E>(
  *
  * @see {@link isStronglyConnected} when edge orientation must be respected
  *
+ * @stability unstable
  * @category predicates
  * @since 4.0.0
  */
@@ -8747,6 +8940,7 @@ export const isWeaklyConnected = <N, E>(
  *
  * @see {@link isWeaklyConnected} when edge orientation should be ignored
  *
+ * @stability unstable
  * @category predicates
  * @since 4.0.0
  */
@@ -8773,6 +8967,7 @@ export const isStronglyConnected = <N, E>(
  * 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
  */
@@ -8807,6 +9002,7 @@ export const isTree = <N, E>(
  * 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
  */
@@ -8832,6 +9028,7 @@ export 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
    */
@@ -8859,6 +9056,7 @@ export 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
    */
@@ -8959,6 +9157,7 @@ export 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
  */
@@ -9050,6 +9249,7 @@ export const transitiveReduction = <N, E>(
  * `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
  */
@@ -9206,6 +9406,7 @@ const denseMinHeapPop = (heap: DenseMinHeap): boolean => {
  * `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
  */
@@ -9261,6 +9462,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
  */
@@ -9311,6 +9513,7 @@ export 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
    */
@@ -9361,6 +9564,7 @@ export 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
    */
@@ -9487,6 +9691,7 @@ export 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
  */
@@ -9503,14 +9708,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**
  *
@@ -9539,6 +9746,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
  */
@@ -9549,14 +9757,16 @@ export 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**
    *
@@ -9585,6 +9795,7 @@ export 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
    */
@@ -9595,14 +9806,16 @@ export 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**
    *
@@ -9631,6 +9844,7 @@ export 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
    */
@@ -9647,13 +9861,15 @@ export const floydWarshall: {
   const edgeIds = csr.getEdgeIds(cache)
   const edgeCache = csr.getEdgeEndpoints(cache)
   const size = cache.nodeIds.length
-  // Flat matrices keep the O(N^2) working set contiguous and avoid nested map lookups in the O(N^3) loop.
+  // Immutable witnesses retain the actual walks used by relaxation. Following
+  // independently updated next-hop rows can create cycles through rounding.
+  type Witness =
+    | { readonly target: number; readonly edge: number }
+    | { readonly target: number; readonly left: Witness; readonly right: Witness }
+  const witnesses: Array<Witness | undefined> = new Array(size * size)
+  // The flat distance matrix avoids nested map lookups in the O(N^3) loop.
   const distancesMatrix = new Float64Array(size * size)
-  const nextMatrix = new Int32Array(size * size)
-  const edgeMatrix = new Int32Array(size * size)
   distancesMatrix.fill(Infinity)
-  nextMatrix.fill(-1)
-  edgeMatrix.fill(-1)
   for (let i = 0; i < size; i++) {
     distancesMatrix[i * size + i] = 0
   }
@@ -9669,15 +9885,13 @@ export const floydWarshall: {
       const position = source * size + target
       if (weight < distancesMatrix[position]) {
         distancesMatrix[position] = weight
-        nextMatrix[position] = target
-        edgeMatrix[position] = edge
+        witnesses[position] = { target, edge }
       }
       if (graph.type === "undirected") {
         const reverse = target * size + source
         if (weight < distancesMatrix[reverse]) {
           distancesMatrix[reverse] = weight
-          nextMatrix[reverse] = source
-          edgeMatrix[reverse] = edge
+          witnesses[reverse] = { target: source, edge }
         }
       }
     }
@@ -9691,7 +9905,7 @@ export const floydWarshall: {
       if (distanceIK === Infinity) {
         continue
       }
-      const nextIK = nextMatrix[iRow + k]
+      const left = witnesses[iRow + k]
       for (let j = 0; j < size; j++) {
         const distanceKJ = distancesMatrix[kRow + j]
         if (distanceKJ === Infinity) {
@@ -9701,9 +9915,14 @@ export const floydWarshall: {
         if (!Number.isFinite(candidate)) {
           throw new GraphError({ message: "Floyd-Warshall distance calculation exceeded the finite number range" })
         }
-        if (candidate < distancesMatrix[iRow + j] && nextIK !== -1) {
+        if (candidate < distancesMatrix[iRow + j]) {
           distancesMatrix[iRow + j] = candidate
-          nextMatrix[iRow + j] = nextIK
+          const right = witnesses[kRow + j]
+          witnesses[iRow + j] = left === undefined
+            ? right
+            : right === undefined
+            ? left
+            : { target: j, left, right }
         }
       }
     }
@@ -9719,6 +9938,9 @@ export const floydWarshall: {
   const paths = new Map<NodeIndex, Map<NodeIndex, Array<NodeIndex> | null>>()
   const edgePaths = new Map<NodeIndex, Map<NodeIndex, Array<EdgeIndex>>>()
   const costs = new Map<NodeIndex, Map<NodeIndex, Array<E>>>()
+  // Reuse scratch storage; erased suffixes and completed paths clear only touched entries.
+  const positions = new Int32Array(size)
+  positions.fill(-1)
   for (let i = 0; i < size; i++) {
     const source = cache.nodeIds[i]
     const distanceRow = new Map<NodeIndex, number>()
@@ -9746,19 +9968,35 @@ export const floydWarshall: {
         const path = [source]
         const pathEdges: Array<EdgeIndex> = []
         const pathCosts: Array<E> = []
-        let current = i
-        while (current !== j) {
-          const next = nextMatrix[current * size + j]
-          if (next === -1) {
-            break
-          }
-          const edge = edgeMatrix[current * size + next]
-          if (edge !== -1) {
-            pathEdges.push(edgeIds[edge])
-            pathCosts.push(edges[edge].data)
+        positions[i] = 0
+        const nodes = [i]
+        const stack = [witnesses[i * size + j]!]
+        // Witnesses only reference older witnesses, so this traversal cannot
+        // follow a cyclic pointer chain. Erase closed walks rather than return
+        // a truncated route or reject a valid zero-cost cycle.
+        while (stack.length > 0) {
+          const witness = stack.pop()!
+          const position = positions[witness.target]
+          if (position !== -1) {
+            for (let p = position + 1; p < nodes.length; p++) {
+              positions[nodes[p]] = -1
+            }
+            nodes.length = position + 1
+            path.length = position + 1
+            pathEdges.length = position
+            pathCosts.length = position
+          } else if ("edge" in witness) {
+            positions[witness.target] = nodes.length
+            nodes.push(witness.target)
+            path.push(cache.nodeIds[witness.target])
+            pathEdges.push(edgeIds[witness.edge])
+            pathCosts.push(edges[witness.edge].data)
+          } else {
+            stack.push(witness.right, witness.left)
           }
-          current = next
-          path.push(cache.nodeIds[current])
+        }
+        for (const node of nodes) {
+          positions[node] = -1
         }
         pathRow.set(target, path)
         edgePathRow.set(target, pathEdges)
@@ -9789,6 +10027,7 @@ export 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
  */
@@ -9851,6 +10090,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
  */
@@ -9907,6 +10147,7 @@ export 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
    */
@@ -9963,6 +10204,7 @@ export 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
    */
@@ -10106,6 +10348,7 @@ export 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
  */
@@ -10160,6 +10403,7 @@ export interface BellmanFordConfig<E> {
  * ```
  *
  * @see {@link dijkstra} for non-negative edge costs
+ * @stability unstable
  * @category algorithms
  * @since 3.18.0
  */
@@ -10209,6 +10453,7 @@ export const bellmanFord: {
    * ```
    *
    * @see {@link dijkstra} for non-negative edge costs
+   * @stability unstable
    * @category algorithms
    * @since 3.18.0
    */
@@ -10258,6 +10503,7 @@ export const bellmanFord: {
    * ```
    *
    * @see {@link dijkstra} for non-negative edge costs
+   * @stability unstable
    * @category algorithms
    * @since 3.18.0
    */
@@ -10422,6 +10668,7 @@ export const bellmanFord: {
  *
  * Each fresh iterator repeats the path enumeration.
  *
+ * @stability unstable
  * @category models
  * @since 4.0.0
  */
@@ -10442,6 +10689,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
  */
@@ -10467,6 +10715,7 @@ export interface SimplePathsConfig {
  *
  * Invalid costs and limits throw a `GraphError` when evaluated.
  *
+ * @stability unstable
  * @category configuration
  * @since 4.0.0
  */
@@ -10507,6 +10756,7 @@ const pathWalker = <E>(iterator: () => Iterator<PathResult<E>>): PathWalker<E> =
  *
  * @see {@link allShortestPaths} for enumerating only minimum-cost routes
  *
+ * @stability unstable
  * @category algorithms
  * @since 4.0.0
  */
@@ -10532,6 +10782,7 @@ export const simplePaths: {
    *
    * @see {@link allShortestPaths} for enumerating only minimum-cost routes
    *
+   * @stability unstable
    * @category algorithms
    * @since 4.0.0
    */
@@ -10559,6 +10810,7 @@ export const simplePaths: {
    *
    * @see {@link allShortestPaths} for enumerating only minimum-cost routes
    *
+   * @stability unstable
    * @category algorithms
    * @since 4.0.0
    */
@@ -10666,6 +10918,7 @@ export 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
  */
@@ -10691,6 +10944,7 @@ export 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
    */
@@ -10718,6 +10972,7 @@ export 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
    */
@@ -10887,6 +11142,7 @@ export const allShortestPaths: {
  * Array.from(Graph.entries(allNodes)) // => [[0, "A"], [1, "B"]]
  * ```
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -10984,6 +11240,7 @@ const traversalStartPositions = (cache: csr.Csr, start: ReadonlyArray<NodeIndex>
  * @see {@link Walker} for the generic lazy iterator wrapper
  * @see {@link EdgeWalker} for edge iterators
  *
+ * @stability unstable
  * @category models
  * @since 3.18.0
  */
@@ -11003,6 +11260,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
  */
@@ -11026,6 +11284,7 @@ export type EdgeWalker<E> = Walker<EdgeIndex, Edge<E>>
  * Array.from(Graph.indices(dfs)) // => [0, 1]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -11049,6 +11308,7 @@ export const indices = <T, N>(walker: Walker<T, N>): Iterable<T> => walker.visit
  * Array.from(Graph.values(dfs)) // => ["A", "B"]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -11072,6 +11332,7 @@ export const values = <T, N>(walker: Walker<T, N>): Iterable<N> => walker.visit(
  * Array.from(Graph.entries(dfs)) // => [[0, "A"], [1, "B"]]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -11102,6 +11363,7 @@ export 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
  */
@@ -11153,6 +11415,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
  */
@@ -11199,6 +11462,7 @@ export 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
    */
@@ -11245,6 +11509,7 @@ export 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
    */
@@ -11415,6 +11680,7 @@ export const dfs: {
  *
  * @see {@link dfs} for branch-first traversal
  * @see {@link unweightedDistances} for collecting hop counts
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -11462,6 +11728,7 @@ export const bfs: {
    *
    * @see {@link dfs} for branch-first traversal
    * @see {@link unweightedDistances} for collecting hop counts
+   * @stability unstable
    * @category iterators
    * @since 3.18.0
    */
@@ -11509,6 +11776,7 @@ export const bfs: {
    *
    * @see {@link dfs} for branch-first traversal
    * @see {@link unweightedDistances} for collecting hop counts
+   * @stability unstable
    * @category iterators
    * @since 3.18.0
    */
@@ -11630,6 +11898,7 @@ export const bfs: {
  *
  * Throws a `GraphError` when any initial node has incoming edges.
  *
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -11674,6 +11943,7 @@ export interface TopoConfig {
  * ```
  *
  * @see {@link isAcyclic} for checking the required graph property
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -11715,6 +11985,7 @@ export const topo: {
    * ```
    *
    * @see {@link isAcyclic} for checking the required graph property
+   * @stability unstable
    * @category iterators
    * @since 3.18.0
    */
@@ -11756,6 +12027,7 @@ export const topo: {
    * ```
    *
    * @see {@link isAcyclic} for checking the required graph property
+   * @stability unstable
    * @category iterators
    * @since 3.18.0
    */
@@ -11892,6 +12164,7 @@ export const topo: {
  * ```
  *
  * @see {@link dfs} for emitting nodes when first visited
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -11939,6 +12212,7 @@ export const dfsPostOrder: {
    * ```
    *
    * @see {@link dfs} for emitting nodes when first visited
+   * @stability unstable
    * @category iterators
    * @since 3.18.0
    */
@@ -11986,6 +12260,7 @@ export const dfsPostOrder: {
    * ```
    *
    * @see {@link dfs} for emitting nodes when first visited
+   * @stability unstable
    * @category iterators
    * @since 3.18.0
    */
@@ -12121,6 +12396,7 @@ export const dfsPostOrder: {
  * Array.from(Graph.indices(Graph.nodes(graph))) // => [0, 1, 2]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -12174,6 +12450,7 @@ export const nodes = <N, E, T extends Kind = "directed">(
  * Array.from(Graph.indices(Graph.edges(graph))) // => [0, 1]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -12213,6 +12490,7 @@ export const edges = <N, E, T extends Kind = "directed">(
  * nodes with no incoming edges. If omitted, `direction` defaults to
  * `"outgoing"`.
  *
+ * @stability unstable
  * @category configuration
  * @since 3.18.0
  */
@@ -12260,6 +12538,7 @@ export interface ExternalsConfig {
  * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
  * ```
  *
+ * @stability unstable
  * @category iterators
  * @since 3.18.0
  */
@@ -12304,6 +12583,7 @@ export const externals: {
    * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
    * ```
    *
+   * @stability unstable
    * @category iterators
    * @since 3.18.0
    */
@@ -12348,6 +12628,7 @@ export const externals: {
    * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
    * ```
    *
+   * @stability unstable
    * @category iterators
    * @since 3.18.0
    */