effect 4.0.0-beta.102 → 4.0.0-beta.103

package/dist/Graph.d.ts

@@ -310,7 +310,7 @@ export declare const isGraph: <N = unknown, E = unknown, T extends Kind = Kind,
  *
  * **Example** (Constructing by kind)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const makeGraph = Graph.make("directed")
@@ -318,7 +318,7 @@ export declare const isGraph: <N = unknown, E = unknown, T extends Kind = Kind,
  *   Graph.addNode(mutable, "A")
  * })
  *
- * console.log(graph.type) // "directed"
+ * graph.type // => "directed"
  * ```
  *
  * @see {@link directed} for constructing a directed graph directly
@@ -332,7 +332,7 @@ export declare const make: <T extends Kind>(type: T) => <N, E>(mutate?: (mutable
  *
  * **Example** (Creating a directed graph)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Directed graph with initial nodes and edges
@@ -343,6 +343,7 @@ export declare const make: <T extends Kind>(type: T) => <N, E>(mutate?: (mutable
  *   Graph.addEdge(mutable, a, b, "A->B")
  *   Graph.addEdge(mutable, b, c, "B->C")
  * })
+ * Array.of(Graph.nodeCount(graph), Graph.edgeCount(graph)) // => [3, 2]
  * ```
  *
  * @category constructors
@@ -354,7 +355,7 @@ export declare const directed: <N, E>(mutate?: (mutable: MutableDirectedGraph<N,
  *
  * **Example** (Creating an undirected graph)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Undirected graph with initial nodes and edges
@@ -365,6 +366,7 @@ export declare const directed: <N, E>(mutate?: (mutable: MutableDirectedGraph<N,
  *   Graph.addEdge(mutable, a, b, "A-B")
  *   Graph.addEdge(mutable, b, c, "B-C")
  * })
+ * Array.of(Graph.nodeCount(graph), Graph.edgeCount(graph)) // => [3, 2]
  * ```
  *
  * @category constructors
@@ -376,12 +378,13 @@ export declare const undirected: <N, E>(mutate?: (mutable: MutableUndirectedGrap
  *
  * **Example** (Beginning a mutation scope)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>()
  * const mutable = Graph.beginMutation(graph)
  * // Now mutable can be safely modified without affecting original graph
+ * Array.of(Graph.nodeCount(mutable), Graph.nodeCount(graph)) // => [0, 0]
  * ```
  *
  * @category mutations
@@ -398,13 +401,13 @@ export declare const beginMutation: <N, E, T extends Kind = "directed">(graph: G
  *
  * **Example** (Ending a mutation scope)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>()
  * const mutable = Graph.beginMutation(graph)
  * // ... perform mutations on mutable ...
- * const newGraph = Graph.endMutation(mutable)
+ * Graph.nodeCount(Graph.endMutation(mutable)) // => 0
  * ```
  *
  * @category mutations
@@ -416,7 +419,7 @@ export declare const endMutation: <N, E, T extends Kind = "directed">(mutable: M
  *
  * **Example** (Applying scoped mutations)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>()
@@ -426,8 +429,8 @@ export declare const endMutation: <N, E, T extends Kind = "directed">(mutable: M
  *   Graph.addEdge(mutable, nodeA, nodeB, 1)
  * })
  *
- * console.log(Graph.nodeCount(newGraph)) // 2
- * console.log(Graph.edgeCount(newGraph)) // 1
+ * Graph.nodeCount(newGraph) // => 2
+ * Graph.edgeCount(newGraph) // => 1
  * ```
  *
  * @category mutations
@@ -439,7 +442,7 @@ export declare const mutate: {
      *
      * **Example** (Applying scoped mutations)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>()
@@ -449,8 +452,8 @@ export declare const mutate: {
      *   Graph.addEdge(mutable, nodeA, nodeB, 1)
      * })
      *
-     * console.log(Graph.nodeCount(newGraph)) // 2
-     * console.log(Graph.edgeCount(newGraph)) // 1
+     * Graph.nodeCount(newGraph) // => 2
+     * Graph.edgeCount(newGraph) // => 1
      * ```
      *
      * @category mutations
@@ -462,7 +465,7 @@ export declare const mutate: {
      *
      * **Example** (Applying scoped mutations)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>()
@@ -472,8 +475,8 @@ export declare const mutate: {
      *   Graph.addEdge(mutable, nodeA, nodeB, 1)
      * })
      *
-     * console.log(Graph.nodeCount(newGraph)) // 2
-     * console.log(Graph.edgeCount(newGraph)) // 1
+     * Graph.nodeCount(newGraph) // => 2
+     * Graph.edgeCount(newGraph) // => 1
      * ```
      *
      * @category mutations
@@ -523,7 +526,7 @@ export interface IdentityOptions<N, E, NI = N, EI = E> {
  *
  * **Example** (Combining graphs)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -542,8 +545,8 @@ export interface IdentityOptions<N, E, NI = N, EI = E> {
  *   nodeIdentity: (node) => node.id
  * })
  *
- * console.log(Graph.nodeCount(result)) // 3
- * console.log(Graph.edgeCount(result)) // 2
+ * Graph.nodeCount(result) // => 3
+ * Graph.edgeCount(result) // => 2
  * ```
  *
  * @category set operations
@@ -571,7 +574,7 @@ export declare const compose: {
      *
      * **Example** (Combining graphs)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -590,8 +593,8 @@ export declare const compose: {
      *   nodeIdentity: (node) => node.id
      * })
      *
-     * console.log(Graph.nodeCount(result)) // 3
-     * console.log(Graph.edgeCount(result)) // 2
+     * Graph.nodeCount(result) // => 3
+     * Graph.edgeCount(result) // => 2
      * ```
      *
      * @category set operations
@@ -619,7 +622,7 @@ export declare const compose: {
      *
      * **Example** (Combining graphs)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -638,8 +641,8 @@ export declare const compose: {
      *   nodeIdentity: (node) => node.id
      * })
      *
-     * console.log(Graph.nodeCount(result)) // 3
-     * console.log(Graph.edgeCount(result)) // 2
+     * Graph.nodeCount(result) // => 3
+     * Graph.edgeCount(result) // => 2
      * ```
      *
      * @category set operations
@@ -667,7 +670,7 @@ export declare const compose: {
  *
  * **Example** (Finding shared structure)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const left = Graph.directed<string, string>((mutable) => {
@@ -684,8 +687,8 @@ export declare const compose: {
  *
  * const result = Graph.intersection(left, right)
  *
- * console.log(Graph.nodeCount(result)) // 2
- * console.log(Graph.edgeCount(result)) // 1
+ * Graph.nodeCount(result) // => 2
+ * Graph.edgeCount(result) // => 1
  * ```
  *
  * @category set operations
@@ -712,7 +715,7 @@ export declare const intersection: {
      *
      * **Example** (Finding shared structure)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<string, string>((mutable) => {
@@ -729,8 +732,8 @@ export declare const intersection: {
      *
      * const result = Graph.intersection(left, right)
      *
-     * console.log(Graph.nodeCount(result)) // 2
-     * console.log(Graph.edgeCount(result)) // 1
+     * Graph.nodeCount(result) // => 2
+     * Graph.edgeCount(result) // => 1
      * ```
      *
      * @category set operations
@@ -757,7 +760,7 @@ export declare const intersection: {
      *
      * **Example** (Finding shared structure)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<string, string>((mutable) => {
@@ -774,8 +777,8 @@ export declare const intersection: {
      *
      * const result = Graph.intersection(left, right)
      *
-     * console.log(Graph.nodeCount(result)) // 2
-     * console.log(Graph.edgeCount(result)) // 1
+     * Graph.nodeCount(result) // => 2
+     * Graph.edgeCount(result) // => 1
      * ```
      *
      * @category set operations
@@ -804,7 +807,7 @@ export declare const intersection: {
  *
  * **Example** (Removing shared edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const left = Graph.directed<string, string>((mutable) => {
@@ -823,8 +826,8 @@ export declare const intersection: {
  *
  * const result = Graph.difference(left, right)
  *
- * console.log(Graph.nodeCount(result)) // 3
- * console.log(Graph.edgeCount(result)) // 1
+ * Graph.nodeCount(result) // => 3
+ * Graph.edgeCount(result) // => 1
  * ```
  *
  * @category set operations
@@ -852,7 +855,7 @@ export declare const difference: {
      *
      * **Example** (Removing shared edges)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<string, string>((mutable) => {
@@ -871,8 +874,8 @@ export declare const difference: {
      *
      * const result = Graph.difference(left, right)
      *
-     * console.log(Graph.nodeCount(result)) // 3
-     * console.log(Graph.edgeCount(result)) // 1
+     * Graph.nodeCount(result) // => 3
+     * Graph.edgeCount(result) // => 1
      * ```
      *
      * @category set operations
@@ -900,7 +903,7 @@ export declare const difference: {
      *
      * **Example** (Removing shared edges)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<string, string>((mutable) => {
@@ -919,8 +922,8 @@ export declare const difference: {
      *
      * const result = Graph.difference(left, right)
      *
-     * console.log(Graph.nodeCount(result)) // 3
-     * console.log(Graph.edgeCount(result)) // 1
+     * Graph.nodeCount(result) // => 3
+     * Graph.edgeCount(result) // => 1
      * ```
      *
      * @category set operations
@@ -951,7 +954,7 @@ export declare const difference: {
  *
  * **Example** (Finding differing edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const left = Graph.directed<string, string>((mutable) => {
@@ -972,8 +975,8 @@ export declare const difference: {
  *
  * const result = Graph.symmetricDifference(left, right)
  *
- * console.log(Graph.nodeCount(result)) // 4
- * console.log(Graph.edgeCount(result)) // 2
+ * Graph.nodeCount(result) // => 4
+ * Graph.edgeCount(result) // => 2
  * ```
  *
  * @category set operations
@@ -1003,7 +1006,7 @@ export declare const symmetricDifference: {
      *
      * **Example** (Finding differing edges)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<string, string>((mutable) => {
@@ -1024,8 +1027,8 @@ export declare const symmetricDifference: {
      *
      * const result = Graph.symmetricDifference(left, right)
      *
-     * console.log(Graph.nodeCount(result)) // 4
-     * console.log(Graph.edgeCount(result)) // 2
+     * Graph.nodeCount(result) // => 4
+     * Graph.edgeCount(result) // => 2
      * ```
      *
      * @category set operations
@@ -1055,7 +1058,7 @@ export declare const symmetricDifference: {
      *
      * **Example** (Finding differing edges)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<string, string>((mutable) => {
@@ -1076,8 +1079,8 @@ export declare const symmetricDifference: {
      *
      * const result = Graph.symmetricDifference(left, right)
      *
-     * console.log(Graph.nodeCount(result)) // 4
-     * console.log(Graph.edgeCount(result)) // 2
+     * Graph.nodeCount(result) // => 4
+     * Graph.edgeCount(result) // => 2
      * ```
      *
      * @category set operations
@@ -1098,7 +1101,7 @@ export declare const symmetricDifference: {
  *
  * **Example** (Finding missing relationships)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, string>((mutable) => {
@@ -1109,7 +1112,7 @@ export declare const symmetricDifference: {
  *
  * const result = Graph.complement(graph, (source, target) => `${source}-${target}`)
  *
- * console.log(Graph.edgeCount(result)) // 1
+ * Graph.edgeCount(result) // => 1
  * ```
  *
  * @category set operations
@@ -1129,7 +1132,7 @@ export declare const complement: {
      *
      * **Example** (Finding missing relationships)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, string>((mutable) => {
@@ -1140,7 +1143,7 @@ export declare const complement: {
      *
      * const result = Graph.complement(graph, (source, target) => `${source}-${target}`)
      *
-     * console.log(Graph.edgeCount(result)) // 1
+     * Graph.edgeCount(result) // => 1
      * ```
      *
      * @category set operations
@@ -1160,7 +1163,7 @@ export declare const complement: {
      *
      * **Example** (Finding missing relationships)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, string>((mutable) => {
@@ -1171,7 +1174,7 @@ export declare const complement: {
      *
      * const result = Graph.complement(graph, (source, target) => `${source}-${target}`)
      *
-     * console.log(Graph.edgeCount(result)) // 1
+     * Graph.edgeCount(result) // => 1
      * ```
      *
      * @category set operations
@@ -1208,7 +1211,7 @@ export interface NeighborhoodConfig {
  *
  * **Example** (Getting a local neighborhood)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, string>((mutable) => {
@@ -1221,7 +1224,7 @@ export interface NeighborhoodConfig {
  *
  * const result = Graph.neighborhood(graph, 1, { radius: 1 })
  *
- * console.log(Graph.nodeCount(result)) // 2
+ * Graph.nodeCount(result) // => 2
  * ```
  *
  * @category set operations
@@ -1241,7 +1244,7 @@ export declare const neighborhood: {
      *
      * **Example** (Getting a local neighborhood)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, string>((mutable) => {
@@ -1254,7 +1257,7 @@ export declare const neighborhood: {
      *
      * const result = Graph.neighborhood(graph, 1, { radius: 1 })
      *
-     * console.log(Graph.nodeCount(result)) // 2
+     * Graph.nodeCount(result) // => 2
      * ```
      *
      * @category set operations
@@ -1274,7 +1277,7 @@ export declare const neighborhood: {
      *
      * **Example** (Getting a local neighborhood)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, string>((mutable) => {
@@ -1287,7 +1290,7 @@ export declare const neighborhood: {
      *
      * const result = Graph.neighborhood(graph, 1, { radius: 1 })
      *
-     * console.log(Graph.nodeCount(result)) // 2
+     * Graph.nodeCount(result) // => 2
      * ```
      *
      * @category set operations
@@ -1361,14 +1364,12 @@ export declare const sum: {
  *
  * **Example** (Adding nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
- * const result = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
- *   const nodeA = Graph.addNode(mutable, "Node A")
- *   const nodeB = Graph.addNode(mutable, "Node B")
- *   console.log(nodeA) // NodeIndex with value 0
- *   console.log(nodeB) // NodeIndex with value 1
+ * Graph.mutate(Graph.directed<string, number>(), (mutable) => {
+ *   Graph.addNode(mutable, "Node A") // => 0
+ *   Graph.addNode(mutable, "Node B") // => 1
  * })
  * ```
  *
@@ -1385,19 +1386,14 @@ export declare const addNode: <N, E, T extends Kind = "directed">(mutable: Mutab
  *
  * **Example** (Getting node data)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph, Option } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
  *   Graph.addNode(mutable, "Node A")
  * })
  *
- * const nodeIndex = 0
- * const nodeData = Graph.getNode(graph, nodeIndex)
- *
- * if (Option.isSome(nodeData)) {
- *   console.log(nodeData.value) // "Node A"
- * }
+ * Graph.getNode(graph, 0) // => Option.some("Node A")
  * ```
  *
  * @category getters
@@ -1409,19 +1405,14 @@ export declare const getNode: {
      *
      * **Example** (Getting node data)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   Graph.addNode(mutable, "Node A")
      * })
      *
-     * const nodeIndex = 0
-     * const nodeData = Graph.getNode(graph, nodeIndex)
-     *
-     * if (Option.isSome(nodeData)) {
-     *   console.log(nodeData.value) // "Node A"
-     * }
+     * Graph.getNode(graph, 0) // => Option.some("Node A")
      * ```
      *
      * @category getters
@@ -1433,19 +1424,14 @@ export declare const getNode: {
      *
      * **Example** (Getting node data)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   Graph.addNode(mutable, "Node A")
      * })
      *
-     * const nodeIndex = 0
-     * const nodeData = Graph.getNode(graph, nodeIndex)
-     *
-     * if (Option.isSome(nodeData)) {
-     *   console.log(nodeData.value) // "Node A"
-     * }
+     * Graph.getNode(graph, 0) // => Option.some("Node A")
      * ```
      *
      * @category getters
@@ -1458,20 +1444,15 @@ export declare const getNode: {
  *
  * **Example** (Checking node existence)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
  *   Graph.addNode(mutable, "Node A")
  * })
  *
- * const nodeIndex = 0
- * const exists = Graph.hasNode(graph, nodeIndex)
- * console.log(exists) // true
- *
- * const nonExistentIndex = 999
- * const notExists = Graph.hasNode(graph, nonExistentIndex)
- * console.log(notExists) // false
+ * Graph.hasNode(graph, 0) // => true
+ * Graph.hasNode(graph, 999) // => false
  * ```
  *
  * @category getters
@@ -1483,20 +1464,15 @@ export declare const hasNode: {
      *
      * **Example** (Checking node existence)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   Graph.addNode(mutable, "Node A")
      * })
      *
-     * const nodeIndex = 0
-     * const exists = Graph.hasNode(graph, nodeIndex)
-     * console.log(exists) // true
-     *
-     * const nonExistentIndex = 999
-     * const notExists = Graph.hasNode(graph, nonExistentIndex)
-     * console.log(notExists) // false
+     * Graph.hasNode(graph, 0) // => true
+     * Graph.hasNode(graph, 999) // => false
      * ```
      *
      * @category getters
@@ -1508,20 +1484,15 @@ export declare const hasNode: {
      *
      * **Example** (Checking node existence)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   Graph.addNode(mutable, "Node A")
      * })
      *
-     * const nodeIndex = 0
-     * const exists = Graph.hasNode(graph, nodeIndex)
-     * console.log(exists) // true
-     *
-     * const nonExistentIndex = 999
-     * const notExists = Graph.hasNode(graph, nonExistentIndex)
-     * console.log(notExists) // false
+     * Graph.hasNode(graph, 0) // => true
+     * Graph.hasNode(graph, 999) // => false
      * ```
      *
      * @category getters
@@ -1534,11 +1505,11 @@ export declare const hasNode: {
  *
  * **Example** (Counting nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const emptyGraph = Graph.directed<string, number>()
- * console.log(Graph.nodeCount(emptyGraph)) // 0
+ * Graph.nodeCount(emptyGraph) // => 0
  *
  * const graphWithNodes = Graph.mutate(emptyGraph, (mutable) => {
  *   Graph.addNode(mutable, "Node A")
@@ -1546,7 +1517,7 @@ export declare const hasNode: {
  *   Graph.addNode(mutable, "Node C")
  * })
  *
- * console.log(Graph.nodeCount(graphWithNodes)) // 3
+ * Graph.nodeCount(graphWithNodes) // => 3
  * ```
  *
  * @category getters
@@ -1558,8 +1529,8 @@ export declare const nodeCount: <N, E, T extends Kind = "directed">(graph: Graph
  *
  * **Example** (Finding the first matching node)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
  *   Graph.addNode(mutable, "Node A")
@@ -1567,11 +1538,8 @@ export declare const nodeCount: <N, E, T extends Kind = "directed">(graph: Graph
  *   Graph.addNode(mutable, "Node C")
  * })
  *
- * const result = Graph.findNode(graph, (data) => data.startsWith("Node B"))
- * console.log(result) // Option.some(1)
- *
- * const notFound = Graph.findNode(graph, (data) => data === "Node D")
- * console.log(notFound) // Option.none()
+ * Graph.findNode(graph, (data) => data.startsWith("Node B")) // => Option.some(1)
+ * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
  * ```
  *
  * @category getters
@@ -1583,8 +1551,8 @@ export declare const findNode: {
      *
      * **Example** (Finding the first matching node)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   Graph.addNode(mutable, "Node A")
@@ -1592,11 +1560,8 @@ export declare const findNode: {
      *   Graph.addNode(mutable, "Node C")
      * })
      *
-     * const result = Graph.findNode(graph, (data) => data.startsWith("Node B"))
-     * console.log(result) // Option.some(1)
-     *
-     * const notFound = Graph.findNode(graph, (data) => data === "Node D")
-     * console.log(notFound) // Option.none()
+     * Graph.findNode(graph, (data) => data.startsWith("Node B")) // => Option.some(1)
+     * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
      * ```
      *
      * @category getters
@@ -1608,8 +1573,8 @@ export declare const findNode: {
      *
      * **Example** (Finding the first matching node)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   Graph.addNode(mutable, "Node A")
@@ -1617,11 +1582,8 @@ export declare const findNode: {
      *   Graph.addNode(mutable, "Node C")
      * })
      *
-     * const result = Graph.findNode(graph, (data) => data.startsWith("Node B"))
-     * console.log(result) // Option.some(1)
-     *
-     * const notFound = Graph.findNode(graph, (data) => data === "Node D")
-     * console.log(notFound) // Option.none()
+     * Graph.findNode(graph, (data) => data.startsWith("Node B")) // => Option.some(1)
+     * Graph.findNode(graph, (data) => data === "Node D") // => Option.none()
      * ```
      *
      * @category getters
@@ -1634,7 +1596,7 @@ export declare const findNode: {
  *
  * **Example** (Finding matching nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -1643,11 +1605,8 @@ export declare const findNode: {
  *   Graph.addNode(mutable, "Start C")
  * })
  *
- * const result = Graph.findNodes(graph, (data) => data.startsWith("Start"))
- * console.log(result) // [0, 2]
- *
- * const empty = Graph.findNodes(graph, (data) => data === "Not Found")
- * console.log(empty) // []
+ * Graph.findNodes(graph, (data) => data.startsWith("Start")) // => [0, 2]
+ * Graph.findNodes(graph, (data) => data === "Not Found") // => []
  * ```
  *
  * @category getters
@@ -1659,7 +1618,7 @@ export declare const findNodes: {
      *
      * **Example** (Finding matching nodes)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -1668,11 +1627,8 @@ export declare const findNodes: {
      *   Graph.addNode(mutable, "Start C")
      * })
      *
-     * const result = Graph.findNodes(graph, (data) => data.startsWith("Start"))
-     * console.log(result) // [0, 2]
-     *
-     * const empty = Graph.findNodes(graph, (data) => data === "Not Found")
-     * console.log(empty) // []
+     * Graph.findNodes(graph, (data) => data.startsWith("Start")) // => [0, 2]
+     * Graph.findNodes(graph, (data) => data === "Not Found") // => []
      * ```
      *
      * @category getters
@@ -1684,7 +1640,7 @@ export declare const findNodes: {
      *
      * **Example** (Finding matching nodes)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -1693,11 +1649,8 @@ export declare const findNodes: {
      *   Graph.addNode(mutable, "Start C")
      * })
      *
-     * const result = Graph.findNodes(graph, (data) => data.startsWith("Start"))
-     * console.log(result) // [0, 2]
-     *
-     * const empty = Graph.findNodes(graph, (data) => data === "Not Found")
-     * console.log(empty) // []
+     * Graph.findNodes(graph, (data) => data.startsWith("Start")) // => [0, 2]
+     * Graph.findNodes(graph, (data) => data === "Not Found") // => []
      * ```
      *
      * @category getters
@@ -1710,8 +1663,8 @@ export declare const findNodes: {
  *
  * **Example** (Finding the first matching edge)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
  *   const nodeA = Graph.addNode(mutable, "Node A")
@@ -1721,11 +1674,8 @@ export declare const findNodes: {
  *   Graph.addEdge(mutable, nodeB, nodeC, 20)
  * })
  *
- * const result = Graph.findEdge(graph, (data) => data > 15)
- * console.log(result) // Option.some(1)
- *
- * const notFound = Graph.findEdge(graph, (data) => data > 100)
- * console.log(notFound) // Option.none()
+ * Graph.findEdge(graph, (data) => data > 15) // => Option.some(1)
+ * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
  * ```
  *
  * @category getters
@@ -1737,8 +1687,8 @@ export declare const findEdge: {
      *
      * **Example** (Finding the first matching edge)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   const nodeA = Graph.addNode(mutable, "Node A")
@@ -1748,11 +1698,8 @@ export declare const findEdge: {
      *   Graph.addEdge(mutable, nodeB, nodeC, 20)
      * })
      *
-     * const result = Graph.findEdge(graph, (data) => data > 15)
-     * console.log(result) // Option.some(1)
-     *
-     * const notFound = Graph.findEdge(graph, (data) => data > 100)
-     * console.log(notFound) // Option.none()
+     * Graph.findEdge(graph, (data) => data > 15) // => Option.some(1)
+     * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
      * ```
      *
      * @category getters
@@ -1764,8 +1711,8 @@ export declare const findEdge: {
      *
      * **Example** (Finding the first matching edge)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   const nodeA = Graph.addNode(mutable, "Node A")
@@ -1775,11 +1722,8 @@ export declare const findEdge: {
      *   Graph.addEdge(mutable, nodeB, nodeC, 20)
      * })
      *
-     * const result = Graph.findEdge(graph, (data) => data > 15)
-     * console.log(result) // Option.some(1)
-     *
-     * const notFound = Graph.findEdge(graph, (data) => data > 100)
-     * console.log(notFound) // Option.none()
+     * Graph.findEdge(graph, (data) => data > 15) // => Option.some(1)
+     * Graph.findEdge(graph, (data) => data > 100) // => Option.none()
      * ```
      *
      * @category getters
@@ -1792,7 +1736,7 @@ export declare const findEdge: {
  *
  * **Example** (Finding matching edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -1804,11 +1748,8 @@ export declare const findEdge: {
  *   Graph.addEdge(mutable, nodeC, nodeA, 30)
  * })
  *
- * const result = Graph.findEdges(graph, (data) => data >= 20)
- * console.log(result) // [1, 2]
- *
- * const empty = Graph.findEdges(graph, (data) => data > 100)
- * console.log(empty) // []
+ * Graph.findEdges(graph, (data) => data >= 20) // => [1, 2]
+ * Graph.findEdges(graph, (data) => data > 100) // => []
  * ```
  *
  * @category getters
@@ -1820,7 +1761,7 @@ export declare const findEdges: {
      *
      * **Example** (Finding matching edges)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -1832,11 +1773,8 @@ export declare const findEdges: {
      *   Graph.addEdge(mutable, nodeC, nodeA, 30)
      * })
      *
-     * const result = Graph.findEdges(graph, (data) => data >= 20)
-     * console.log(result) // [1, 2]
-     *
-     * const empty = Graph.findEdges(graph, (data) => data > 100)
-     * console.log(empty) // []
+     * Graph.findEdges(graph, (data) => data >= 20) // => [1, 2]
+     * Graph.findEdges(graph, (data) => data > 100) // => []
      * ```
      *
      * @category getters
@@ -1848,7 +1786,7 @@ export declare const findEdges: {
      *
      * **Example** (Finding matching edges)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -1860,11 +1798,8 @@ export declare const findEdges: {
      *   Graph.addEdge(mutable, nodeC, nodeA, 30)
      * })
      *
-     * const result = Graph.findEdges(graph, (data) => data >= 20)
-     * console.log(result) // [1, 2]
-     *
-     * const empty = Graph.findEdges(graph, (data) => data > 100)
-     * console.log(empty) // []
+     * Graph.findEdges(graph, (data) => data >= 20) // => [1, 2]
+     * Graph.findEdges(graph, (data) => data > 100) // => []
      * ```
      *
      * @category getters
@@ -1877,8 +1812,8 @@ export declare const findEdges: {
  *
  * **Example** (Updating node data)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
  *   Graph.addNode(mutable, "Node A")
@@ -1886,8 +1821,7 @@ export declare const findEdges: {
  *   Graph.updateNode(mutable, 0, (data) => data.toUpperCase())
  * })
  *
- * const nodeData = Graph.getNode(graph, 0)
- * console.log(nodeData) // Option.some("NODE A")
+ * Graph.getNode(graph, 0) // => Option.some("NODE A")
  * ```
  *
  * @category transforming
@@ -1899,8 +1833,8 @@ export declare const updateNode: <N, E, T extends Kind = "directed">(mutable: Mu
  *
  * **Example** (Updating edge data)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const result = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
  *   const nodeA = Graph.addNode(mutable, "Node A")
@@ -1909,8 +1843,7 @@ export declare const updateNode: <N, E, T extends Kind = "directed">(mutable: Mu
  *   Graph.updateEdge(mutable, edgeIndex, (data) => data * 2)
  * })
  *
- * const edgeData = Graph.getEdge(result, 0)
- * console.log(edgeData) // Option.some(new Graph.Edge({ source: 0, target: 1, data: 20 }))
+ * Option.map(Graph.getEdge(result, 0), (edge) => edge.data) // => Option.some(20)
  * ```
  *
  * @category mutations
@@ -1927,8 +1860,8 @@ export declare const updateEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  *
  * **Example** (Mapping node data)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
  *   Graph.addNode(mutable, "node a")
@@ -1937,8 +1870,7 @@ export declare const updateEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  *   Graph.mapNodes(mutable, (data) => data.toUpperCase())
  * })
  *
- * const nodeData = Graph.getNode(graph, 0)
- * console.log(nodeData) // Option.some("NODE A")
+ * Graph.getNode(graph, 0) // => Option.some("NODE A")
  * ```
  *
  * @category transforming
@@ -1950,8 +1882,8 @@ export declare const mapNodes: <N, E, T extends Kind = "directed">(mutable: Muta
  *
  * **Example** (Mapping edge data)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
  *   const a = Graph.addNode(mutable, "A")
@@ -1962,8 +1894,7 @@ export declare const mapNodes: <N, E, T extends Kind = "directed">(mutable: Muta
  *   Graph.mapEdges(mutable, (data) => data * 2)
  * })
  *
- * const edgeData = Graph.getEdge(graph, 0)
- * console.log(edgeData) // Option.some(new Graph.Edge({ source: 0, target: 1, data: 20 }))
+ * Option.map(Graph.getEdge(graph, 0), (edge) => edge.data) // => Option.some(20)
  * ```
  *
  * @category transforming
@@ -1975,8 +1906,8 @@ export declare const mapEdges: <N, E, T extends Kind = "directed">(mutable: Muta
  *
  * **Example** (Reversing edge directions)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
  *   const a = Graph.addNode(mutable, "A")
@@ -1987,8 +1918,7 @@ export declare const mapEdges: <N, E, T extends Kind = "directed">(mutable: Muta
  *   Graph.reverse(mutable) // Now B -> A, C -> B
  * })
  *
- * const edge0 = Graph.getEdge(graph, 0)
- * console.log(edge0) // Option.some(new Graph.Edge({ source: 1, target: 0, data: 1 }))
+ * Option.map(Graph.getEdge(graph, 0), (edge) => edge.source) // => Option.some(1)
  * ```
  *
  * @category transforming
@@ -2001,7 +1931,7 @@ export declare const reverse: <N, E, T extends Kind = "directed">(mutable: Mutab
  *
  * **Example** (Filtering and mapping nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -2019,7 +1949,7 @@ export declare const reverse: <N, E, T extends Kind = "directed">(mutable: Mutab
  *   )
  * })
  *
- * console.log(Graph.nodeCount(graph)) // 2 (only "active" nodes remain)
+ * Graph.nodeCount(graph) // => 2
  * ```
  *
  * @category transforming
@@ -2032,7 +1962,7 @@ export declare const filterMapNodes: <N, E, T extends Kind = "directed">(mutable
  *
  * **Example** (Filtering and mapping edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -2050,7 +1980,7 @@ export declare const filterMapNodes: <N, E, T extends Kind = "directed">(mutable
  *   )
  * })
  *
- * console.log(Graph.edgeCount(graph)) // 2 (edges with weight 5 removed)
+ * Graph.edgeCount(graph) // => 2
  * ```
  *
  * @category transforming
@@ -2063,7 +1993,7 @@ export declare const filterMapEdges: <N, E, T extends Kind = "directed">(mutable
  *
  * **Example** (Filtering nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -2076,7 +2006,7 @@ export declare const filterMapEdges: <N, E, T extends Kind = "directed">(mutable
  *   Graph.filterNodes(mutable, (data) => data === "active")
  * })
  *
- * console.log(Graph.nodeCount(graph)) // 2 (only "active" nodes remain)
+ * Graph.nodeCount(graph) // => 2
  * ```
  *
  * @category transforming
@@ -2089,7 +2019,7 @@ export declare const filterNodes: <N, E, T extends Kind = "directed">(mutable: M
  *
  * **Example** (Filtering edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -2105,7 +2035,7 @@ export declare const filterNodes: <N, E, T extends Kind = "directed">(mutable: M
  *   Graph.filterEdges(mutable, (data) => data >= 10)
  * })
  *
- * console.log(Graph.edgeCount(graph)) // 2 (edge with weight 5 removed)
+ * Graph.edgeCount(graph) // => 2
  * ```
  *
  * @category transforming
@@ -2133,14 +2063,13 @@ export declare const filterEdges: <N, E, T extends Kind = "directed">(mutable: M
  *
  * **Example** (Adding edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
- * const result = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
+ * Graph.mutate(Graph.directed<string, number>(), (mutable) => {
  *   const nodeA = Graph.addNode(mutable, "Node A")
  *   const nodeB = Graph.addNode(mutable, "Node B")
- *   const edge = Graph.addEdge(mutable, nodeA, nodeB, 42)
- *   console.log(edge) // EdgeIndex with value 0
+ *   Graph.addEdge(mutable, nodeA, nodeB, 42) // => 0
  * })
  * ```
  *
@@ -2158,7 +2087,7 @@ export declare const addEdge: <N, E, T extends Kind = "directed">(mutable: Mutab
  *
  * **Example** (Removing a node)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const result = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2169,6 +2098,7 @@ export declare const addEdge: <N, E, T extends Kind = "directed">(mutable: Mutab
  *   // Remove nodeA and all edges connected to it
  *   Graph.removeNode(mutable, nodeA)
  * })
+ * Array.of(Graph.nodeCount(result), Graph.edgeCount(result)) // => [1, 0]
  * ```
  *
  * @category mutations
@@ -2180,7 +2110,7 @@ export declare const removeNode: <N, E, T extends Kind = "directed">(mutable: Mu
  *
  * **Example** (Removing an edge)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const result = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2191,6 +2121,7 @@ export declare const removeNode: <N, E, T extends Kind = "directed">(mutable: Mu
  *   // Remove the edge
  *   Graph.removeEdge(mutable, edge)
  * })
+ * Array.of(Graph.nodeCount(result), Graph.edgeCount(result)) // => [2, 0]
  * ```
  *
  * @category mutations
@@ -2202,8 +2133,8 @@ export declare const removeEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  *
  * **Example** (Getting edge data)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
  *   const nodeA = Graph.addNode(mutable, "Node A")
@@ -2211,14 +2142,7 @@ export declare const removeEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  *   Graph.addEdge(mutable, nodeA, nodeB, 42)
  * })
  *
- * const edgeIndex = 0
- * const edgeData = Graph.getEdge(graph, edgeIndex)
- *
- * if (edgeData._tag === "Some") {
- *   console.log(edgeData.value.data) // 42
- *   console.log(edgeData.value.source) // 0
- *   console.log(edgeData.value.target) // 1
- * }
+ * Graph.getEdge(graph, 0) // => Option.some(new Graph.Edge({ source: 0, target: 1, data: 42 }))
  * ```
  *
  * @category getters
@@ -2230,8 +2154,8 @@ export declare const getEdge: {
      *
      * **Example** (Getting edge data)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   const nodeA = Graph.addNode(mutable, "Node A")
@@ -2239,14 +2163,7 @@ export declare const getEdge: {
      *   Graph.addEdge(mutable, nodeA, nodeB, 42)
      * })
      *
-     * const edgeIndex = 0
-     * const edgeData = Graph.getEdge(graph, edgeIndex)
-     *
-     * if (edgeData._tag === "Some") {
-     *   console.log(edgeData.value.data) // 42
-     *   console.log(edgeData.value.source) // 0
-     *   console.log(edgeData.value.target) // 1
-     * }
+     * Graph.getEdge(graph, 0) // => Option.some(new Graph.Edge({ source: 0, target: 1, data: 42 }))
      * ```
      *
      * @category getters
@@ -2258,8 +2175,8 @@ export declare const getEdge: {
      *
      * **Example** (Getting edge data)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
      *   const nodeA = Graph.addNode(mutable, "Node A")
@@ -2267,14 +2184,7 @@ export declare const getEdge: {
      *   Graph.addEdge(mutable, nodeA, nodeB, 42)
      * })
      *
-     * const edgeIndex = 0
-     * const edgeData = Graph.getEdge(graph, edgeIndex)
-     *
-     * if (edgeData._tag === "Some") {
-     *   console.log(edgeData.value.data) // 42
-     *   console.log(edgeData.value.source) // 0
-     *   console.log(edgeData.value.target) // 1
-     * }
+     * Graph.getEdge(graph, 0) // => Option.some(new Graph.Edge({ source: 0, target: 1, data: 42 }))
      * ```
      *
      * @category getters
@@ -2287,7 +2197,7 @@ export declare const getEdge: {
  *
  * **Example** (Checking edge existence)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2297,15 +2207,8 @@ export declare const getEdge: {
  *   Graph.addEdge(mutable, nodeA, nodeB, 42)
  * })
  *
- * const nodeA = 0
- * const nodeB = 1
- * const nodeC = 2
- *
- * const hasAB = Graph.hasEdge(graph, nodeA, nodeB)
- * console.log(hasAB) // true
- *
- * const hasAC = Graph.hasEdge(graph, nodeA, nodeC)
- * console.log(hasAC) // false
+ * Graph.hasEdge(graph, 0, 1) // => true
+ * Graph.hasEdge(graph, 0, 2) // => false
  * ```
  *
  * @category getters
@@ -2317,7 +2220,7 @@ export declare const hasEdge: {
      *
      * **Example** (Checking edge existence)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2327,15 +2230,8 @@ export declare const hasEdge: {
      *   Graph.addEdge(mutable, nodeA, nodeB, 42)
      * })
      *
-     * const nodeA = 0
-     * const nodeB = 1
-     * const nodeC = 2
-     *
-     * const hasAB = Graph.hasEdge(graph, nodeA, nodeB)
-     * console.log(hasAB) // true
-     *
-     * const hasAC = Graph.hasEdge(graph, nodeA, nodeC)
-     * console.log(hasAC) // false
+     * Graph.hasEdge(graph, 0, 1) // => true
+     * Graph.hasEdge(graph, 0, 2) // => false
      * ```
      *
      * @category getters
@@ -2347,7 +2243,7 @@ export declare const hasEdge: {
      *
      * **Example** (Checking edge existence)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2357,15 +2253,8 @@ export declare const hasEdge: {
      *   Graph.addEdge(mutable, nodeA, nodeB, 42)
      * })
      *
-     * const nodeA = 0
-     * const nodeB = 1
-     * const nodeC = 2
-     *
-     * const hasAB = Graph.hasEdge(graph, nodeA, nodeB)
-     * console.log(hasAB) // true
-     *
-     * const hasAC = Graph.hasEdge(graph, nodeA, nodeC)
-     * console.log(hasAC) // false
+     * Graph.hasEdge(graph, 0, 1) // => true
+     * Graph.hasEdge(graph, 0, 2) // => false
      * ```
      *
      * @category getters
@@ -2378,11 +2267,11 @@ export declare const hasEdge: {
  *
  * **Example** (Counting edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const emptyGraph = Graph.directed<string, number>()
- * console.log(Graph.edgeCount(emptyGraph)) // 0
+ * Graph.edgeCount(emptyGraph) // => 0
  *
  * const graphWithEdges = Graph.mutate(emptyGraph, (mutable) => {
  *   const nodeA = Graph.addNode(mutable, "Node A")
@@ -2393,7 +2282,7 @@ export declare const hasEdge: {
  *   Graph.addEdge(mutable, nodeC, nodeA, 3)
  * })
  *
- * console.log(Graph.edgeCount(graphWithEdges)) // 3
+ * Graph.edgeCount(graphWithEdges) // => 3
  * ```
  *
  * @category getters
@@ -2410,7 +2299,7 @@ export declare const edgeCount: <N, E, T extends Kind = "directed">(graph: Graph
  *
  * **Example** (Getting outgoing neighbors)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2421,15 +2310,8 @@ export declare const edgeCount: <N, E, T extends Kind = "directed">(graph: Graph
  *   Graph.addEdge(mutable, nodeA, nodeC, 2)
  * })
  *
- * const nodeA = 0
- * const nodeB = 1
- * const nodeC = 2
- *
- * const neighborsA = Graph.neighbors(graph, nodeA)
- * console.log(neighborsA) // [1, 2]
- *
- * const neighborsB = Graph.neighbors(graph, nodeB)
- * console.log(neighborsB) // []
+ * Graph.neighbors(graph, 0) // => [1, 2]
+ * Graph.neighbors(graph, 1) // => []
  * ```
  *
  * @category getters
@@ -2446,7 +2328,7 @@ export declare const neighbors: {
      *
      * **Example** (Getting outgoing neighbors)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2457,15 +2339,8 @@ export declare const neighbors: {
      *   Graph.addEdge(mutable, nodeA, nodeC, 2)
      * })
      *
-     * const nodeA = 0
-     * const nodeB = 1
-     * const nodeC = 2
-     *
-     * const neighborsA = Graph.neighbors(graph, nodeA)
-     * console.log(neighborsA) // [1, 2]
-     *
-     * const neighborsB = Graph.neighbors(graph, nodeB)
-     * console.log(neighborsB) // []
+     * Graph.neighbors(graph, 0) // => [1, 2]
+     * Graph.neighbors(graph, 1) // => []
      * ```
      *
      * @category getters
@@ -2482,7 +2357,7 @@ export declare const neighbors: {
      *
      * **Example** (Getting outgoing neighbors)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2493,15 +2368,8 @@ export declare const neighbors: {
      *   Graph.addEdge(mutable, nodeA, nodeC, 2)
      * })
      *
-     * const nodeA = 0
-     * const nodeB = 1
-     * const nodeC = 2
-     *
-     * const neighborsA = Graph.neighbors(graph, nodeA)
-     * console.log(neighborsA) // [1, 2]
-     *
-     * const neighborsB = Graph.neighbors(graph, nodeB)
-     * console.log(neighborsB) // []
+     * Graph.neighbors(graph, 0) // => [1, 2]
+     * Graph.neighbors(graph, 1) // => []
      * ```
      *
      * @category getters
@@ -2524,7 +2392,7 @@ export declare const neighbors: {
  * @see {@link predecessors} for incoming neighbors in a directed graph
  * @see {@link neighbors} for generic neighbor lookup across graph kinds
  *
- * @category queries
+ * @category getters
  * @since 4.0.0
  */
 export declare const successors: {
@@ -2543,7 +2411,7 @@ export declare const successors: {
      * @see {@link predecessors} for incoming neighbors in a directed graph
      * @see {@link neighbors} for generic neighbor lookup across graph kinds
      *
-     * @category queries
+     * @category getters
      * @since 4.0.0
      */
     (nodeIndex: NodeIndex): <N, E>(graph: Graph<N, E, "directed"> | MutableGraph<N, E, "directed">) => Array<NodeIndex>;
@@ -2562,7 +2430,7 @@ export declare const successors: {
      * @see {@link predecessors} for incoming neighbors in a directed graph
      * @see {@link neighbors} for generic neighbor lookup across graph kinds
      *
-     * @category queries
+     * @category getters
      * @since 4.0.0
      */
     <N, E>(graph: Graph<N, E, "directed"> | MutableGraph<N, E, "directed">, nodeIndex: NodeIndex): Array<NodeIndex>;
@@ -2582,7 +2450,7 @@ export declare const successors: {
  * @see {@link successors} for outgoing neighbors in a directed graph
  * @see {@link neighbors} for generic neighbor lookup across graph kinds
  *
- * @category queries
+ * @category getters
  * @since 4.0.0
  */
 export declare const predecessors: {
@@ -2601,7 +2469,7 @@ export declare const predecessors: {
      * @see {@link successors} for outgoing neighbors in a directed graph
      * @see {@link neighbors} for generic neighbor lookup across graph kinds
      *
-     * @category queries
+     * @category getters
      * @since 4.0.0
      */
     (nodeIndex: NodeIndex): <N, E>(graph: Graph<N, E, "directed"> | MutableGraph<N, E, "directed">) => Array<NodeIndex>;
@@ -2620,7 +2488,7 @@ export declare const predecessors: {
      * @see {@link successors} for outgoing neighbors in a directed graph
      * @see {@link neighbors} for generic neighbor lookup across graph kinds
      *
-     * @category queries
+     * @category getters
      * @since 4.0.0
      */
     <N, E>(graph: Graph<N, E, "directed"> | MutableGraph<N, E, "directed">, nodeIndex: NodeIndex): Array<NodeIndex>;
@@ -2639,7 +2507,7 @@ export declare const predecessors: {
  *
  * **Example** (Traversing directed neighbors)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, string>((mutable) => {
@@ -2656,12 +2524,13 @@ export declare const predecessors: {
  *
  * // Get incoming neighbors (nodes that point to nodeB)
  * const incoming = Graph.neighborsDirected(graph, nodeB, "incoming")
+ * Array.of(outgoing, incoming) // => [[1], [0]]
  * ```
  *
  * @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
- * @category queries
+ * @category getters
  * @since 3.18.0
  */
 export declare const neighborsDirected: {
@@ -2679,7 +2548,7 @@ export declare const neighborsDirected: {
      *
      * **Example** (Traversing directed neighbors)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, string>((mutable) => {
@@ -2696,12 +2565,13 @@ export declare const neighborsDirected: {
      *
      * // Get incoming neighbors (nodes that point to nodeB)
      * const incoming = Graph.neighborsDirected(graph, nodeB, "incoming")
+     * Array.of(outgoing, incoming) // => [[1], [0]]
      * ```
      *
      * @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
-     * @category queries
+     * @category getters
      * @since 3.18.0
      */
     (nodeIndex: NodeIndex, direction: Direction): <N, E>(graph: Graph<N, E, "directed"> | MutableGraph<N, E, "directed">) => Array<NodeIndex>;
@@ -2719,7 +2589,7 @@ export declare const neighborsDirected: {
      *
      * **Example** (Traversing directed neighbors)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, string>((mutable) => {
@@ -2736,12 +2606,13 @@ export declare const neighborsDirected: {
      *
      * // Get incoming neighbors (nodes that point to nodeB)
      * const incoming = Graph.neighborsDirected(graph, nodeB, "incoming")
+     * Array.of(outgoing, incoming) // => [[1], [0]]
      * ```
      *
      * @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
-     * @category queries
+     * @category getters
      * @since 3.18.0
      */
     <N, E>(graph: Graph<N, E, "directed"> | MutableGraph<N, E, "directed">, nodeIndex: NodeIndex, direction: Direction): Array<NodeIndex>;
@@ -2756,7 +2627,7 @@ export declare const neighborsDirected: {
  *
  * **Example** (Configuring GraphViz labels)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Basic options with custom labels
@@ -2771,6 +2642,7 @@ export declare const neighborsDirected: {
  *   edgeLabel: (data) => data,
  *   graphName: "MyDependencyGraph"
  * }
+ * Array.of(basicOptions.nodeLabel?.("A"), namedOptions.graphName) // => ["Node: A", "MyDependencyGraph"]
  * ```
  *
  * @category options
@@ -2798,7 +2670,7 @@ export interface GraphVizOptions<N, E> {
  *
  * **Example** (Exporting GraphViz DOT)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2810,16 +2682,7 @@ export interface GraphVizOptions<N, E> {
  *   Graph.addEdge(mutable, nodeC, nodeA, 3)
  * })
  *
- * const dot = Graph.toGraphViz(graph)
- * console.log(dot)
- * // digraph "G" {
- * //   "0" [label="Node A"];
- * //   "1" [label="Node B"];
- * //   "2" [label="Node C"];
- * //   "0" -> "1" [label="1"];
- * //   "1" -> "2" [label="2"];
- * //   "2" -> "0" [label="3"];
- * // }
+ * Graph.toGraphViz(graph).split("\n") // => ['digraph "G" {', '  "0" [label="Node A"];', '  "1" [label="Node B"];', '  "2" [label="Node C"];', '  "0" -> "1" [label="1"];', '  "1" -> "2" [label="2"];', '  "2" -> "0" [label="3"];', "}"]
  * ```
  *
  * @category converting
@@ -2831,7 +2694,7 @@ export declare const toGraphViz: {
      *
      * **Example** (Exporting GraphViz DOT)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2843,16 +2706,7 @@ export declare const toGraphViz: {
      *   Graph.addEdge(mutable, nodeC, nodeA, 3)
      * })
      *
-     * const dot = Graph.toGraphViz(graph)
-     * console.log(dot)
-     * // digraph "G" {
-     * //   "0" [label="Node A"];
-     * //   "1" [label="Node B"];
-     * //   "2" [label="Node C"];
-     * //   "0" -> "1" [label="1"];
-     * //   "1" -> "2" [label="2"];
-     * //   "2" -> "0" [label="3"];
-     * // }
+     * Graph.toGraphViz(graph).split("\n") // => ['digraph "G" {', '  "0" [label="Node A"];', '  "1" [label="Node B"];', '  "2" [label="Node C"];', '  "0" -> "1" [label="1"];', '  "1" -> "2" [label="2"];', '  "2" -> "0" [label="3"];', "}"]
      * ```
      *
      * @category converting
@@ -2864,7 +2718,7 @@ export declare const toGraphViz: {
      *
      * **Example** (Exporting GraphViz DOT)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -2876,16 +2730,7 @@ export declare const toGraphViz: {
      *   Graph.addEdge(mutable, nodeC, nodeA, 3)
      * })
      *
-     * const dot = Graph.toGraphViz(graph)
-     * console.log(dot)
-     * // digraph "G" {
-     * //   "0" [label="Node A"];
-     * //   "1" [label="Node B"];
-     * //   "2" [label="Node C"];
-     * //   "0" -> "1" [label="1"];
-     * //   "1" -> "2" [label="2"];
-     * //   "2" -> "0" [label="3"];
-     * // }
+     * Graph.toGraphViz(graph).split("\n") // => ['digraph "G" {', '  "0" [label="Node A"];', '  "1" [label="Node B"];', '  "2" [label="Node C"];', '  "0" -> "1" [label="1"];', '  "1" -> "2" [label="2"];', '  "2" -> "0" [label="3"];', "}"]
      * ```
      *
      * @category converting
@@ -2910,7 +2755,7 @@ export declare const toGraphViz: {
  *
  * **Example** (Selecting Mermaid node shapes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Shape selector function for different node types
@@ -2925,6 +2770,7 @@ export declare const toGraphViz: {
  * const options: Graph.MermaidOptions<string, string> = {
  *   nodeShape: shapeSelector
  * }
+ * options.nodeShape?.("decision") // => "diamond"
  * ```
  *
  * @category models
@@ -2944,7 +2790,7 @@ export type MermaidNodeShape = "rectangle" | "rounded" | "circle" | "diamond" |
  *
  * **Example** (Configuring Mermaid directions)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Horizontal workflow diagram
@@ -2961,6 +2807,7 @@ export type MermaidNodeShape = "rectangle" | "rounded" | "circle" | "diamond" |
  * const bottomUpOptions: Graph.MermaidOptions<string, string> = {
  *   direction: "BT"
  * }
+ * Array.of(horizontalOptions.direction, verticalOptions.direction, bottomUpOptions.direction) // => ["LR", "TB", "BT"]
  * ```
  *
  * @category models
@@ -2981,7 +2828,7 @@ export type MermaidDirection = "TB" | "TD" | "BT" | "RL" | "LR";
  *
  * **Example** (Selecting Mermaid diagram types)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Force flowchart format (even for undirected graphs)
@@ -2996,6 +2843,7 @@ export type MermaidDirection = "TB" | "TD" | "BT" | "RL" | "LR";
  *
  * // Auto-detection (recommended, default behavior)
  * const autoOptions: Graph.MermaidOptions<string, string> = {}
+ * Array.of(flowchartOptions.diagramType, graphOptions.diagramType, autoOptions.diagramType) // => ["flowchart", "graph", undefined]
  * ```
  *
  * @category models
@@ -3018,7 +2866,7 @@ export type MermaidDiagramType = "flowchart" | "graph";
  *
  * **Example** (Configuring Mermaid output)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Basic options with custom labels
@@ -3035,6 +2883,7 @@ export type MermaidDiagramType = "flowchart" | "graph";
  *   direction: "LR",
  *   nodeShape: (data) => data.includes("start") ? "circle" : "rectangle"
  * }
+ * Array.of(basicOptions.nodeLabel?.("A"), advancedOptions.nodeShape?.("start")) // => ["Node: A", "circle"]
  * ```
  *
  * @category options
@@ -3080,7 +2929,7 @@ export interface MermaidOptions<N, E> {
  *
  * **Example** (Exporting a directed Mermaid diagram)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Basic directed graph export
@@ -3092,19 +2941,12 @@ export interface MermaidOptions<N, E> {
  *   Graph.addEdge(mutable, app, cache, 2)
  * })
  *
- * const mermaid = Graph.toMermaid(graph)
- * console.log(mermaid)
- * // flowchart TD
- * //   0["App"]
- * //   1["Database"]
- * //   2["Cache"]
- * //   0 -->|"1"| 1
- * //   0 -->|"2"| 2
+ * Graph.toMermaid(graph).split("\n") // => ["flowchart TD", '  0["App"]', '  1["Database"]', '  2["Cache"]', '  0 -->|"1"| 1', '  0 -->|"2"| 2']
  * ```
  *
  * **Example** (Exporting an undirected Mermaid diagram)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Undirected graph with custom labels and direction
@@ -3121,18 +2963,12 @@ export interface MermaidOptions<N, E> {
  *   edgeLabel: (relationship) => relationship,
  *   direction: "LR"
  * })
- * console.log(mermaid)
- * // graph LR
- * //   0["Alice"]
- * //   1["Bob"]
- * //   2["Charlie"]
- * //   0 ---|"friends"| 1
- * //   1 ---|"colleagues"| 2
+ * mermaid.split("\n") // => ["graph LR", '  0["Alice"]', '  1["Bob"]', '  2["Charlie"]', '  0 ---|"friends"| 1', '  1 ---|"colleagues"| 2']
  * ```
  *
  * **Example** (Customizing Mermaid node shapes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Advanced styling with node shapes for flowchart
@@ -3171,20 +3007,12 @@ export interface MermaidOptions<N, E> {
  *     }
  *   }
  * })
- * console.log(mermaid)
- * // flowchart TD
- * //   0(["Begin"])
- * //   1["Process Data"]
- * //   2{"Valid?"}
- * //   3(["Complete"])
- * //   0 --> 1
- * //   1 --> 2
- * //   2 --> 3
+ * mermaid.split("\n") // => ["flowchart TD", '  0(["Begin"])', '  1["Process Data"]', '  2{"Valid?"}', '  3(["Complete"])', "  0 --> 1", "  1 --> 2", '  2 -->|"yes"| 3']
  * ```
  *
  * **Example** (Visualizing dependency graphs)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Real-world example: Software dependency graph
@@ -3233,15 +3061,7 @@ export interface MermaidOptions<N, E> {
  *   direction: "TB"
  * })
  *
- * console.log(dependencyDiagram)
- * // flowchart TB
- * //   0["MyApp\nv1.0.0"]
- * //   1{{"React\nv18.0.0"}}
- * //   2["Lodash\nv4.17.0"]
- * //   3{"Webpack\nv5.0.0"}
- * //   0 -->|"depends on"| 1
- * //   0 -->|"depends on"| 2
- * //   0 -->|"builds with"| 3
+ * dependencyDiagram.split("\n") // => ["flowchart TB", '  0["MyApp#92;nv1.0.0"]', '  1{{"React#92;nv18.0.0"}}', '  2["Lodash#92;nv4.17.0"]', '  3{"Webpack#92;nv5.0.0"}', '  0 -->|"depends on"| 1', '  0 -->|"depends on"| 2', '  0 -->|"builds with"| 3']
  * ```
  *
  * @category converting
@@ -3260,7 +3080,7 @@ export declare const toMermaid: {
      *
      * **Example** (Exporting a directed Mermaid diagram)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * // Basic directed graph export
@@ -3272,19 +3092,12 @@ export declare const toMermaid: {
      *   Graph.addEdge(mutable, app, cache, 2)
      * })
      *
-     * const mermaid = Graph.toMermaid(graph)
-     * console.log(mermaid)
-     * // flowchart TD
-     * //   0["App"]
-     * //   1["Database"]
-     * //   2["Cache"]
-     * //   0 -->|"1"| 1
-     * //   0 -->|"2"| 2
+     * Graph.toMermaid(graph).split("\n") // => ["flowchart TD", '  0["App"]', '  1["Database"]', '  2["Cache"]', '  0 -->|"1"| 1', '  0 -->|"2"| 2']
      * ```
      *
      * **Example** (Exporting an undirected Mermaid diagram)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * // Undirected graph with custom labels and direction
@@ -3301,18 +3114,12 @@ export declare const toMermaid: {
      *   edgeLabel: (relationship) => relationship,
      *   direction: "LR"
      * })
-     * console.log(mermaid)
-     * // graph LR
-     * //   0["Alice"]
-     * //   1["Bob"]
-     * //   2["Charlie"]
-     * //   0 ---|"friends"| 1
-     * //   1 ---|"colleagues"| 2
+     * mermaid.split("\n") // => ["graph LR", '  0["Alice"]', '  1["Bob"]', '  2["Charlie"]', '  0 ---|"friends"| 1', '  1 ---|"colleagues"| 2']
      * ```
      *
      * **Example** (Customizing Mermaid node shapes)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * // Advanced styling with node shapes for flowchart
@@ -3351,20 +3158,12 @@ export declare const toMermaid: {
      *     }
      *   }
      * })
-     * console.log(mermaid)
-     * // flowchart TD
-     * //   0(["Begin"])
-     * //   1["Process Data"]
-     * //   2{"Valid?"}
-     * //   3(["Complete"])
-     * //   0 --> 1
-     * //   1 --> 2
-     * //   2 --> 3
+     * mermaid.split("\n") // => ["flowchart TD", '  0(["Begin"])', '  1["Process Data"]', '  2{"Valid?"}', '  3(["Complete"])', "  0 --> 1", "  1 --> 2", '  2 -->|"yes"| 3']
      * ```
      *
      * **Example** (Visualizing dependency graphs)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * // Real-world example: Software dependency graph
@@ -3413,15 +3212,7 @@ export declare const toMermaid: {
      *   direction: "TB"
      * })
      *
-     * console.log(dependencyDiagram)
-     * // flowchart TB
-     * //   0["MyApp\nv1.0.0"]
-     * //   1{{"React\nv18.0.0"}}
-     * //   2["Lodash\nv4.17.0"]
-     * //   3{"Webpack\nv5.0.0"}
-     * //   0 -->|"depends on"| 1
-     * //   0 -->|"depends on"| 2
-     * //   0 -->|"builds with"| 3
+     * dependencyDiagram.split("\n") // => ["flowchart TB", '  0["MyApp#92;nv1.0.0"]', '  1{{"React#92;nv18.0.0"}}', '  2["Lodash#92;nv4.17.0"]', '  3{"Webpack#92;nv5.0.0"}', '  0 -->|"depends on"| 1', '  0 -->|"depends on"| 2', '  0 -->|"builds with"| 3']
      * ```
      *
      * @category converting
@@ -3440,7 +3231,7 @@ export declare const toMermaid: {
      *
      * **Example** (Exporting a directed Mermaid diagram)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * // Basic directed graph export
@@ -3452,19 +3243,12 @@ export declare const toMermaid: {
      *   Graph.addEdge(mutable, app, cache, 2)
      * })
      *
-     * const mermaid = Graph.toMermaid(graph)
-     * console.log(mermaid)
-     * // flowchart TD
-     * //   0["App"]
-     * //   1["Database"]
-     * //   2["Cache"]
-     * //   0 -->|"1"| 1
-     * //   0 -->|"2"| 2
+     * Graph.toMermaid(graph).split("\n") // => ["flowchart TD", '  0["App"]', '  1["Database"]', '  2["Cache"]', '  0 -->|"1"| 1', '  0 -->|"2"| 2']
      * ```
      *
      * **Example** (Exporting an undirected Mermaid diagram)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * // Undirected graph with custom labels and direction
@@ -3481,18 +3265,12 @@ export declare const toMermaid: {
      *   edgeLabel: (relationship) => relationship,
      *   direction: "LR"
      * })
-     * console.log(mermaid)
-     * // graph LR
-     * //   0["Alice"]
-     * //   1["Bob"]
-     * //   2["Charlie"]
-     * //   0 ---|"friends"| 1
-     * //   1 ---|"colleagues"| 2
+     * mermaid.split("\n") // => ["graph LR", '  0["Alice"]', '  1["Bob"]', '  2["Charlie"]', '  0 ---|"friends"| 1', '  1 ---|"colleagues"| 2']
      * ```
      *
      * **Example** (Customizing Mermaid node shapes)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * // Advanced styling with node shapes for flowchart
@@ -3531,20 +3309,12 @@ export declare const toMermaid: {
      *     }
      *   }
      * })
-     * console.log(mermaid)
-     * // flowchart TD
-     * //   0(["Begin"])
-     * //   1["Process Data"]
-     * //   2{"Valid?"}
-     * //   3(["Complete"])
-     * //   0 --> 1
-     * //   1 --> 2
-     * //   2 --> 3
+     * mermaid.split("\n") // => ["flowchart TD", '  0(["Begin"])', '  1["Process Data"]', '  2{"Valid?"}', '  3(["Complete"])', "  0 --> 1", "  1 --> 2", '  2 -->|"yes"| 3']
      * ```
      *
      * **Example** (Visualizing dependency graphs)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * // Real-world example: Software dependency graph
@@ -3593,15 +3363,7 @@ export declare const toMermaid: {
      *   direction: "TB"
      * })
      *
-     * console.log(dependencyDiagram)
-     * // flowchart TB
-     * //   0["MyApp\nv1.0.0"]
-     * //   1{{"React\nv18.0.0"}}
-     * //   2["Lodash\nv4.17.0"]
-     * //   3{"Webpack\nv5.0.0"}
-     * //   0 -->|"depends on"| 1
-     * //   0 -->|"depends on"| 2
-     * //   0 -->|"builds with"| 3
+     * dependencyDiagram.split("\n") // => ["flowchart TB", '  0["MyApp#92;nv1.0.0"]', '  1{{"React#92;nv18.0.0"}}', '  2["Lodash#92;nv4.17.0"]', '  3{"Webpack#92;nv5.0.0"}', '  0 -->|"depends on"| 1', '  0 -->|"depends on"| 2', '  0 -->|"builds with"| 3']
      * ```
      *
      * @category converting
@@ -3632,7 +3394,7 @@ export type Direction = "outgoing" | "incoming";
  *
  * **Example** (Traversing by direction)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, string>((mutable) => {
@@ -3643,17 +3405,9 @@ export type Direction = "outgoing" | "incoming";
  *   Graph.addEdge(mutable, a, c, "A-C")
  * })
  *
- * const outgoing = Array.from(
- *   Graph.indices(Graph.bfs(graph, { start: [0], direction: "outgoing" }))
- * ) // [0, 1, 2]
- *
- * const incoming = Array.from(
- *   Graph.indices(Graph.bfs(graph, { start: [1], direction: "incoming" }))
- * ) // [1, 0]
- *
- * const undirected = Array.from(
- *   Graph.indices(Graph.bfs(graph, { start: [1], direction: "undirected" }))
- * ) // [1, 0, 2]
+ * Array.from(Graph.indices(Graph.bfs(graph, { start: [0], direction: "outgoing" }))) // => [0, 1, 2]
+ * Array.from(Graph.indices(Graph.bfs(graph, { start: [1], direction: "incoming" }))) // => [1, 0]
+ * Array.from(Graph.indices(Graph.bfs(graph, { start: [1], direction: "undirected" }))) // => [1, 0, 2]
  * ```
  *
  * @category models
@@ -3672,7 +3426,7 @@ export type TraversalDirection = Direction | "undirected";
  *
  * **Example** (Checking cycles)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Acyclic directed graph (DAG)
@@ -3683,7 +3437,7 @@ export type TraversalDirection = Direction | "undirected";
  *   Graph.addEdge(mutable, a, b, "A->B")
  *   Graph.addEdge(mutable, b, c, "B->C")
  * })
- * console.log(Graph.isAcyclic(dag)) // true
+ * Graph.isAcyclic(dag) // => true
  *
  * // Cyclic directed graph
  * const cyclic = Graph.directed<string, string>((mutable) => {
@@ -3692,7 +3446,7 @@ export type TraversalDirection = Direction | "undirected";
  *   Graph.addEdge(mutable, a, b, "A->B")
  *   Graph.addEdge(mutable, b, a, "B->A") // Creates cycle
  * })
- * console.log(Graph.isAcyclic(cyclic)) // false
+ * Graph.isAcyclic(cyclic) // => false
  * ```
  *
  * @category algorithms
@@ -3710,7 +3464,7 @@ export declare const isAcyclic: <N, E, T extends Kind = "directed">(graph: Graph
  *
  * **Example** (Checking bipartite graphs)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Bipartite graph (alternating coloring possible)
@@ -3723,7 +3477,7 @@ export declare const isAcyclic: <N, E, T extends Kind = "directed">(graph: Graph
  *   Graph.addEdge(mutable, b, c, "edge")
  *   Graph.addEdge(mutable, c, d, "edge")
  * })
- * console.log(Graph.isBipartite(bipartite)) // true
+ * Graph.isBipartite(bipartite) // => true
  *
  * // Non-bipartite graph (odd cycle)
  * const triangle = Graph.undirected<string, string>((mutable) => {
@@ -3734,7 +3488,7 @@ export declare const isAcyclic: <N, E, T extends Kind = "directed">(graph: Graph
  *   Graph.addEdge(mutable, b, c, "edge")
  *   Graph.addEdge(mutable, c, a, "edge") // Triangle (3-cycle)
  * })
- * console.log(Graph.isBipartite(triangle)) // false
+ * Graph.isBipartite(triangle) // => false
  * ```
  *
  * @category algorithms
@@ -3747,7 +3501,7 @@ export declare const isBipartite: <N, E>(graph: Graph<N, E, "undirected"> | Muta
  *
  * **Example** (Finding connected components)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.undirected<string, string>((mutable) => {
@@ -3759,8 +3513,7 @@ export declare const isBipartite: <N, E>(graph: Graph<N, E, "undirected"> | Muta
  *   Graph.addEdge(mutable, c, d, "edge") // Component 2: C-D
  * })
  *
- * const components = Graph.connectedComponents(graph)
- * console.log(components) // [[0, 1], [2, 3]]
+ * Graph.connectedComponents(graph) // => [[0, 1], [2, 3]]
  * ```
  *
  * @category algorithms
@@ -3777,7 +3530,7 @@ export declare const connectedComponents: <N, E>(graph: Graph<N, E, "undirected"
  *
  * **Example** (Finding strongly connected components)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, string>((mutable) => {
@@ -3789,8 +3542,7 @@ export declare const connectedComponents: <N, E>(graph: Graph<N, E, "undirected"
  *   Graph.addEdge(mutable, c, a, "C->A") // Creates SCC: A-B-C
  * })
  *
- * const sccs = Graph.stronglyConnectedComponents(graph)
- * console.log(sccs) // [[0, 1, 2]]
+ * Graph.stronglyConnectedComponents(graph) // => [[0, 2, 1]]
  * ```
  *
  * @category algorithms
@@ -3873,8 +3625,8 @@ export interface DijkstraConfig<E> {
  *
  * **Example** (Finding shortest paths with Dijkstra)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
  *   const a = Graph.addNode(mutable, "A")
@@ -3891,10 +3643,7 @@ export interface DijkstraConfig<E> {
  *   cost: (edgeData) => edgeData
  * })
  *
- * if (result._tag === "Some") {
- *   console.log(result.value.path) // [0, 1, 2] - shortest path A->B->C
- *   console.log(result.value.distance) // 7 - total distance
- * }
+ * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([7, [0, 1, 2]])
  * ```
  *
  * @category algorithms
@@ -3914,8 +3663,8 @@ export declare const dijkstra: {
      *
      * **Example** (Finding shortest paths with Dijkstra)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
      *   const a = Graph.addNode(mutable, "A")
@@ -3932,10 +3681,7 @@ export declare const dijkstra: {
      *   cost: (edgeData) => edgeData
      * })
      *
-     * if (result._tag === "Some") {
-     *   console.log(result.value.path) // [0, 1, 2] - shortest path A->B->C
-     *   console.log(result.value.distance) // 7 - total distance
-     * }
+     * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([7, [0, 1, 2]])
      * ```
      *
      * @category algorithms
@@ -3955,8 +3701,8 @@ export declare const dijkstra: {
      *
      * **Example** (Finding shortest paths with Dijkstra)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
      *   const a = Graph.addNode(mutable, "A")
@@ -3973,10 +3719,7 @@ export declare const dijkstra: {
      *   cost: (edgeData) => edgeData
      * })
      *
-     * if (result._tag === "Some") {
-     *   console.log(result.value.path) // [0, 1, 2] - shortest path A->B->C
-     *   console.log(result.value.distance) // 7 - total distance
-     * }
+     * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([7, [0, 1, 2]])
      * ```
      *
      * @category algorithms
@@ -4022,7 +3765,7 @@ export interface AllPairsResult<E> {
  *
  * **Example** (Finding all-pairs shortest paths)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -4035,8 +3778,8 @@ export interface AllPairsResult<E> {
  * })
  *
  * const result = Graph.floydWarshall(graph, (edgeData) => edgeData)
- * const distanceAToC = result.distances.get(0)?.get(2) // 5 (A->B->C)
- * const pathAToC = result.paths.get(0)?.get(2) // [0, 1, 2]
+ * const shortest = { distance: result.distances.get(0)?.get(2), path: result.paths.get(0)?.get(2) }
+ * shortest // => { distance: 5, path: [0, 1, 2] }
  * ```
  *
  * @category algorithms
@@ -4056,7 +3799,7 @@ export declare const floydWarshall: {
      *
      * **Example** (Finding all-pairs shortest paths)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -4069,8 +3812,8 @@ export declare const floydWarshall: {
      * })
      *
      * const result = Graph.floydWarshall(graph, (edgeData) => edgeData)
-     * const distanceAToC = result.distances.get(0)?.get(2) // 5 (A->B->C)
-     * const pathAToC = result.paths.get(0)?.get(2) // [0, 1, 2]
+     * const shortest = { distance: result.distances.get(0)?.get(2), path: result.paths.get(0)?.get(2) }
+     * shortest // => { distance: 5, path: [0, 1, 2] }
      * ```
      *
      * @category algorithms
@@ -4090,7 +3833,7 @@ export declare const floydWarshall: {
      *
      * **Example** (Finding all-pairs shortest paths)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -4103,8 +3846,8 @@ export declare const floydWarshall: {
      * })
      *
      * const result = Graph.floydWarshall(graph, (edgeData) => edgeData)
-     * const distanceAToC = result.distances.get(0)?.get(2) // 5 (A->B->C)
-     * const pathAToC = result.paths.get(0)?.get(2) // [0, 1, 2]
+     * const shortest = { distance: result.distances.get(0)?.get(2), path: result.paths.get(0)?.get(2) }
+     * shortest // => { distance: 5, path: [0, 1, 2] }
      * ```
      *
      * @category algorithms
@@ -4153,8 +3896,8 @@ export interface AstarConfig<E, N> {
  *
  * **Example** (Finding shortest paths with A-star)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<{ x: number; y: number }, number>((mutable) => {
  *   const a = Graph.addNode(mutable, { x: 0, y: 0 })
@@ -4177,10 +3920,7 @@ export interface AstarConfig<E, N> {
  *   heuristic
  * })
  *
- * if (result._tag === "Some") {
- *   console.log(result.value.path) // [0, 1, 2] - shortest path
- *   console.log(result.value.distance) // 2 - total distance
- * }
+ * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([2, [0, 1, 2]])
  * ```
  *
  * @category algorithms
@@ -4201,8 +3941,8 @@ export declare const astar: {
      *
      * **Example** (Finding shortest paths with A-star)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.directed<{ x: number; y: number }, number>((mutable) => {
      *   const a = Graph.addNode(mutable, { x: 0, y: 0 })
@@ -4225,10 +3965,7 @@ export declare const astar: {
      *   heuristic
      * })
      *
-     * if (result._tag === "Some") {
-     *   console.log(result.value.path) // [0, 1, 2] - shortest path
-     *   console.log(result.value.distance) // 2 - total distance
-     * }
+     * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([2, [0, 1, 2]])
      * ```
      *
      * @category algorithms
@@ -4249,8 +3986,8 @@ export declare const astar: {
      *
      * **Example** (Finding shortest paths with A-star)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.directed<{ x: number; y: number }, number>((mutable) => {
      *   const a = Graph.addNode(mutable, { x: 0, y: 0 })
@@ -4273,10 +4010,7 @@ export declare const astar: {
      *   heuristic
      * })
      *
-     * if (result._tag === "Some") {
-     *   console.log(result.value.path) // [0, 1, 2] - shortest path
-     *   console.log(result.value.distance) // 2 - total distance
-     * }
+     * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([2, [0, 1, 2]])
      * ```
      *
      * @category algorithms
@@ -4322,8 +4056,8 @@ export interface BellmanFordConfig<E> {
  *
  * **Example** (Finding shortest paths with Bellman-Ford)
  *
- * ```ts
- * import { Graph } from "effect"
+ * ```ts import.meta.vitest
+ * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
  *   const a = Graph.addNode(mutable, "A")
@@ -4340,10 +4074,7 @@ export interface BellmanFordConfig<E> {
  *   cost: (edgeData) => edgeData
  * })
  *
- * if (result._tag === "Some") {
- *   console.log(result.value.path) // [0, 1, 2] - shortest path A->B->C
- *   console.log(result.value.distance) // 2 - total distance
- * }
+ * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([2, [0, 1, 2]])
  * ```
  *
  * @category algorithms
@@ -4363,8 +4094,8 @@ export declare const bellmanFord: {
      *
      * **Example** (Finding shortest paths with Bellman-Ford)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
      *   const a = Graph.addNode(mutable, "A")
@@ -4381,10 +4112,7 @@ export declare const bellmanFord: {
      *   cost: (edgeData) => edgeData
      * })
      *
-     * if (result._tag === "Some") {
-     *   console.log(result.value.path) // [0, 1, 2] - shortest path A->B->C
-     *   console.log(result.value.distance) // 2 - total distance
-     * }
+     * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([2, [0, 1, 2]])
      * ```
      *
      * @category algorithms
@@ -4404,8 +4132,8 @@ export declare const bellmanFord: {
      *
      * **Example** (Finding shortest paths with Bellman-Ford)
      *
-     * ```ts
-     * import { Graph } from "effect"
+     * ```ts import.meta.vitest
+     * import { Graph, Option } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
      *   const a = Graph.addNode(mutable, "A")
@@ -4422,10 +4150,7 @@ export declare const bellmanFord: {
      *   cost: (edgeData) => edgeData
      * })
      *
-     * if (result._tag === "Some") {
-     *   console.log(result.value.path) // [0, 1, 2] - shortest path A->B->C
-     *   console.log(result.value.distance) // 2 - total distance
-     * }
+     * Option.map(result, ({ distance, path }) => [distance, path] as const) // => Option.some([2, [0, 1, 2]])
      * ```
      *
      * @category algorithms
@@ -4444,7 +4169,7 @@ export declare const bellmanFord: {
  *
  * **Example** (Working with node walkers)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -4463,8 +4188,8 @@ export declare const bellmanFord: {
  * }
  *
  * // Access node data using values() or entries()
- * const nodeData = Array.from(Graph.values(dfsNodes)) // ["A", "B"]
- * const nodeEntries = Array.from(Graph.entries(allNodes)) // [[0, "A"], [1, "B"]]
+ * Array.from(Graph.values(dfsNodes)) // => ["A", "B"]
+ * Array.from(Graph.entries(allNodes)) // => [[0, "A"], [1, "B"]]
  * ```
  *
  * @category models
@@ -4483,7 +4208,7 @@ export declare class Walker<T, N> implements Iterable<[T, N]> {
      *
      * **Example** (Visiting walker elements)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -4495,14 +4220,10 @@ export declare class Walker<T, N> implements Iterable<[T, N]> {
      * const dfs = Graph.dfs(graph, { start: [0] })
      *
      * // Map to just the node data
-     * const values = Array.from(dfs.visit((index, data) => data))
-     * console.log(values) // ["A", "B"]
+     * Array.from(dfs.visit((index, data) => data)) // => ["A", "B"]
      *
      * // Map to custom objects
-     * const custom = Array.from(
-     *   dfs.visit((index, data) => ({ id: index, name: data }))
-     * )
-     * console.log(custom) // [{ id: 0, name: "A" }, { id: 1, name: "B" }]
+     * Array.from(dfs.visit((index, data) => ({ id: index, name: data }))) // => [{ id: 0, name: "A" }, { id: 1, name: "B" }]
      * ```
      *
      * @since 4.0.0
@@ -4518,7 +4239,7 @@ export declare class Walker<T, N> implements Iterable<[T, N]> {
      *
      * **Example** (Visiting walker elements)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -4530,14 +4251,10 @@ export declare class Walker<T, N> implements Iterable<[T, N]> {
      * const dfs = Graph.dfs(graph, { start: [0] })
      *
      * // Map to just the node data
-     * const values = Array.from(dfs.visit((index, data) => data))
-     * console.log(values) // ["A", "B"]
+     * Array.from(dfs.visit((index, data) => data)) // => ["A", "B"]
      *
      * // Map to custom objects
-     * const custom = Array.from(
-     *   dfs.visit((index, data) => ({ id: index, name: data }))
-     * )
-     * console.log(custom) // [{ id: 0, name: "A" }, { id: 1, name: "B" }]
+     * Array.from(dfs.visit((index, data) => ({ id: index, name: data }))) // => [{ id: 0, name: "A" }, { id: 1, name: "B" }]
      * ```
      *
      * @category iterators
@@ -4584,7 +4301,7 @@ export type EdgeWalker<E> = Walker<EdgeIndex, Edge<E>>;
  *
  * **Example** (Iterating walker indices)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -4594,8 +4311,7 @@ export type EdgeWalker<E> = Walker<EdgeIndex, Edge<E>>;
  * })
  *
  * const dfs = Graph.dfs(graph, { start: [0] })
- * const indices = Array.from(Graph.indices(dfs))
- * console.log(indices) // [0, 1]
+ * Array.from(Graph.indices(dfs)) // => [0, 1]
  * ```
  *
  * @category iterators
@@ -4607,7 +4323,7 @@ export declare const indices: <T, N>(walker: Walker<T, N>) => Iterable<T>;
  *
  * **Example** (Iterating walker values)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -4617,8 +4333,7 @@ export declare const indices: <T, N>(walker: Walker<T, N>) => Iterable<T>;
  * })
  *
  * const dfs = Graph.dfs(graph, { start: [0] })
- * const values = Array.from(Graph.values(dfs))
- * console.log(values) // ["A", "B"]
+ * Array.from(Graph.values(dfs)) // => ["A", "B"]
  * ```
  *
  * @category iterators
@@ -4630,7 +4345,7 @@ export declare const values: <T, N>(walker: Walker<T, N>) => Iterable<N>;
  *
  * **Example** (Iterating walker entries)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -4640,8 +4355,7 @@ export declare const values: <T, N>(walker: Walker<T, N>) => Iterable<N>;
  * })
  *
  * const dfs = Graph.dfs(graph, { start: [0] })
- * const entries = Array.from(Graph.entries(dfs))
- * console.log(entries) // [[0, "A"], [1, "B"]]
+ * Array.from(Graph.entries(dfs)) // => [[0, "A"], [1, "B"]]
  * ```
  *
  * @category iterators
@@ -4693,7 +4407,7 @@ export interface SearchConfig {
  *
  * **Example** (Traversing depth-first)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -4705,14 +4419,10 @@ export interface SearchConfig {
  * })
  *
  * // Start from a specific node
- * const dfs1 = Graph.dfs(graph, { start: [0] })
- * for (const nodeIndex of Graph.indices(dfs1)) {
- *   console.log(nodeIndex) // Traverses in DFS order: 0, 1, 2
- * }
+ * Array.from(Graph.indices(Graph.dfs(graph, { start: [0] }))) // => [0, 1, 2]
  *
  * // Empty iterator (no starting nodes)
- * const dfs2 = Graph.dfs(graph)
- * // Can be used programmatically
+ * Graph.dfs(graph)
  * ```
  *
  * @category iterators
@@ -4732,7 +4442,7 @@ export declare const dfs: {
      *
      * **Example** (Traversing depth-first)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -4744,14 +4454,10 @@ export declare const dfs: {
      * })
      *
      * // Start from a specific node
-     * const dfs1 = Graph.dfs(graph, { start: [0] })
-     * for (const nodeIndex of Graph.indices(dfs1)) {
-     *   console.log(nodeIndex) // Traverses in DFS order: 0, 1, 2
-     * }
+     * Array.from(Graph.indices(Graph.dfs(graph, { start: [0] }))) // => [0, 1, 2]
      *
      * // Empty iterator (no starting nodes)
-     * const dfs2 = Graph.dfs(graph)
-     * // Can be used programmatically
+     * Graph.dfs(graph)
      * ```
      *
      * @category iterators
@@ -4771,7 +4477,7 @@ export declare const dfs: {
      *
      * **Example** (Traversing depth-first)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -4783,14 +4489,10 @@ export declare const dfs: {
      * })
      *
      * // Start from a specific node
-     * const dfs1 = Graph.dfs(graph, { start: [0] })
-     * for (const nodeIndex of Graph.indices(dfs1)) {
-     *   console.log(nodeIndex) // Traverses in DFS order: 0, 1, 2
-     * }
+     * Array.from(Graph.indices(Graph.dfs(graph, { start: [0] }))) // => [0, 1, 2]
      *
      * // Empty iterator (no starting nodes)
-     * const dfs2 = Graph.dfs(graph)
-     * // Can be used programmatically
+     * Graph.dfs(graph)
      * ```
      *
      * @category iterators
@@ -4811,7 +4513,7 @@ export declare const dfs: {
  *
  * **Example** (Traversing breadth-first)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -4823,14 +4525,10 @@ export declare const dfs: {
  * })
  *
  * // Start from a specific node
- * const bfs1 = Graph.bfs(graph, { start: [0] })
- * for (const nodeIndex of Graph.indices(bfs1)) {
- *   console.log(nodeIndex) // Traverses in BFS order: 0, 1, 2
- * }
+ * Array.from(Graph.indices(Graph.bfs(graph, { start: [0] }))) // => [0, 1, 2]
  *
  * // Empty iterator (no starting nodes)
- * const bfs2 = Graph.bfs(graph)
- * // Can be used programmatically
+ * Graph.bfs(graph)
  * ```
  *
  * @category iterators
@@ -4850,7 +4548,7 @@ export declare const bfs: {
      *
      * **Example** (Traversing breadth-first)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -4862,14 +4560,10 @@ export declare const bfs: {
      * })
      *
      * // Start from a specific node
-     * const bfs1 = Graph.bfs(graph, { start: [0] })
-     * for (const nodeIndex of Graph.indices(bfs1)) {
-     *   console.log(nodeIndex) // Traverses in BFS order: 0, 1, 2
-     * }
+     * Array.from(Graph.indices(Graph.bfs(graph, { start: [0] }))) // => [0, 1, 2]
      *
      * // Empty iterator (no starting nodes)
-     * const bfs2 = Graph.bfs(graph)
-     * // Can be used programmatically
+     * Graph.bfs(graph)
      * ```
      *
      * @category iterators
@@ -4889,7 +4583,7 @@ export declare const bfs: {
      *
      * **Example** (Traversing breadth-first)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -4901,14 +4595,10 @@ export declare const bfs: {
      * })
      *
      * // Start from a specific node
-     * const bfs1 = Graph.bfs(graph, { start: [0] })
-     * for (const nodeIndex of Graph.indices(bfs1)) {
-     *   console.log(nodeIndex) // Traverses in BFS order: 0, 1, 2
-     * }
+     * Array.from(Graph.indices(Graph.bfs(graph, { start: [0] }))) // => [0, 1, 2]
      *
      * // Empty iterator (no starting nodes)
-     * const bfs2 = Graph.bfs(graph)
-     * // Can be used programmatically
+     * Graph.bfs(graph)
      * ```
      *
      * @category iterators
@@ -4951,7 +4641,7 @@ export interface TopoConfig {
  *
  * **Example** (Sorting topologically)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -4963,13 +4653,10 @@ export interface TopoConfig {
  * })
  *
  * // Standard topological sort
- * const topo1 = Graph.topo(graph)
- * for (const nodeIndex of Graph.indices(topo1)) {
- *   console.log(nodeIndex) // 0, 1, 2 (topological order)
- * }
+ * Array.from(Graph.indices(Graph.topo(graph))) // => [0, 1, 2]
  *
  * // With initial nodes
- * const topo2 = Graph.topo(graph, { initials: [0] })
+ * Graph.topo(graph, { initials: [0] })
  *
  * // Check before sorting a cyclic graph
  * const cyclicGraph = Graph.directed<string, number>((mutable) => {
@@ -4979,9 +4666,7 @@ export interface TopoConfig {
  *   Graph.addEdge(mutable, b, a, 2) // Creates cycle
  * })
  *
- * if (!Graph.isAcyclic(cyclicGraph)) {
- *   console.log("cyclic graph") // cyclic graph
- * }
+ * Graph.isAcyclic(cyclicGraph) // => false
  * ```
  *
  * @category iterators
@@ -4998,7 +4683,7 @@ export declare const topo: {
      *
      * **Example** (Sorting topologically)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -5010,13 +4695,10 @@ export declare const topo: {
      * })
      *
      * // Standard topological sort
-     * const topo1 = Graph.topo(graph)
-     * for (const nodeIndex of Graph.indices(topo1)) {
-     *   console.log(nodeIndex) // 0, 1, 2 (topological order)
-     * }
+     * Array.from(Graph.indices(Graph.topo(graph))) // => [0, 1, 2]
      *
      * // With initial nodes
-     * const topo2 = Graph.topo(graph, { initials: [0] })
+     * Graph.topo(graph, { initials: [0] })
      *
      * // Check before sorting a cyclic graph
      * const cyclicGraph = Graph.directed<string, number>((mutable) => {
@@ -5026,9 +4708,7 @@ export declare const topo: {
      *   Graph.addEdge(mutable, b, a, 2) // Creates cycle
      * })
      *
-     * if (!Graph.isAcyclic(cyclicGraph)) {
-     *   console.log("cyclic graph") // cyclic graph
-     * }
+     * Graph.isAcyclic(cyclicGraph) // => false
      * ```
      *
      * @category iterators
@@ -5045,7 +4725,7 @@ export declare const topo: {
      *
      * **Example** (Sorting topologically)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -5057,13 +4737,10 @@ export declare const topo: {
      * })
      *
      * // Standard topological sort
-     * const topo1 = Graph.topo(graph)
-     * for (const nodeIndex of Graph.indices(topo1)) {
-     *   console.log(nodeIndex) // 0, 1, 2 (topological order)
-     * }
+     * Array.from(Graph.indices(Graph.topo(graph))) // => [0, 1, 2]
      *
      * // With initial nodes
-     * const topo2 = Graph.topo(graph, { initials: [0] })
+     * Graph.topo(graph, { initials: [0] })
      *
      * // Check before sorting a cyclic graph
      * const cyclicGraph = Graph.directed<string, number>((mutable) => {
@@ -5073,9 +4750,7 @@ export declare const topo: {
      *   Graph.addEdge(mutable, b, a, 2) // Creates cycle
      * })
      *
-     * if (!Graph.isAcyclic(cyclicGraph)) {
-     *   console.log("cyclic graph") // cyclic graph
-     * }
+     * Graph.isAcyclic(cyclicGraph) // => false
      * ```
      *
      * @category iterators
@@ -5102,7 +4777,7 @@ export declare const topo: {
  *
  * **Example** (Traversing in postorder)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -5114,10 +4789,7 @@ export declare const topo: {
  * })
  *
  * // Postorder: children before parents
- * const postOrder = Graph.dfsPostOrder(graph, { start: [0] })
- * for (const node of postOrder) {
- *   console.log(node) // 1, 2, 0
- * }
+ * Array.from(Graph.indices(Graph.dfsPostOrder(graph, { start: [0] }))) // => [1, 2, 0]
  * ```
  *
  * @category iterators
@@ -5143,7 +4815,7 @@ export declare const dfsPostOrder: {
      *
      * **Example** (Traversing in postorder)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -5155,10 +4827,7 @@ export declare const dfsPostOrder: {
      * })
      *
      * // Postorder: children before parents
-     * const postOrder = Graph.dfsPostOrder(graph, { start: [0] })
-     * for (const node of postOrder) {
-     *   console.log(node) // 1, 2, 0
-     * }
+     * Array.from(Graph.indices(Graph.dfsPostOrder(graph, { start: [0] }))) // => [1, 2, 0]
      * ```
      *
      * @category iterators
@@ -5184,7 +4853,7 @@ export declare const dfsPostOrder: {
      *
      * **Example** (Traversing in postorder)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -5196,10 +4865,7 @@ export declare const dfsPostOrder: {
      * })
      *
      * // Postorder: children before parents
-     * const postOrder = Graph.dfsPostOrder(graph, { start: [0] })
-     * for (const node of postOrder) {
-     *   console.log(node) // 1, 2, 0
-     * }
+     * Array.from(Graph.indices(Graph.dfsPostOrder(graph, { start: [0] }))) // => [1, 2, 0]
      * ```
      *
      * @category iterators
@@ -5217,7 +4883,7 @@ export declare const dfsPostOrder: {
  *
  * **Example** (Iterating all nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -5227,8 +4893,7 @@ export declare const dfsPostOrder: {
  *   Graph.addEdge(mutable, a, b, 1)
  * })
  *
- * const indices = Array.from(Graph.indices(Graph.nodes(graph)))
- * console.log(indices) // [0, 1, 2]
+ * Array.from(Graph.indices(Graph.nodes(graph))) // => [0, 1, 2]
  * ```
  *
  * @category iterators
@@ -5245,7 +4910,7 @@ export declare const nodes: <N, E, T extends Kind = "directed">(graph: Graph<N,
  *
  * **Example** (Iterating all edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -5256,8 +4921,7 @@ export declare const nodes: <N, E, T extends Kind = "directed">(graph: Graph<N,
  *   Graph.addEdge(mutable, b, c, 2)
  * })
  *
- * const indices = Array.from(Graph.indices(Graph.edges(graph)))
- * console.log(indices) // [0, 1]
+ * Array.from(Graph.indices(Graph.edges(graph))) // => [0, 1]
  * ```
  *
  * @category iterators
@@ -5298,7 +4962,7 @@ export interface ExternalsConfig {
  *
  * **Example** (Iterating external nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -5312,16 +4976,10 @@ export interface ExternalsConfig {
  * })
  *
  * // Nodes with no outgoing edges (sinks + isolated)
- * const sinks = Array.from(
- *   Graph.indices(Graph.externals(graph, { direction: "outgoing" }))
- * )
- * console.log(sinks) // [2, 3]
+ * Array.from(Graph.indices(Graph.externals(graph, { direction: "outgoing" }))) // => [2, 3]
  *
  * // Nodes with no incoming edges (sources + isolated)
- * const sources = Array.from(
- *   Graph.indices(Graph.externals(graph, { direction: "incoming" }))
- * )
- * console.log(sources) // [0, 3]
+ * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
  * ```
  *
  * @category iterators
@@ -5339,7 +4997,7 @@ export declare const externals: {
      *
      * **Example** (Iterating external nodes)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -5353,16 +5011,10 @@ export declare const externals: {
      * })
      *
      * // Nodes with no outgoing edges (sinks + isolated)
-     * const sinks = Array.from(
-     *   Graph.indices(Graph.externals(graph, { direction: "outgoing" }))
-     * )
-     * console.log(sinks) // [2, 3]
+     * Array.from(Graph.indices(Graph.externals(graph, { direction: "outgoing" }))) // => [2, 3]
      *
      * // Nodes with no incoming edges (sources + isolated)
-     * const sources = Array.from(
-     *   Graph.indices(Graph.externals(graph, { direction: "incoming" }))
-     * )
-     * console.log(sources) // [0, 3]
+     * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
      * ```
      *
      * @category iterators
@@ -5380,7 +5032,7 @@ export declare const externals: {
      *
      * **Example** (Iterating external nodes)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const graph = Graph.directed<string, number>((mutable) => {
@@ -5394,16 +5046,10 @@ export declare const externals: {
      * })
      *
      * // Nodes with no outgoing edges (sinks + isolated)
-     * const sinks = Array.from(
-     *   Graph.indices(Graph.externals(graph, { direction: "outgoing" }))
-     * )
-     * console.log(sinks) // [2, 3]
+     * Array.from(Graph.indices(Graph.externals(graph, { direction: "outgoing" }))) // => [2, 3]
      *
      * // Nodes with no incoming edges (sources + isolated)
-     * const sources = Array.from(
-     *   Graph.indices(Graph.externals(graph, { direction: "incoming" }))
-     * )
-     * console.log(sources) // [0, 3]
+     * Array.from(Graph.indices(Graph.externals(graph, { direction: "incoming" }))) // => [0, 3]
      * ```
      *
      * @category iterators