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

package/src/Graph.ts

@@ -70,7 +70,7 @@ 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
 
@@ -78,7 +78,7 @@ 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
 
@@ -86,7 +86,7 @@ export type EdgeIndex = number
  * Edge data containing source, target, and user data.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export class Edge<E> extends Data.Class<{
   readonly source: NodeIndex
@@ -98,7 +98,7 @@ export 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"
 
@@ -111,7 +111,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
@@ -128,7 +128,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
@@ -139,7 +139,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
@@ -150,7 +150,7 @@ 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">
 
@@ -158,7 +158,7 @@ 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">
 
@@ -166,7 +166,7 @@ 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">
 
@@ -174,7 +174,7 @@ 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">
 
@@ -265,7 +265,7 @@ const ProtoGraph = {
  * weights.
  *
  * @category errors
- * @since 4.0.0
+ * @since 3.18.0
  */
 export class GraphError extends Data.TaggedError("GraphError")<{
   readonly message: string
@@ -282,7 +282,7 @@ const missingNode = (node: number) => new GraphError({ message: `Node ${node} do
  * 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 const isGraph = (u: unknown): u is Graph<unknown, unknown> => hasProperty(u, TypeId)
@@ -306,7 +306,7 @@ export const isGraph = (u: unknown): u is Graph<unknown, unknown> => hasProperty
  * ```
  *
  * @category constructors
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const directed = <N, E>(mutate?: (mutable: MutableDirectedGraph<N, E>) => void): DirectedGraph<N, E> => {
   const graph: Mutable<DirectedGraph<N, E>> = Object.create(ProtoGraph)
@@ -348,7 +348,7 @@ export const directed = <N, E>(mutate?: (mutable: MutableDirectedGraph<N, E>) =>
  * ```
  *
  * @category constructors
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const undirected = <N, E>(mutate?: (mutable: MutableUndirectedGraph<N, E>) => void): UndirectedGraph<N, E> => {
   const graph: Mutable<UndirectedGraph<N, E>> = Object.create(ProtoGraph)
@@ -389,7 +389,7 @@ export const undirected = <N, E>(mutate?: (mutable: MutableUndirectedGraph<N, E>
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const beginMutation = <N, E, T extends Kind = "directed">(
   graph: Graph<N, E, T>
@@ -435,7 +435,7 @@ export const beginMutation = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const endMutation = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>
@@ -474,7 +474,7 @@ export const endMutation = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const mutate: {
   /**
@@ -497,7 +497,7 @@ export 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>
   /**
@@ -520,7 +520,7 @@ export 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>
 } = dual(2, <N, E, T extends Kind = "directed">(
@@ -553,7 +553,7 @@ export const mutate: {
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const addNode = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -580,8 +580,7 @@ export const addNode = <N, E, T extends Kind = "directed">(
  * **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")
@@ -596,7 +595,7 @@ export const addNode = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const getNode: {
   /**
@@ -605,8 +604,7 @@ export 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")
@@ -621,7 +619,7 @@ export 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>
   /**
@@ -630,8 +628,7 @@ export 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")
@@ -646,7 +643,7 @@ export 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>
 } = dual(2, <N, E, T extends Kind = "directed">(
@@ -676,7 +673,7 @@ export const getNode: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const hasNode: {
   /**
@@ -701,7 +698,7 @@ export 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
   /**
@@ -726,7 +723,7 @@ export 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
 } = dual(2, <N, E, T extends Kind = "directed">(
@@ -755,7 +752,7 @@ export const hasNode: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const nodeCount = <N, E, T extends Kind = "directed">(
   graph: Graph<N, E, T> | MutableGraph<N, E, T>
@@ -783,7 +780,7 @@ export const nodeCount = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const findNode: {
   /**
@@ -808,7 +805,7 @@ export 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>
   /**
@@ -833,7 +830,7 @@ export 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>,
@@ -873,7 +870,7 @@ export const findNode: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const findNodes: {
   /**
@@ -898,7 +895,7 @@ export 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>
   /**
@@ -923,7 +920,7 @@ export 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>,
@@ -966,7 +963,7 @@ export const findNodes: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const findEdge: {
   /**
@@ -993,7 +990,7 @@ export 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>
   /**
@@ -1020,7 +1017,7 @@ export 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>,
@@ -1063,7 +1060,7 @@ export const findEdge: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const findEdges: {
   /**
@@ -1091,7 +1088,7 @@ export 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>
   /**
@@ -1119,7 +1116,7 @@ export 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>,
@@ -1156,8 +1153,8 @@ export const findEdges: {
  * console.log(nodeData) // Option.some("NODE A")
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export const updateNode = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1193,7 +1190,7 @@ export const updateNode = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const updateEdge = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1233,8 +1230,8 @@ export const updateEdge = <N, E, T extends Kind = "directed">(
  * console.log(nodeData) // Option.some("NODE A")
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export const mapNodes = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1268,8 +1265,8 @@ export const mapNodes = <N, E, T extends Kind = "directed">(
  * 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 const mapEdges = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1306,8 +1303,8 @@ export const mapEdges = <N, E, T extends Kind = "directed">(
  * 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 const reverse = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>
@@ -1352,8 +1349,7 @@ export const reverse = <N, E, T extends Kind = "directed">(
  * **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")
@@ -1373,8 +1369,8 @@ export const reverse = <N, E, T extends Kind = "directed">(
  * console.log(Graph.nodeCount(graph)) // 2 (only "active" nodes remain)
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export const filterMapNodes = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1407,8 +1403,7 @@ export const filterMapNodes = <N, E, T extends Kind = "directed">(
  * **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")
@@ -1428,8 +1423,8 @@ export const filterMapNodes = <N, E, T extends Kind = "directed">(
  * console.log(Graph.edgeCount(graph)) // 2 (edges with weight 5 removed)
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export const filterMapEdges = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1480,8 +1475,8 @@ export const filterMapEdges = <N, E, T extends Kind = "directed">(
  * console.log(Graph.nodeCount(graph)) // 2 (only "active" nodes remain)
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export const filterNodes = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1527,8 +1522,8 @@ export const filterNodes = <N, E, T extends Kind = "directed">(
  * console.log(Graph.edgeCount(graph)) // 2 (edge with weight 5 removed)
  * ```
  *
- * @category transformations
- * @since 4.0.0
+ * @category transforming
+ * @since 3.18.0
  */
 export const filterEdges = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1594,7 +1589,7 @@ const invalidateCycleFlagOnAddition = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const addEdge = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1669,7 +1664,7 @@ export const addEdge = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const removeNode = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1733,7 +1728,7 @@ export const removeNode = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category mutations
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const removeEdge = <N, E, T extends Kind = "directed">(
   mutable: MutableGraph<N, E, T>,
@@ -1832,7 +1827,7 @@ const removeEdgeInternal = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const getEdge: {
   // =============================================================================
@@ -1864,7 +1859,7 @@ export 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>>
   // =============================================================================
@@ -1896,7 +1891,7 @@ export 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>>
 } = dual(2, <N, E, T extends Kind = "directed">(
@@ -1931,7 +1926,7 @@ export const getEdge: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const hasEdge: {
   /**
@@ -1961,7 +1956,7 @@ export 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
   /**
@@ -1991,7 +1986,7 @@ export 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>,
@@ -2043,7 +2038,7 @@ export const hasEdge: {
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const edgeCount = <N, E, T extends Kind = "directed">(
   graph: Graph<N, E, T> | MutableGraph<N, E, T>
@@ -2082,7 +2077,7 @@ export const edgeCount = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category getters
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const neighbors: {
   /**
@@ -2118,7 +2113,7 @@ export 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>
   /**
@@ -2154,7 +2149,7 @@ export 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>
 } = dual(2, <N, E, T extends Kind = "directed">(
@@ -2207,7 +2202,7 @@ export const neighbors: {
  * ```
  *
  * @category queries
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const neighborsDirected: {
   /**
@@ -2235,7 +2230,7 @@ export 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>
   /**
@@ -2263,7 +2258,7 @@ export 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>,
@@ -2312,7 +2307,7 @@ export 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> = {
@@ -2329,7 +2324,7 @@ export const neighborsDirected: {
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface GraphVizOptions<N, E> {
   /**
@@ -2381,7 +2376,7 @@ export interface GraphVizOptions<N, E> {
  * ```
  *
  * @category utils
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const toGraphViz: {
   /**
@@ -2414,7 +2409,7 @@ export 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
   /**
@@ -2447,7 +2442,7 @@ export 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>,
@@ -2506,7 +2501,7 @@ export 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 => {
@@ -2523,7 +2518,7 @@ export const toGraphViz: {
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type MermaidNodeShape =
   | "rectangle" // A["label"]
@@ -2547,7 +2542,7 @@ export type MermaidNodeShape =
  * **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> = {
@@ -2566,7 +2561,7 @@ export type MermaidNodeShape =
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type MermaidDirection =
   | "TB" // Top to Bottom (default)
@@ -2588,7 +2583,7 @@ export type MermaidDirection =
  * **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> = {
@@ -2605,7 +2600,7 @@ export type MermaidDirection =
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type MermaidDiagramType =
   | "flowchart" // For directed graphs
@@ -2626,7 +2621,7 @@ export type MermaidDiagramType =
  * **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> = {
@@ -2645,7 +2640,7 @@ export type MermaidDiagramType =
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface MermaidOptions<N, E> {
   /**
@@ -2744,7 +2739,7 @@ const formatMermaidNode = (
  * **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) => {
@@ -2768,7 +2763,7 @@ const formatMermaidNode = (
  * **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) => {
@@ -2796,7 +2791,7 @@ const formatMermaidNode = (
  * **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>(
@@ -2848,7 +2843,7 @@ const formatMermaidNode = (
  * **Example** (Visualizing dependency graphs)
  *
  * ```ts
- * import * as Graph from "effect/Graph"
+ * import { Graph } from "effect"
  *
  * // Real-world example: Software dependency graph
  * interface Dependency {
@@ -2907,12 +2902,8 @@ const formatMermaidNode = (
  * //   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 const toMermaid: {
   /**
@@ -2926,7 +2917,7 @@ export 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) => {
@@ -2950,7 +2941,7 @@ export 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) => {
@@ -2978,7 +2969,7 @@ export 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>(
@@ -3030,7 +3021,7 @@ export 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 {
@@ -3089,12 +3080,8 @@ export 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
   /**
@@ -3108,7 +3095,7 @@ export 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) => {
@@ -3132,7 +3119,7 @@ export 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) => {
@@ -3160,7 +3147,7 @@ export 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>(
@@ -3212,7 +3199,7 @@ export 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 {
@@ -3271,12 +3258,8 @@ export 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>,
@@ -3359,7 +3342,7 @@ export const toMermaid: {
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export type Direction = "outgoing" | "incoming"
 
@@ -3400,7 +3383,7 @@ export type Direction = "outgoing" | "incoming"
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const isAcyclic = <N, E, T extends Kind = "directed">(
   graph: Graph<N, E, T> | MutableGraph<N, E, T>
@@ -3515,7 +3498,7 @@ export const isAcyclic = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const isBipartite = <N, E>(
   graph: Graph<N, E, "undirected"> | MutableGraph<N, E, "undirected">
@@ -3614,7 +3597,7 @@ const getUndirectedNeighbors = <N, E>(
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const connectedComponents = <N, E>(
   graph: Graph<N, E, "undirected"> | MutableGraph<N, E, "undirected">
@@ -3673,7 +3656,7 @@ export const connectedComponents = <N, E>(
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const stronglyConnectedComponents = <N, E, T extends Kind = "directed">(
   graph: Graph<N, E, T> | MutableGraph<N, E, T>
@@ -3781,7 +3764,7 @@ export const stronglyConnectedComponents = <N, E, T extends Kind = "directed">(
  * encountered along the path.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface PathResult<E> {
   readonly path: Array<NodeIndex>
@@ -3798,7 +3781,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
@@ -3843,7 +3826,7 @@ export interface DijkstraConfig<E> {
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const dijkstra: {
   /**
@@ -3883,7 +3866,7 @@ export 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>>
   /**
@@ -3923,7 +3906,7 @@ export 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>>
 } = dual(2, <N, E, T extends Kind = "directed">(
@@ -4061,7 +4044,7 @@ export 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>>
@@ -4099,7 +4082,7 @@ export interface AllPairsResult<E> {
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const floydWarshall: {
   /**
@@ -4132,7 +4115,7 @@ export 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>
   /**
@@ -4165,7 +4148,7 @@ export 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>,
@@ -4291,7 +4274,7 @@ export 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
@@ -4344,7 +4327,7 @@ export interface AstarConfig<E, N> {
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const astar: {
   /**
@@ -4391,7 +4374,7 @@ export 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>>
   /**
@@ -4438,7 +4421,7 @@ export 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>>
 } = dual(2, <N, E, T extends Kind = "directed">(
@@ -4600,7 +4583,7 @@ export 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
@@ -4645,7 +4628,7 @@ export interface BellmanFordConfig<E> {
  * ```
  *
  * @category algorithms
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const bellmanFord: {
   /**
@@ -4685,7 +4668,7 @@ export 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>>
   /**
@@ -4725,7 +4708,7 @@ export 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>,
@@ -4895,7 +4878,7 @@ export const bellmanFord: {
  * ```
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export class Walker<T, N> implements Iterable<[T, N]> {
   // @ts-ignore
@@ -4932,7 +4915,6 @@ export 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>
@@ -4984,7 +4966,7 @@ export 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>
 
@@ -4993,7 +4975,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>>
 
@@ -5016,8 +4998,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 const indices = <T, N>(walker: Walker<T, N>): Iterable<T> => walker.visit((index, _) => index)
 
@@ -5040,8 +5022,8 @@ export const indices = <T, N>(walker: Walker<T, N>): Iterable<T> => walker.visit
  * console.log(values) // ["A", "B"]
  * ```
  *
- * @category utilities
- * @since 4.0.0
+ * @category utils
+ * @since 3.18.0
  */
 export const values = <T, N>(walker: Walker<T, N>): Iterable<N> => walker.visit((_, data) => data)
 
@@ -5064,8 +5046,8 @@ export const values = <T, N>(walker: Walker<T, N>): Iterable<N> => walker.visit(
  * console.log(entries) // [[0, "A"], [1, "B"]]
  * ```
  *
- * @category utilities
- * @since 4.0.0
+ * @category utils
+ * @since 3.18.0
  */
 export const entries = <T, N>(walker: Walker<T, N>): Iterable<[T, N]> =>
   walker.visit((index, data) => [index, data] as [T, N])
@@ -5080,7 +5062,7 @@ export 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>
@@ -5122,7 +5104,7 @@ export interface SearchConfig {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const dfs: {
   /**
@@ -5160,7 +5142,7 @@ export 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>
   /**
@@ -5198,7 +5180,7 @@ export 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>
 } = dual((args) => isGraph(args[0]), <N, E, T extends Kind = "directed">(
@@ -5289,7 +5271,7 @@ export const dfs: {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const bfs: {
   /**
@@ -5327,7 +5309,7 @@ export 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>
   /**
@@ -5365,7 +5347,7 @@ export 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>
 } = dual((args) => isGraph(args[0]), <N, E, T extends Kind = "directed">(
@@ -5427,7 +5409,7 @@ export const bfs: {
  * in-degree.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface TopoConfig {
   readonly initials?: Array<NodeIndex>
@@ -5475,7 +5457,7 @@ export interface TopoConfig {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const topo: {
   /**
@@ -5520,7 +5502,7 @@ export 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>
   /**
@@ -5565,7 +5547,7 @@ export 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>
 } = dual((args) => isGraph(args[0]), <N, E, T extends Kind = "directed">(
@@ -5682,7 +5664,7 @@ export const topo: {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const dfsPostOrder: {
   /**
@@ -5716,7 +5698,7 @@ export 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>
   /**
@@ -5750,7 +5732,7 @@ export 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>
 } = dual((args) => isGraph(args[0]), <N, E, T extends Kind = "directed">(
@@ -5843,7 +5825,7 @@ export const dfsPostOrder: {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const nodes = <N, E, T extends Kind = "directed">(
   graph: Graph<N, E, T> | MutableGraph<N, E, T>
@@ -5890,7 +5872,7 @@ export const nodes = <N, E, T extends Kind = "directed">(
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const edges = <N, E, T extends Kind = "directed">(
   graph: Graph<N, E, T> | MutableGraph<N, E, T>
@@ -5923,7 +5905,7 @@ export const edges = <N, E, T extends Kind = "directed">(
  * nodes with no incoming edges.
  *
  * @category models
- * @since 4.0.0
+ * @since 3.18.0
  */
 export interface ExternalsConfig {
   readonly direction?: Direction
@@ -5965,7 +5947,7 @@ export interface ExternalsConfig {
  * ```
  *
  * @category iterators
- * @since 4.0.0
+ * @since 3.18.0
  */
 export const externals: {
   /**
@@ -6004,7 +5986,7 @@ export 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>
   /**
@@ -6043,7 +6025,7 @@ export 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>
 } = dual((args) => isGraph(args[0]), <N, E, T extends Kind = "directed">(