effect 4.0.0-beta.67 → 4.0.0-beta.69

package/dist/Graph.d.ts

@@ -61,21 +61,21 @@ declare const TypeId = "~effect/collections/Graph";
  * Node index for node identification using plain numbers.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type NodeIndex = number;
 /**
  * Edge index for edge identification using plain numbers.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type EdgeIndex = number;
 /**
  * Edge data containing source, target, and user data.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare class Edge<E> extends Data.Class<{
     readonly source: NodeIndex;
@@ -87,7 +87,7 @@ export declare class Edge<E> extends Data.Class<{
  * Graph type for distinguishing directed and undirected graphs.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type Kind = "directed" | "undirected";
 /**
@@ -99,7 +99,7 @@ export type Kind = "directed" | "undirected";
  * shared protocols used by both `Graph` and `MutableGraph`.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface Proto<out N, out E> extends Iterable<readonly [NodeIndex, N]>, Equal.Equal, Pipeable, Inspectable {
     readonly [TypeId]: typeof TypeId;
@@ -115,7 +115,7 @@ export interface Proto<out N, out E> extends Iterable<readonly [NodeIndex, N]>,
  * Immutable graph interface.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface Graph<out N, out E, T extends Kind = "directed"> extends Proto<N, E> {
     readonly type: T;
@@ -125,7 +125,7 @@ export interface Graph<out N, out E, T extends Kind = "directed"> extends Proto<
  * Mutable graph interface.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface MutableGraph<out N, out E, T extends Kind = "directed"> extends Proto<N, E> {
     readonly type: T;
@@ -135,28 +135,28 @@ export interface MutableGraph<out N, out E, T extends Kind = "directed"> extends
  * Directed graph type alias.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type DirectedGraph<N, E> = Graph<N, E, "directed">;
 /**
  * Undirected graph type alias.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type UndirectedGraph<N, E> = Graph<N, E, "undirected">;
 /**
  * Mutable directed graph type alias.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type MutableDirectedGraph<N, E> = MutableGraph<N, E, "directed">;
 /**
  * Mutable undirected graph type alias.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type MutableUndirectedGraph<N, E> = MutableGraph<N, E, "undirected">;
 declare const GraphError_base: new <A extends Record<string, any> = {}>(args: import("./Types.ts").VoidIfEmpty<{ readonly [P in keyof A as P extends "_tag" ? never : P]: A[P]; }>) => import("./Cause.ts").YieldableError & {
@@ -168,7 +168,7 @@ declare const GraphError_base: new <A extends Record<string, any> = {}>(args: im
  * weights.
  *
  * @category errors
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare class GraphError extends GraphError_base<{
     readonly message: string;
@@ -178,7 +178,7 @@ export declare class GraphError extends GraphError_base<{
  * Returns `true` if a value has the graph runtime type identifier, narrowing
  * it to a `Graph`.
  *
- * @category Guards
+ * @category guards
  * @since 4.0.0
  */
 export declare const isGraph: (u: unknown) => u is Graph<unknown, unknown>;
@@ -201,7 +201,7 @@ export declare const isGraph: (u: unknown) => u is Graph<unknown, unknown>;
  * ```
  *
  * @category constructors
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const directed: <N, E>(mutate?: (mutable: MutableDirectedGraph<N, E>) => void) => DirectedGraph<N, E>;
 /**
@@ -223,7 +223,7 @@ export declare const directed: <N, E>(mutate?: (mutable: MutableDirectedGraph<N,
  * ```
  *
  * @category constructors
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const undirected: <N, E>(mutate?: (mutable: MutableUndirectedGraph<N, E>) => void) => UndirectedGraph<N, E>;
 /**
@@ -240,7 +240,7 @@ export declare const undirected: <N, E>(mutate?: (mutable: MutableUndirectedGrap
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const beginMutation: <N, E, T extends Kind = "directed">(graph: Graph<N, E, T>) => MutableGraph<N, E, T>;
 /**
@@ -258,7 +258,7 @@ export declare const beginMutation: <N, E, T extends Kind = "directed">(graph: G
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const endMutation: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>) => Graph<N, E, T>;
 /**
@@ -281,7 +281,7 @@ export declare const endMutation: <N, E, T extends Kind = "directed">(mutable: M
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const mutate: {
     /**
@@ -304,7 +304,7 @@ export declare const mutate: {
      * ```
      *
      * @category mutations
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(f: (mutable: MutableGraph<N, E, T>) => void): (graph: Graph<N, E, T>) => Graph<N, E, T>;
     /**
@@ -327,7 +327,7 @@ export declare const mutate: {
      * ```
      *
      * @category mutations
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T>, f: (mutable: MutableGraph<N, E, T>) => void): Graph<N, E, T>;
 };
@@ -348,7 +348,7 @@ export declare const mutate: {
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const addNode: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, data: N) => NodeIndex;
 /**
@@ -357,8 +357,7 @@ export declare const addNode: <N, E, T extends Kind = "directed">(mutable: Mutab
  * **Example** (Getting node data)
  *
  * ```ts
- * import { Graph } from "effect"
- * import * as Option from "effect/Option"
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
  *   Graph.addNode(mutable, "Node A")
@@ -373,7 +372,7 @@ export declare const addNode: <N, E, T extends Kind = "directed">(mutable: Mutab
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const getNode: {
     /**
@@ -382,8 +381,7 @@ export declare const getNode: {
      * **Example** (Getting node data)
      *
      * ```ts
-     * import { Graph } from "effect"
-     * import * as Option from "effect/Option"
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   Graph.addNode(mutable, "Node A")
@@ -398,7 +396,7 @@ export declare const getNode: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(nodeIndex: NodeIndex): (graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<N>;
     /**
@@ -407,8 +405,7 @@ export declare const getNode: {
      * **Example** (Getting node data)
      *
      * ```ts
-     * import { Graph } from "effect"
-     * import * as Option from "effect/Option"
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   Graph.addNode(mutable, "Node A")
@@ -423,7 +420,7 @@ export declare const getNode: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, nodeIndex: NodeIndex): Option.Option<N>;
 };
@@ -449,7 +446,7 @@ export declare const getNode: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const hasNode: {
     /**
@@ -474,7 +471,7 @@ export declare const hasNode: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (nodeIndex: NodeIndex): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => boolean;
     /**
@@ -499,7 +496,7 @@ export declare const hasNode: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, nodeIndex: NodeIndex): boolean;
 };
@@ -524,7 +521,7 @@ export declare const hasNode: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const nodeCount: <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => number;
 /**
@@ -549,7 +546,7 @@ export declare const nodeCount: <N, E, T extends Kind = "directed">(graph: Graph
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const findNode: {
     /**
@@ -574,7 +571,7 @@ export declare const findNode: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N>(predicate: (data: N) => boolean): <E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<NodeIndex>;
     /**
@@ -599,7 +596,7 @@ export declare const findNode: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, predicate: (data: N) => boolean): Option.Option<NodeIndex>;
 };
@@ -625,7 +622,7 @@ export declare const findNode: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const findNodes: {
     /**
@@ -650,7 +647,7 @@ export declare const findNodes: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N>(predicate: (data: N) => boolean): <E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Array<NodeIndex>;
     /**
@@ -675,7 +672,7 @@ export declare const findNodes: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, predicate: (data: N) => boolean): Array<NodeIndex>;
 };
@@ -703,7 +700,7 @@ export declare const findNodes: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const findEdge: {
     /**
@@ -730,7 +727,7 @@ export declare const findEdge: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <E>(predicate: (data: E, source: NodeIndex, target: NodeIndex) => boolean): <N, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<EdgeIndex>;
     /**
@@ -757,7 +754,7 @@ export declare const findEdge: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, predicate: (data: E, source: NodeIndex, target: NodeIndex) => boolean): Option.Option<EdgeIndex>;
 };
@@ -786,7 +783,7 @@ export declare const findEdge: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const findEdges: {
     /**
@@ -814,7 +811,7 @@ export declare const findEdges: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <E>(predicate: (data: E, source: NodeIndex, target: NodeIndex) => boolean): <N, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Array<EdgeIndex>;
     /**
@@ -842,7 +839,7 @@ export declare const findEdges: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, predicate: (data: E, source: NodeIndex, target: NodeIndex) => boolean): Array<EdgeIndex>;
 };
@@ -864,8 +861,8 @@ export declare const findEdges: {
  * console.log(nodeData) // Option.some("NODE A")
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export declare const updateNode: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, index: NodeIndex, f: (data: N) => N) => void;
 /**
@@ -888,7 +885,7 @@ export declare const updateNode: <N, E, T extends Kind = "directed">(mutable: Mu
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const updateEdge: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, edgeIndex: EdgeIndex, f: (data: E) => E) => void;
 /**
@@ -915,8 +912,8 @@ export declare const updateEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  * console.log(nodeData) // Option.some("NODE A")
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export declare const mapNodes: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, f: (data: N) => N) => void;
 /**
@@ -940,8 +937,8 @@ export declare const mapNodes: <N, E, T extends Kind = "directed">(mutable: Muta
  * console.log(edgeData) // Option.some(new Graph.Edge({ source: 0, target: 1, data: 20 }))
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export declare const mapEdges: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, f: (data: E) => E) => void;
 /**
@@ -965,8 +962,8 @@ export declare const mapEdges: <N, E, T extends Kind = "directed">(mutable: Muta
  * console.log(edge0) // Option.some(new Graph.Edge({ source: 1, target: 0, data: 1 }))
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export declare const reverse: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>) => void;
 /**
@@ -976,8 +973,7 @@ export declare const reverse: <N, E, T extends Kind = "directed">(mutable: Mutab
  * **Example** (Filtering and mapping nodes)
  *
  * ```ts
- * import { Graph } from "effect"
- * import * as Option from "effect/Option"
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
  *   const a = Graph.addNode(mutable, "active")
@@ -997,8 +993,8 @@ export declare const reverse: <N, E, T extends Kind = "directed">(mutable: Mutab
  * console.log(Graph.nodeCount(graph)) // 2 (only "active" nodes remain)
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export declare const filterMapNodes: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, f: (data: N) => Option.Option<N>) => void;
 /**
@@ -1008,8 +1004,7 @@ export declare const filterMapNodes: <N, E, T extends Kind = "directed">(mutable
  * **Example** (Filtering and mapping edges)
  *
  * ```ts
- * import { Graph } from "effect"
- * import * as Option from "effect/Option"
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
  *   const a = Graph.addNode(mutable, "A")
@@ -1029,8 +1024,8 @@ export declare const filterMapNodes: <N, E, T extends Kind = "directed">(mutable
  * console.log(Graph.edgeCount(graph)) // 2 (edges with weight 5 removed)
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export declare const filterMapEdges: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, f: (data: E) => Option.Option<E>) => void;
 /**
@@ -1055,8 +1050,8 @@ export declare const filterMapEdges: <N, E, T extends Kind = "directed">(mutable
  * console.log(Graph.nodeCount(graph)) // 2 (only "active" nodes remain)
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export declare const filterNodes: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, predicate: (data: N) => boolean) => void;
 /**
@@ -1084,8 +1079,8 @@ export declare const filterNodes: <N, E, T extends Kind = "directed">(mutable: M
  * console.log(Graph.edgeCount(graph)) // 2 (edge with weight 5 removed)
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export declare const filterEdges: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, predicate: (data: E) => boolean) => void;
 /**
@@ -1105,7 +1100,7 @@ export declare const filterEdges: <N, E, T extends Kind = "directed">(mutable: M
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const addEdge: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, source: NodeIndex, target: NodeIndex, data: E) => EdgeIndex;
 /**
@@ -1127,7 +1122,7 @@ export declare const addEdge: <N, E, T extends Kind = "directed">(mutable: Mutab
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const removeNode: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, nodeIndex: NodeIndex) => void;
 /**
@@ -1149,7 +1144,7 @@ export declare const removeNode: <N, E, T extends Kind = "directed">(mutable: Mu
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const removeEdge: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, edgeIndex: EdgeIndex) => void;
 /**
@@ -1177,7 +1172,7 @@ export declare const removeEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const getEdge: {
     /**
@@ -1205,7 +1200,7 @@ export declare const getEdge: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <E>(edgeIndex: EdgeIndex): <N, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<Edge<E>>;
     /**
@@ -1233,7 +1228,7 @@ export declare const getEdge: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, edgeIndex: EdgeIndex): Option.Option<Edge<E>>;
 };
@@ -1264,7 +1259,7 @@ export declare const getEdge: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const hasEdge: {
     /**
@@ -1294,7 +1289,7 @@ export declare const hasEdge: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (source: NodeIndex, target: NodeIndex): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => boolean;
     /**
@@ -1324,7 +1319,7 @@ export declare const hasEdge: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, source: NodeIndex, target: NodeIndex): boolean;
 };
@@ -1352,7 +1347,7 @@ export declare const hasEdge: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const edgeCount: <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => number;
 /**
@@ -1388,7 +1383,7 @@ export declare const edgeCount: <N, E, T extends Kind = "directed">(graph: Graph
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const neighbors: {
     /**
@@ -1424,7 +1419,7 @@ export declare const neighbors: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (nodeIndex: NodeIndex): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Array<NodeIndex>;
     /**
@@ -1460,7 +1455,7 @@ export declare const neighbors: {
      * ```
      *
      * @category getters
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, nodeIndex: NodeIndex): Array<NodeIndex>;
 };
@@ -1489,7 +1484,7 @@ export declare const neighbors: {
  * ```
  *
  * @category queries
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const neighborsDirected: {
     /**
@@ -1517,7 +1512,7 @@ export declare const neighborsDirected: {
      * ```
      *
      * @category queries
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (nodeIndex: NodeIndex, direction: Direction): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Array<NodeIndex>;
     /**
@@ -1545,7 +1540,7 @@ export declare const neighborsDirected: {
      * ```
      *
      * @category queries
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, nodeIndex: NodeIndex, direction: Direction): Array<NodeIndex>;
 };
@@ -1558,7 +1553,7 @@ export declare const neighborsDirected: {
  * **Example** (Configuring GraphViz labels)
  *
  * ```ts
- * import type * as Graph from "effect/Graph"
+ * import type { Graph } from "effect"
  *
  * // Basic options with custom labels
  * const basicOptions: Graph.GraphVizOptions<string, number> = {
@@ -1575,7 +1570,7 @@ export declare const neighborsDirected: {
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface GraphVizOptions<N, E> {
     /**
@@ -1624,7 +1619,7 @@ export interface GraphVizOptions<N, E> {
  * ```
  *
  * @category utils
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const toGraphViz: {
     /**
@@ -1657,7 +1652,7 @@ export declare const toGraphViz: {
      * ```
      *
      * @category utils
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E>(options?: GraphVizOptions<N, E>): <T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => string;
     /**
@@ -1690,7 +1685,7 @@ export declare const toGraphViz: {
      * ```
      *
      * @category utils
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, options?: GraphVizOptions<N, E>): string;
 };
@@ -1710,7 +1705,7 @@ export declare const toGraphViz: {
  * **Example** (Selecting Mermaid node shapes)
  *
  * ```ts
- * import type * as Graph from "effect/Graph"
+ * import type { Graph } from "effect"
  *
  * // Shape selector function for different node types
  * const shapeSelector = (nodeData: string): Graph.MermaidNodeShape => {
@@ -1727,7 +1722,7 @@ export declare const toGraphViz: {
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type MermaidNodeShape = "rectangle" | "rounded" | "circle" | "diamond" | "hexagon" | "stadium" | "subroutine" | "cylindrical";
 /**
@@ -1742,7 +1737,7 @@ export type MermaidNodeShape = "rectangle" | "rounded" | "circle" | "diamond" |
  * **Example** (Configuring Mermaid directions)
  *
  * ```ts
- * import type * as Graph from "effect/Graph"
+ * import type { Graph } from "effect"
  *
  * // Horizontal workflow diagram
  * const horizontalOptions: Graph.MermaidOptions<string, string> = {
@@ -1761,7 +1756,7 @@ export type MermaidNodeShape = "rectangle" | "rounded" | "circle" | "diamond" |
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type MermaidDirection = "TB" | "TD" | "BT" | "RL" | "LR";
 /**
@@ -1777,7 +1772,7 @@ export type MermaidDirection = "TB" | "TD" | "BT" | "RL" | "LR";
  * **Example** (Selecting Mermaid diagram types)
  *
  * ```ts
- * import type * as Graph from "effect/Graph"
+ * import type { Graph } from "effect"
  *
  * // Force flowchart format (even for undirected graphs)
  * const flowchartOptions: Graph.MermaidOptions<string, string> = {
@@ -1794,7 +1789,7 @@ export type MermaidDirection = "TB" | "TD" | "BT" | "RL" | "LR";
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type MermaidDiagramType = "flowchart" | "graph";
 /**
@@ -1812,7 +1807,7 @@ export type MermaidDiagramType = "flowchart" | "graph";
  * **Example** (Configuring Mermaid output)
  *
  * ```ts
- * import type * as Graph from "effect/Graph"
+ * import type { Graph } from "effect"
  *
  * // Basic options with custom labels
  * const basicOptions: Graph.MermaidOptions<string, number> = {
@@ -1831,7 +1826,7 @@ export type MermaidDiagramType = "flowchart" | "graph";
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface MermaidOptions<N, E> {
     /**
@@ -1872,7 +1867,7 @@ export interface MermaidOptions<N, E> {
  * **Example** (Exporting a directed Mermaid diagram)
  *
  * ```ts
- * import * as Graph from "effect/Graph"
+ * import { Graph } from "effect"
  *
  * // Basic directed graph export
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -1896,7 +1891,7 @@ export interface MermaidOptions<N, E> {
  * **Example** (Exporting an undirected Mermaid diagram)
  *
  * ```ts
- * import * as Graph from "effect/Graph"
+ * import { Graph } from "effect"
  *
  * // Undirected graph with custom labels and direction
  * const socialGraph = Graph.undirected<{ name: string }, string>((mutable) => {
@@ -1924,7 +1919,7 @@ export interface MermaidOptions<N, E> {
  * **Example** (Customizing Mermaid node shapes)
  *
  * ```ts
- * import * as Graph from "effect/Graph"
+ * import { Graph } from "effect"
  *
  * // Advanced styling with node shapes for flowchart
  * const workflow = Graph.directed<{ type: string; name: string }, string>(
@@ -1976,7 +1971,7 @@ export interface MermaidOptions<N, E> {
  * **Example** (Visualizing dependency graphs)
  *
  * ```ts
- * import * as Graph from "effect/Graph"
+ * import { Graph } from "effect"
  *
  * // Real-world example: Software dependency graph
  * interface Dependency {
@@ -2035,12 +2030,8 @@ export interface MermaidOptions<N, E> {
  * //   0 -->|"builds with"| 3
  * ```
  *
- * @param graph - The graph to export (directed or undirected)
- * @param options - Optional configuration for the Mermaid output
- * @returns Mermaid diagram syntax as a string
- *
  * @category utils
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const toMermaid: {
     /**
@@ -2054,7 +2045,7 @@ export declare const toMermaid: {
      * **Example** (Exporting a directed Mermaid diagram)
      *
      * ```ts
-     * import * as Graph from "effect/Graph"
+     * import { Graph } from "effect"
      *
      * // Basic directed graph export
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -2078,7 +2069,7 @@ export declare const toMermaid: {
      * **Example** (Exporting an undirected Mermaid diagram)
      *
      * ```ts
-     * import * as Graph from "effect/Graph"
+     * import { Graph } from "effect"
      *
      * // Undirected graph with custom labels and direction
      * const socialGraph = Graph.undirected<{ name: string }, string>((mutable) => {
@@ -2106,7 +2097,7 @@ export declare const toMermaid: {
      * **Example** (Customizing Mermaid node shapes)
      *
      * ```ts
-     * import * as Graph from "effect/Graph"
+     * import { Graph } from "effect"
      *
      * // Advanced styling with node shapes for flowchart
      * const workflow = Graph.directed<{ type: string; name: string }, string>(
@@ -2158,7 +2149,7 @@ export declare const toMermaid: {
      * **Example** (Visualizing dependency graphs)
      *
      * ```ts
-     * import * as Graph from "effect/Graph"
+     * import { Graph } from "effect"
      *
      * // Real-world example: Software dependency graph
      * interface Dependency {
@@ -2217,12 +2208,8 @@ export declare const toMermaid: {
      * //   0 -->|"builds with"| 3
      * ```
      *
-     * @param graph - The graph to export (directed or undirected)
-     * @param options - Optional configuration for the Mermaid output
-     * @returns Mermaid diagram syntax as a string
-     *
      * @category utils
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E>(options?: MermaidOptions<N, E>): <T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => string;
     /**
@@ -2236,7 +2223,7 @@ export declare const toMermaid: {
      * **Example** (Exporting a directed Mermaid diagram)
      *
      * ```ts
-     * import * as Graph from "effect/Graph"
+     * import { Graph } from "effect"
      *
      * // Basic directed graph export
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -2260,7 +2247,7 @@ export declare const toMermaid: {
      * **Example** (Exporting an undirected Mermaid diagram)
      *
      * ```ts
-     * import * as Graph from "effect/Graph"
+     * import { Graph } from "effect"
      *
      * // Undirected graph with custom labels and direction
      * const socialGraph = Graph.undirected<{ name: string }, string>((mutable) => {
@@ -2288,7 +2275,7 @@ export declare const toMermaid: {
      * **Example** (Customizing Mermaid node shapes)
      *
      * ```ts
-     * import * as Graph from "effect/Graph"
+     * import { Graph } from "effect"
      *
      * // Advanced styling with node shapes for flowchart
      * const workflow = Graph.directed<{ type: string; name: string }, string>(
@@ -2340,7 +2327,7 @@ export declare const toMermaid: {
      * **Example** (Visualizing dependency graphs)
      *
      * ```ts
-     * import * as Graph from "effect/Graph"
+     * import { Graph } from "effect"
      *
      * // Real-world example: Software dependency graph
      * interface Dependency {
@@ -2399,12 +2386,8 @@ export declare const toMermaid: {
      * //   0 -->|"builds with"| 3
      * ```
      *
-     * @param graph - The graph to export (directed or undirected)
-     * @param options - Optional configuration for the Mermaid output
-     * @returns Mermaid diagram syntax as a string
-     *
      * @category utils
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, options?: MermaidOptions<N, E>): string;
 };
@@ -2434,7 +2417,7 @@ export declare const toMermaid: {
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type Direction = "outgoing" | "incoming";
 /**
@@ -2470,7 +2453,7 @@ export type Direction = "outgoing" | "incoming";
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const isAcyclic: <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => boolean;
 /**
@@ -2510,7 +2493,7 @@ export declare const isAcyclic: <N, E, T extends Kind = "directed">(graph: Graph
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const isBipartite: <N, E>(graph: Graph<N, E, "undirected"> | MutableGraph<N, E, "undirected">) => boolean;
 /**
@@ -2536,7 +2519,7 @@ export declare const isBipartite: <N, E>(graph: Graph<N, E, "undirected"> | Muta
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const connectedComponents: <N, E>(graph: Graph<N, E, "undirected"> | MutableGraph<N, E, "undirected">) => Array<Array<NodeIndex>>;
 /**
@@ -2562,7 +2545,7 @@ export declare const connectedComponents: <N, E>(graph: Graph<N, E, "undirected"
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const stronglyConnectedComponents: <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Array<Array<NodeIndex>>;
 /**
@@ -2574,7 +2557,7 @@ export declare const stronglyConnectedComponents: <N, E, T extends Kind = "direc
  * encountered along the path.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface PathResult<E> {
     readonly path: Array<NodeIndex>;
@@ -2590,7 +2573,7 @@ export interface PathResult<E> {
  * each edge's data to a non-negative numeric weight.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface DijkstraConfig<E> {
     source: NodeIndex;
@@ -2634,7 +2617,7 @@ export interface DijkstraConfig<E> {
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const dijkstra: {
     /**
@@ -2674,7 +2657,7 @@ export declare const dijkstra: {
      * ```
      *
      * @category algorithms
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <E>(config: DijkstraConfig<E>): <N, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<PathResult<E>>;
     /**
@@ -2714,7 +2697,7 @@ export declare const dijkstra: {
      * ```
      *
      * @category algorithms
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config: DijkstraConfig<E>): Option.Option<PathResult<E>>;
 };
@@ -2727,7 +2710,7 @@ export declare const dijkstra: {
  * node indices.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface AllPairsResult<E> {
     readonly distances: Map<NodeIndex, Map<NodeIndex, number>>;
@@ -2764,7 +2747,7 @@ export interface AllPairsResult<E> {
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const floydWarshall: {
     /**
@@ -2797,7 +2780,7 @@ export declare const floydWarshall: {
      * ```
      *
      * @category algorithms
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <E>(cost: (edgeData: E) => number): <N, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => AllPairsResult<E>;
     /**
@@ -2830,7 +2813,7 @@ export declare const floydWarshall: {
      * ```
      *
      * @category algorithms
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, cost: (edgeData: E) => number): AllPairsResult<E>;
 };
@@ -2843,7 +2826,7 @@ export declare const floydWarshall: {
  * heuristic that estimates the remaining cost from a node to the target.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface AstarConfig<E, N> {
     source: NodeIndex;
@@ -2895,7 +2878,7 @@ export interface AstarConfig<E, N> {
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const astar: {
     /**
@@ -2942,7 +2925,7 @@ export declare const astar: {
      * ```
      *
      * @category algorithms
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <E, N>(config: AstarConfig<E, N>): <T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<PathResult<E>>;
     /**
@@ -2989,7 +2972,7 @@ export declare const astar: {
      * ```
      *
      * @category algorithms
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config: AstarConfig<E, N>): Option.Option<PathResult<E>>;
 };
@@ -3002,7 +2985,7 @@ export declare const astar: {
  * each edge's data to a numeric weight.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface BellmanFordConfig<E> {
     source: NodeIndex;
@@ -3046,7 +3029,7 @@ export interface BellmanFordConfig<E> {
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const bellmanFord: {
     /**
@@ -3086,7 +3069,7 @@ export declare const bellmanFord: {
      * ```
      *
      * @category algorithms
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <E>(config: BellmanFordConfig<E>): <N, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<PathResult<E>>;
     /**
@@ -3126,7 +3109,7 @@ export declare const bellmanFord: {
      * ```
      *
      * @category algorithms
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config: BellmanFordConfig<E>): Option.Option<PathResult<E>>;
 };
@@ -3165,7 +3148,7 @@ export declare const bellmanFord: {
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare class Walker<T, N> implements Iterable<[T, N]> {
     readonly [Symbol.iterator]: () => Iterator<[T, N]>;
@@ -3200,7 +3183,6 @@ export declare class Walker<T, N> implements Iterable<[T, N]> {
      * console.log(custom) // [{ id: 0, name: "A" }, { id: 1, name: "B" }]
      * ```
      *
-     * @category iterators
      * @since 4.0.0
      */
     readonly visit: <U>(f: (index: T, data: N) => U) => Iterable<U>;
@@ -3246,7 +3228,7 @@ export declare class Walker<T, N> implements Iterable<[T, N]> {
  * NodeWalker is represented as Walker<NodeIndex, N>.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type NodeWalker<N> = Walker<NodeIndex, N>;
 /**
@@ -3254,7 +3236,7 @@ export type NodeWalker<N> = Walker<NodeIndex, N>;
  * EdgeWalker is represented as Walker<EdgeIndex, Edge<E>>.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type EdgeWalker<E> = Walker<EdgeIndex, Edge<E>>;
 /**
@@ -3276,8 +3258,8 @@ export type EdgeWalker<E> = Walker<EdgeIndex, Edge<E>>;
  * console.log(indices) // [0, 1]
  * ```
  *
- * @category utilities
- * @since 4.0.0
+ * @category utils
+ * @since 3.18.0
  */
 export declare const indices: <T, N>(walker: Walker<T, N>) => Iterable<T>;
 /**
@@ -3299,8 +3281,8 @@ export declare const indices: <T, N>(walker: Walker<T, N>) => Iterable<T>;
  * console.log(values) // ["A", "B"]
  * ```
  *
- * @category utilities
- * @since 4.0.0
+ * @category utils
+ * @since 3.18.0
  */
 export declare const values: <T, N>(walker: Walker<T, N>) => Iterable<N>;
 /**
@@ -3322,8 +3304,8 @@ export declare const values: <T, N>(walker: Walker<T, N>) => Iterable<N>;
  * console.log(entries) // [[0, "A"], [1, "B"]]
  * ```
  *
- * @category utilities
- * @since 4.0.0
+ * @category utils
+ * @since 3.18.0
  */
 export declare const entries: <T, N>(walker: Walker<T, N>) => Iterable<[T, N]>;
 /**
@@ -3336,7 +3318,7 @@ export declare const entries: <T, N>(walker: Walker<T, N>) => Iterable<[T, N]>;
  * outgoing or incoming edges.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface SearchConfig {
     readonly start?: Array<NodeIndex>;
@@ -3377,7 +3359,7 @@ export interface SearchConfig {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const dfs: {
     /**
@@ -3415,7 +3397,7 @@ export declare const dfs: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (config?: SearchConfig): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => NodeWalker<N>;
     /**
@@ -3453,7 +3435,7 @@ export declare const dfs: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config?: SearchConfig): NodeWalker<N>;
 };
@@ -3492,7 +3474,7 @@ export declare const dfs: {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const bfs: {
     /**
@@ -3530,7 +3512,7 @@ export declare const bfs: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (config?: SearchConfig): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => NodeWalker<N>;
     /**
@@ -3568,7 +3550,7 @@ export declare const bfs: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config?: SearchConfig): NodeWalker<N>;
 };
@@ -3582,7 +3564,7 @@ export declare const bfs: {
  * in-degree.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface TopoConfig {
     readonly initials?: Array<NodeIndex>;
@@ -3629,7 +3611,7 @@ export interface TopoConfig {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const topo: {
     /**
@@ -3674,7 +3656,7 @@ export declare const topo: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (config?: TopoConfig): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => NodeWalker<N>;
     /**
@@ -3719,7 +3701,7 @@ export declare const topo: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config?: TopoConfig): NodeWalker<N>;
 };
@@ -3754,7 +3736,7 @@ export declare const topo: {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const dfsPostOrder: {
     /**
@@ -3788,7 +3770,7 @@ export declare const dfsPostOrder: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (config?: SearchConfig): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => NodeWalker<N>;
     /**
@@ -3822,7 +3804,7 @@ export declare const dfsPostOrder: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config?: SearchConfig): NodeWalker<N>;
 };
@@ -3849,7 +3831,7 @@ export declare const dfsPostOrder: {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const nodes: <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => NodeWalker<N>;
 /**
@@ -3876,7 +3858,7 @@ export declare const nodes: <N, E, T extends Kind = "directed">(graph: Graph<N,
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const edges: <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => EdgeWalker<E>;
 /**
@@ -3889,7 +3871,7 @@ export declare const edges: <N, E, T extends Kind = "directed">(graph: Graph<N,
  * nodes with no incoming edges.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface ExternalsConfig {
     readonly direction?: Direction;
@@ -3930,7 +3912,7 @@ export interface ExternalsConfig {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export declare const externals: {
     /**
@@ -3969,7 +3951,7 @@ export declare const externals: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     (config?: ExternalsConfig): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => NodeWalker<N>;
     /**
@@ -4008,7 +3990,7 @@ export declare const externals: {
      * ```
      *
      * @category iterators
-     * @since 4.0.0
+     * @since 3.18.0
      */
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config?: ExternalsConfig): NodeWalker<N>;
 };