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

package/src/Graph.ts

@@ -482,7 +482,7 @@ export const isGraph = <N = unknown, E = unknown, T extends Kind = Kind, U = nev
  *
  * **Example** (Constructing by kind)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const makeGraph = Graph.make("directed")
@@ -490,7 +490,7 @@ export const isGraph = <N = unknown, E = unknown, T extends Kind = Kind, U = nev
  *   Graph.addNode(mutable, "A")
  * })
  *
- * console.log(graph.type) // "directed"
+ * graph.type // => "directed"
  * ```
  *
  * @see {@link directed} for constructing a directed graph directly
@@ -525,7 +525,7 @@ export const make =
  *
  * **Example** (Creating a directed graph)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Directed graph with initial nodes and edges
@@ -536,6 +536,7 @@ export const make =
  *   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
@@ -550,7 +551,7 @@ export const directed: <N, E>(
  *
  * **Example** (Creating an undirected graph)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Undirected graph with initial nodes and edges
@@ -561,6 +562,7 @@ export const directed: <N, E>(
  *   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
@@ -579,12 +581,13 @@ export const undirected: <N, E>(
  *
  * **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
@@ -621,13 +624,13 @@ export const beginMutation = <N, E, T extends Kind = "directed">(
  *
  * **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
@@ -673,7 +676,7 @@ const mutateScoped = <N, E, T extends Kind>(
  *
  * **Example** (Applying scoped mutations)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>()
@@ -683,8 +686,8 @@ const mutateScoped = <N, E, T extends Kind>(
  *   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
@@ -696,7 +699,7 @@ export const mutate: {
    *
    * **Example** (Applying scoped mutations)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>()
@@ -706,8 +709,8 @@ export 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
@@ -719,7 +722,7 @@ export const mutate: {
    *
    * **Example** (Applying scoped mutations)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>()
@@ -729,8 +732,8 @@ export 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
@@ -914,7 +917,7 @@ const assertSameKind = <N, E>(self: Graph<N, E, Kind>, that: Graph<N, E, Kind>):
  *
  * **Example** (Combining graphs)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -933,8 +936,8 @@ const assertSameKind = <N, E>(self: Graph<N, E, Kind>, that: Graph<N, E, Kind>):
  *   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
@@ -962,7 +965,7 @@ export const compose: {
    *
    * **Example** (Combining graphs)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -981,8 +984,8 @@ export 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
@@ -1010,7 +1013,7 @@ export const compose: {
    *
    * **Example** (Combining graphs)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -1029,8 +1032,8 @@ export 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
@@ -1074,7 +1077,7 @@ export const compose: {
      *
      * **Example** (Combining graphs)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -1093,8 +1096,8 @@ export 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
@@ -1121,7 +1124,7 @@ export const compose: {
      *
      * **Example** (Combining graphs)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -1140,8 +1143,8 @@ export 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
@@ -1182,7 +1185,7 @@ export const compose: {
      *
      * **Example** (Combining graphs)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -1201,8 +1204,8 @@ export 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
@@ -1229,7 +1232,7 @@ export const compose: {
      *
      * **Example** (Combining graphs)
      *
-     * ```ts
+     * ```ts import.meta.vitest
      * import { Graph } from "effect"
      *
      * const left = Graph.directed<{ id: string }, string>((mutable) => {
@@ -1248,8 +1251,8 @@ export 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
@@ -1285,7 +1288,7 @@ export const compose: {
  *
  * **Example** (Finding shared structure)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const left = Graph.directed<string, string>((mutable) => {
@@ -1302,8 +1305,8 @@ export 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
@@ -1330,7 +1333,7 @@ export const intersection: {
    *
    * **Example** (Finding shared structure)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1347,8 +1350,8 @@ export 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
@@ -1375,7 +1378,7 @@ export const intersection: {
    *
    * **Example** (Finding shared structure)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1392,8 +1395,8 @@ export 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
@@ -1435,7 +1438,7 @@ export const intersection: {
    *
    * **Example** (Finding shared structure)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1452,8 +1455,8 @@ export 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
@@ -1479,7 +1482,7 @@ export const intersection: {
    *
    * **Example** (Finding shared structure)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1496,8 +1499,8 @@ export 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
@@ -1525,7 +1528,7 @@ export const intersection: {
    *
    * **Example** (Finding shared structure)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1542,8 +1545,8 @@ export 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
@@ -1569,7 +1572,7 @@ export const intersection: {
    *
    * **Example** (Finding shared structure)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1586,8 +1589,8 @@ export 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
@@ -1630,7 +1633,7 @@ export const intersection: {
    *
    * **Example** (Finding shared structure)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1647,8 +1650,8 @@ export 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
@@ -1674,7 +1677,7 @@ export const intersection: {
    *
    * **Example** (Finding shared structure)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1691,8 +1694,8 @@ export 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
@@ -1730,7 +1733,7 @@ export const intersection: {
  *
  * **Example** (Removing shared edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const left = Graph.directed<string, string>((mutable) => {
@@ -1749,8 +1752,8 @@ export 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
@@ -1778,7 +1781,7 @@ export const difference: {
    *
    * **Example** (Removing shared edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1797,8 +1800,8 @@ export 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
@@ -1826,7 +1829,7 @@ export const difference: {
    *
    * **Example** (Removing shared edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1845,8 +1848,8 @@ export 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
@@ -1891,7 +1894,7 @@ export const difference: {
    *
    * **Example** (Removing shared edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1910,8 +1913,8 @@ export 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
@@ -1938,7 +1941,7 @@ export const difference: {
    *
    * **Example** (Removing shared edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -1957,8 +1960,8 @@ export 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
@@ -2001,7 +2004,7 @@ export const difference: {
  *
  * **Example** (Finding differing edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const left = Graph.directed<string, string>((mutable) => {
@@ -2022,8 +2025,8 @@ export 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
@@ -2053,7 +2056,7 @@ export const symmetricDifference: {
    *
    * **Example** (Finding differing edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -2074,8 +2077,8 @@ export 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
@@ -2105,7 +2108,7 @@ export const symmetricDifference: {
    *
    * **Example** (Finding differing edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -2126,8 +2129,8 @@ export 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
@@ -2171,7 +2174,7 @@ export const symmetricDifference: {
    *
    * **Example** (Finding differing edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -2192,8 +2195,8 @@ export 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
@@ -2222,7 +2225,7 @@ export const symmetricDifference: {
    *
    * **Example** (Finding differing edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -2243,8 +2246,8 @@ export 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
@@ -2285,7 +2288,7 @@ export const symmetricDifference: {
    *
    * **Example** (Finding differing edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -2306,8 +2309,8 @@ export 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
@@ -2336,7 +2339,7 @@ export const symmetricDifference: {
    *
    * **Example** (Finding differing edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const left = Graph.directed<string, string>((mutable) => {
@@ -2357,8 +2360,8 @@ export 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
@@ -2394,7 +2397,7 @@ export const symmetricDifference: {
  *
  * **Example** (Finding missing relationships)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, string>((mutable) => {
@@ -2405,7 +2408,7 @@ export const symmetricDifference: {
  *
  * const result = Graph.complement(graph, (source, target) => `${source}-${target}`)
  *
- * console.log(Graph.edgeCount(result)) // 1
+ * Graph.edgeCount(result) // => 1
  * ```
  *
  * @category set operations
@@ -2425,7 +2428,7 @@ export const complement: {
    *
    * **Example** (Finding missing relationships)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -2436,7 +2439,7 @@ export const complement: {
    *
    * const result = Graph.complement(graph, (source, target) => `${source}-${target}`)
    *
-   * console.log(Graph.edgeCount(result)) // 1
+   * Graph.edgeCount(result) // => 1
    * ```
    *
    * @category set operations
@@ -2456,7 +2459,7 @@ export const complement: {
    *
    * **Example** (Finding missing relationships)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -2467,7 +2470,7 @@ export const complement: {
    *
    * const result = Graph.complement(graph, (source, target) => `${source}-${target}`)
    *
-   * console.log(Graph.edgeCount(result)) // 1
+   * Graph.edgeCount(result) // => 1
    * ```
    *
    * @category set operations
@@ -2494,7 +2497,7 @@ export const complement: {
    *
    * **Example** (Finding missing relationships)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -2505,7 +2508,7 @@ export const complement: {
    *
    * const result = Graph.complement(graph, (source, target) => `${source}-${target}`)
    *
-   * console.log(Graph.edgeCount(result)) // 1
+   * Graph.edgeCount(result) // => 1
    * ```
    *
    * @category set operations
@@ -2524,7 +2527,7 @@ export const complement: {
    *
    * **Example** (Finding missing relationships)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -2535,7 +2538,7 @@ export const complement: {
    *
    * const result = Graph.complement(graph, (source, target) => `${source}-${target}`)
    *
-   * console.log(Graph.edgeCount(result)) // 1
+   * Graph.edgeCount(result) // => 1
    * ```
    *
    * @category set operations
@@ -2598,7 +2601,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) => {
@@ -2611,7 +2614,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
@@ -2631,7 +2634,7 @@ export const neighborhood: {
    *
    * **Example** (Getting a local neighborhood)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -2644,7 +2647,7 @@ export const neighborhood: {
    *
    * const result = Graph.neighborhood(graph, 1, { radius: 1 })
    *
-   * console.log(Graph.nodeCount(result)) // 2
+   * Graph.nodeCount(result) // => 2
    * ```
    *
    * @category set operations
@@ -2664,7 +2667,7 @@ export const neighborhood: {
    *
    * **Example** (Getting a local neighborhood)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -2677,7 +2680,7 @@ export const neighborhood: {
    *
    * const result = Graph.neighborhood(graph, 1, { radius: 1 })
    *
-   * console.log(Graph.nodeCount(result)) // 2
+   * Graph.nodeCount(result) // => 2
    * ```
    *
    * @category set operations
@@ -2711,7 +2714,7 @@ export const neighborhood: {
    *
    * **Example** (Getting a local neighborhood)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -2724,7 +2727,7 @@ export const neighborhood: {
    *
    * const result = Graph.neighborhood(graph, 1, { radius: 1 })
    *
-   * console.log(Graph.nodeCount(result)) // 2
+   * Graph.nodeCount(result) // => 2
    * ```
    *
    * @category set operations
@@ -2743,7 +2746,7 @@ export const neighborhood: {
    *
    * **Example** (Getting a local neighborhood)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -2756,7 +2759,7 @@ export const neighborhood: {
    *
    * const result = Graph.neighborhood(graph, 1, { radius: 1 })
    *
-   * console.log(Graph.nodeCount(result)) // 2
+   * Graph.nodeCount(result) // => 2
    * ```
    *
    * @category set operations
@@ -2903,14 +2906,12 @@ export 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
  * })
  * ```
  *
@@ -2948,19 +2949,14 @@ export const addNode = <N, E, T extends Kind = "directed">(
  *
  * **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
@@ -2972,19 +2968,14 @@ export 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
@@ -2998,19 +2989,14 @@ export 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
@@ -3030,20 +3016,15 @@ export 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
@@ -3055,20 +3036,15 @@ export 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
@@ -3080,20 +3056,15 @@ export 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
@@ -3110,11 +3081,11 @@ export 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")
@@ -3122,7 +3093,7 @@ export const hasNode: {
  *   Graph.addNode(mutable, "Node C")
  * })
  *
- * console.log(Graph.nodeCount(graphWithNodes)) // 3
+ * Graph.nodeCount(graphWithNodes) // => 3
  * ```
  *
  * @category getters
@@ -3137,8 +3108,8 @@ export const nodeCount = <N, E, T extends Kind = "directed">(
  *
  * **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")
@@ -3146,11 +3117,8 @@ export const nodeCount = <N, E, T extends Kind = "directed">(
  *   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
@@ -3162,8 +3130,8 @@ export 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")
@@ -3171,11 +3139,8 @@ export 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
@@ -3187,8 +3152,8 @@ export 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")
@@ -3196,11 +3161,8 @@ export 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
@@ -3228,7 +3190,7 @@ export const findNode: {
  *
  * **Example** (Finding matching nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -3237,11 +3199,8 @@ export 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
@@ -3253,7 +3212,7 @@ export const findNodes: {
    *
    * **Example** (Finding matching nodes)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -3262,11 +3221,8 @@ export 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
@@ -3278,7 +3234,7 @@ export const findNodes: {
    *
    * **Example** (Finding matching nodes)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -3287,11 +3243,8 @@ export 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
@@ -3320,8 +3273,8 @@ export 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")
@@ -3331,11 +3284,8 @@ export 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
@@ -3347,8 +3297,8 @@ export 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")
@@ -3358,11 +3308,8 @@ export 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
@@ -3374,8 +3321,8 @@ export 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")
@@ -3385,11 +3332,8 @@ export 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
@@ -3417,7 +3361,7 @@ export const findEdge: {
  *
  * **Example** (Finding matching edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -3429,11 +3373,8 @@ export 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
@@ -3445,7 +3386,7 @@ export const findEdges: {
    *
    * **Example** (Finding matching edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -3457,11 +3398,8 @@ export 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
@@ -3473,7 +3411,7 @@ export const findEdges: {
    *
    * **Example** (Finding matching edges)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -3485,11 +3423,8 @@ export 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
@@ -3518,8 +3453,8 @@ export 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")
@@ -3527,8 +3462,7 @@ export 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
@@ -3556,8 +3490,8 @@ export const updateNode = <N, E, T extends Kind = "directed">(
  *
  * **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")
@@ -3566,8 +3500,7 @@ export const updateNode = <N, E, T extends Kind = "directed">(
  *   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
@@ -3600,8 +3533,8 @@ export const updateEdge = <N, E, T extends Kind = "directed">(
  *
  * **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")
@@ -3610,8 +3543,7 @@ export const updateEdge = <N, E, T extends Kind = "directed">(
  *   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
@@ -3636,8 +3568,8 @@ export const mapNodes = <N, E, T extends Kind = "directed">(
  *
  * **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")
@@ -3648,8 +3580,7 @@ export const mapNodes = <N, E, T extends Kind = "directed">(
  *   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
@@ -3705,8 +3636,8 @@ const rebuildAdjacency = <N, E, T extends Kind = "directed">(
  *
  * **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")
@@ -3717,8 +3648,7 @@ const rebuildAdjacency = <N, E, T extends Kind = "directed">(
  *   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
@@ -3758,7 +3688,7 @@ export const reverse = <N, E, T extends Kind = "directed">(
  *
  * **Example** (Filtering and mapping nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -3776,7 +3706,7 @@ export const reverse = <N, E, T extends Kind = "directed">(
  *   )
  * })
  *
- * console.log(Graph.nodeCount(graph)) // 2 (only "active" nodes remain)
+ * Graph.nodeCount(graph) // => 2
  * ```
  *
  * @category transforming
@@ -3815,7 +3745,7 @@ export const filterMapNodes = <N, E, T extends Kind = "directed">(
  *
  * **Example** (Filtering and mapping edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph, Option } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -3833,7 +3763,7 @@ export const filterMapNodes = <N, E, T extends Kind = "directed">(
  *   )
  * })
  *
- * console.log(Graph.edgeCount(graph)) // 2 (edges with weight 5 removed)
+ * Graph.edgeCount(graph) // => 2
  * ```
  *
  * @category transforming
@@ -3878,7 +3808,7 @@ export const filterMapEdges = <N, E, T extends Kind = "directed">(
  *
  * **Example** (Filtering nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -3891,7 +3821,7 @@ export const filterMapEdges = <N, E, T extends Kind = "directed">(
  *   Graph.filterNodes(mutable, (data) => data === "active")
  * })
  *
- * console.log(Graph.nodeCount(graph)) // 2 (only "active" nodes remain)
+ * Graph.nodeCount(graph) // => 2
  * ```
  *
  * @category transforming
@@ -3925,7 +3855,7 @@ export const filterNodes = <N, E, T extends Kind = "directed">(
  *
  * **Example** (Filtering edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -3941,7 +3871,7 @@ export const filterNodes = <N, E, T extends Kind = "directed">(
  *   Graph.filterEdges(mutable, (data) => data >= 10)
  * })
  *
- * console.log(Graph.edgeCount(graph)) // 2 (edge with weight 5 removed)
+ * Graph.edgeCount(graph) // => 2
  * ```
  *
  * @category transforming
@@ -4018,14 +3948,13 @@ const invalidateCycleFlagOnAddition = <N, E, T extends Kind = "directed">(
  *
  * **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
  * })
  * ```
  *
@@ -4099,7 +4028,7 @@ export const addEdge = <N, E, T extends Kind = "directed">(
  *
  * **Example** (Removing a node)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const result = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -4110,6 +4039,7 @@ export const addEdge = <N, E, T extends Kind = "directed">(
  *   // Remove nodeA and all edges connected to it
  *   Graph.removeNode(mutable, nodeA)
  * })
+ * Array.of(Graph.nodeCount(result), Graph.edgeCount(result)) // => [1, 0]
  * ```
  *
  * @category mutations
@@ -4166,7 +4096,7 @@ export const removeNode = <N, E, T extends Kind = "directed">(
  *
  * **Example** (Removing an edge)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const result = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -4177,6 +4107,7 @@ export const removeNode = <N, E, T extends Kind = "directed">(
  *   // Remove the edge
  *   Graph.removeEdge(mutable, edge)
  * })
+ * Array.of(Graph.nodeCount(result), Graph.edgeCount(result)) // => [2, 0]
  * ```
  *
  * @category mutations
@@ -4262,8 +4193,8 @@ const removeEdgeInternal = <N, E, T extends Kind = "directed">(
  *
  * **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")
@@ -4271,14 +4202,7 @@ const removeEdgeInternal = <N, E, T extends Kind = "directed">(
  *   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
@@ -4294,8 +4218,8 @@ export 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")
@@ -4303,14 +4227,7 @@ export 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
@@ -4328,8 +4245,8 @@ export 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")
@@ -4337,14 +4254,7 @@ export 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
@@ -4361,7 +4271,7 @@ export const getEdge: {
  *
  * **Example** (Checking edge existence)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -4371,15 +4281,8 @@ export 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
@@ -4391,7 +4294,7 @@ export const hasEdge: {
    *
    * **Example** (Checking edge existence)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -4401,15 +4304,8 @@ export 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
@@ -4421,7 +4317,7 @@ export const hasEdge: {
    *
    * **Example** (Checking edge existence)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -4431,15 +4327,8 @@ export 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
@@ -4480,11 +4369,11 @@ export 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")
@@ -4495,7 +4384,7 @@ export const hasEdge: {
  *   Graph.addEdge(mutable, nodeC, nodeA, 3)
  * })
  *
- * console.log(Graph.edgeCount(graphWithEdges)) // 3
+ * Graph.edgeCount(graphWithEdges) // => 3
  * ```
  *
  * @category getters
@@ -4541,7 +4430,7 @@ const getDirectedNeighbors = <N, E>(
  *
  * **Example** (Getting outgoing neighbors)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -4552,15 +4441,8 @@ const getDirectedNeighbors = <N, E>(
  *   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
@@ -4577,7 +4459,7 @@ export const neighbors: {
    *
    * **Example** (Getting outgoing neighbors)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -4588,15 +4470,8 @@ export 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
@@ -4613,7 +4488,7 @@ export const neighbors: {
    *
    * **Example** (Getting outgoing neighbors)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -4624,15 +4499,8 @@ export 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
@@ -4666,7 +4534,7 @@ export 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 const successors: {
@@ -4685,7 +4553,7 @@ export 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>
@@ -4704,7 +4572,7 @@ export 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>(
@@ -4736,7 +4604,7 @@ export 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 const predecessors: {
@@ -4755,7 +4623,7 @@ export 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>
@@ -4774,7 +4642,7 @@ export 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>(
@@ -4805,7 +4673,7 @@ export const predecessors: {
  *
  * **Example** (Traversing directed neighbors)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, string>((mutable) => {
@@ -4822,12 +4690,13 @@ export 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 const neighborsDirected: {
@@ -4845,7 +4714,7 @@ export const neighborsDirected: {
    *
    * **Example** (Traversing directed neighbors)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -4862,12 +4731,13 @@ export 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>
@@ -4885,7 +4755,7 @@ export const neighborsDirected: {
    *
    * **Example** (Traversing directed neighbors)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, string>((mutable) => {
@@ -4902,12 +4772,13 @@ export 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>(
@@ -4940,7 +4811,7 @@ export const neighborsDirected: {
  *
  * **Example** (Configuring GraphViz labels)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Basic options with custom labels
@@ -4955,6 +4826,7 @@ export const neighborsDirected: {
  *   edgeLabel: (data) => data,
  *   graphName: "MyDependencyGraph"
  * }
+ * Array.of(basicOptions.nodeLabel?.("A"), namedOptions.graphName) // => ["Node: A", "MyDependencyGraph"]
  * ```
  *
  * @category options
@@ -4988,7 +4860,7 @@ const escapeGraphVizString = (value: string): string =>
  *
  * **Example** (Exporting GraphViz DOT)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -5000,16 +4872,7 @@ const escapeGraphVizString = (value: string): string =>
  *   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
@@ -5021,7 +4884,7 @@ export const toGraphViz: {
    *
    * **Example** (Exporting GraphViz DOT)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -5033,16 +4896,7 @@ export 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
@@ -5054,7 +4908,7 @@ export const toGraphViz: {
    *
    * **Example** (Exporting GraphViz DOT)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.mutate(Graph.directed<string, number>(), (mutable) => {
@@ -5066,16 +4920,7 @@ export 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
@@ -5141,7 +4986,7 @@ export const toGraphViz: {
  *
  * **Example** (Selecting Mermaid node shapes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Shape selector function for different node types
@@ -5156,6 +5001,7 @@ export const toGraphViz: {
  * const options: Graph.MermaidOptions<string, string> = {
  *   nodeShape: shapeSelector
  * }
+ * options.nodeShape?.("decision") // => "diamond"
  * ```
  *
  * @category models
@@ -5184,7 +5030,7 @@ export type MermaidNodeShape =
  *
  * **Example** (Configuring Mermaid directions)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Horizontal workflow diagram
@@ -5201,6 +5047,7 @@ export type MermaidNodeShape =
  * const bottomUpOptions: Graph.MermaidOptions<string, string> = {
  *   direction: "BT"
  * }
+ * Array.of(horizontalOptions.direction, verticalOptions.direction, bottomUpOptions.direction) // => ["LR", "TB", "BT"]
  * ```
  *
  * @category models
@@ -5227,7 +5074,7 @@ export type MermaidDirection =
  *
  * **Example** (Selecting Mermaid diagram types)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Force flowchart format (even for undirected graphs)
@@ -5242,6 +5089,7 @@ export type MermaidDirection =
  *
  * // Auto-detection (recommended, default behavior)
  * const autoOptions: Graph.MermaidOptions<string, string> = {}
+ * Array.of(flowchartOptions.diagramType, graphOptions.diagramType, autoOptions.diagramType) // => ["flowchart", "graph", undefined]
  * ```
  *
  * @category models
@@ -5267,7 +5115,7 @@ export type MermaidDiagramType =
  *
  * **Example** (Configuring Mermaid output)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import type { Graph } from "effect"
  *
  * // Basic options with custom labels
@@ -5284,6 +5132,7 @@ export type MermaidDiagramType =
  *   direction: "LR",
  *   nodeShape: (data) => data.includes("start") ? "circle" : "rectangle"
  * }
+ * Array.of(basicOptions.nodeLabel?.("A"), advancedOptions.nodeShape?.("start")) // => ["Node: A", "circle"]
  * ```
  *
  * @category options
@@ -5387,7 +5236,7 @@ const formatMermaidNode = (
  *
  * **Example** (Exporting a directed Mermaid diagram)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Basic directed graph export
@@ -5399,19 +5248,12 @@ const formatMermaidNode = (
  *   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
@@ -5428,18 +5270,12 @@ const formatMermaidNode = (
  *   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
@@ -5478,20 +5314,12 @@ const formatMermaidNode = (
  *     }
  *   }
  * })
- * 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
@@ -5540,15 +5368,7 @@ const formatMermaidNode = (
  *   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
@@ -5567,7 +5387,7 @@ export const toMermaid: {
    *
    * **Example** (Exporting a directed Mermaid diagram)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * // Basic directed graph export
@@ -5579,19 +5399,12 @@ export 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
@@ -5608,18 +5421,12 @@ export 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
@@ -5658,20 +5465,12 @@ export 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
@@ -5720,15 +5519,7 @@ export 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
@@ -5747,7 +5538,7 @@ export const toMermaid: {
    *
    * **Example** (Exporting a directed Mermaid diagram)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * // Basic directed graph export
@@ -5759,19 +5550,12 @@ export 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
@@ -5788,18 +5572,12 @@ export 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
@@ -5838,20 +5616,12 @@ export 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
@@ -5900,15 +5670,7 @@ export 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
@@ -5994,7 +5756,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) => {
@@ -6005,17 +5767,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
@@ -6039,7 +5793,7 @@ export type TraversalDirection = Direction | "undirected"
  *
  * **Example** (Checking cycles)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Acyclic directed graph (DAG)
@@ -6050,7 +5804,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) => {
@@ -6059,7 +5813,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
@@ -6199,7 +5953,7 @@ export const isAcyclic = <N, E, T extends Kind = "directed">(
  *
  * **Example** (Checking bipartite graphs)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * // Bipartite graph (alternating coloring possible)
@@ -6212,7 +5966,7 @@ export const isAcyclic = <N, E, T extends Kind = "directed">(
  *   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) => {
@@ -6223,7 +5977,7 @@ export const isAcyclic = <N, E, T extends Kind = "directed">(
  *   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
@@ -6336,7 +6090,7 @@ const getTraversableNeighbor = <N, E, T extends Kind>(
  *
  * **Example** (Finding connected components)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.undirected<string, string>((mutable) => {
@@ -6348,8 +6102,7 @@ const getTraversableNeighbor = <N, E, T extends Kind>(
  *   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
@@ -6400,7 +6153,7 @@ export const connectedComponents = <N, E>(
  *
  * **Example** (Finding strongly connected components)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, string>((mutable) => {
@@ -6412,8 +6165,7 @@ export const connectedComponents = <N, E>(
  *   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
@@ -6646,8 +6398,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")
@@ -6664,10 +6416,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
@@ -6687,8 +6436,8 @@ export 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")
@@ -6705,10 +6454,7 @@ export 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
@@ -6728,8 +6474,8 @@ export 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")
@@ -6746,10 +6492,7 @@ export 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
@@ -6917,7 +6660,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) => {
@@ -6930,8 +6673,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
@@ -6951,7 +6694,7 @@ export const floydWarshall: {
    *
    * **Example** (Finding all-pairs shortest paths)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -6964,8 +6707,8 @@ export 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
@@ -6985,7 +6728,7 @@ export const floydWarshall: {
    *
    * **Example** (Finding all-pairs shortest paths)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -6998,8 +6741,8 @@ export 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
@@ -7176,8 +6919,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 })
@@ -7200,10 +6943,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
@@ -7224,8 +6964,8 @@ export 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 })
@@ -7248,10 +6988,7 @@ export 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
@@ -7272,8 +7009,8 @@ export 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 })
@@ -7296,10 +7033,7 @@ export 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
@@ -7495,8 +7229,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")
@@ -7513,10 +7247,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
@@ -7536,8 +7267,8 @@ export 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")
@@ -7554,10 +7285,7 @@ export 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
@@ -7577,8 +7305,8 @@ export 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")
@@ -7595,10 +7323,7 @@ export 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
@@ -7745,7 +7470,7 @@ export const bellmanFord: {
  *
  * **Example** (Working with node walkers)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -7764,8 +7489,8 @@ export 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
@@ -7786,7 +7511,7 @@ export 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) => {
@@ -7798,14 +7523,10 @@ export 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
@@ -7822,7 +7543,7 @@ export 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) => {
@@ -7834,14 +7555,10 @@ export 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
@@ -7895,7 +7612,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) => {
@@ -7905,8 +7622,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
@@ -7919,7 +7635,7 @@ export const indices = <T, N>(walker: Walker<T, N>): Iterable<T> => walker.visit
  *
  * **Example** (Iterating walker values)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -7929,8 +7645,7 @@ export const indices = <T, N>(walker: Walker<T, N>): Iterable<T> => walker.visit
  * })
  *
  * 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
@@ -7943,7 +7658,7 @@ export const values = <T, N>(walker: Walker<T, N>): Iterable<N> => walker.visit(
  *
  * **Example** (Iterating walker entries)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -7953,8 +7668,7 @@ export const values = <T, N>(walker: Walker<T, N>): Iterable<N> => walker.visit(
  * })
  *
  * 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
@@ -8009,7 +7723,7 @@ export interface SearchConfig {
  *
  * **Example** (Traversing depth-first)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -8021,14 +7735,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
@@ -8048,7 +7758,7 @@ export const dfs: {
    *
    * **Example** (Traversing depth-first)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -8060,14 +7770,10 @@ export 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
@@ -8087,7 +7793,7 @@ export const dfs: {
    *
    * **Example** (Traversing depth-first)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -8099,14 +7805,10 @@ export 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
@@ -8217,7 +7919,7 @@ export const dfs: {
  *
  * **Example** (Traversing breadth-first)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -8229,14 +7931,10 @@ export 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
@@ -8256,7 +7954,7 @@ export const bfs: {
    *
    * **Example** (Traversing breadth-first)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -8268,14 +7966,10 @@ export 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
@@ -8295,7 +7989,7 @@ export const bfs: {
    *
    * **Example** (Traversing breadth-first)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -8307,14 +8001,10 @@ export 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
@@ -8409,7 +8099,7 @@ export interface TopoConfig {
  *
  * **Example** (Sorting topologically)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -8421,13 +8111,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) => {
@@ -8437,9 +8124,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
@@ -8456,7 +8141,7 @@ export const topo: {
    *
    * **Example** (Sorting topologically)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -8468,13 +8153,10 @@ export 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) => {
@@ -8484,9 +8166,7 @@ export 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
@@ -8503,7 +8183,7 @@ export const topo: {
    *
    * **Example** (Sorting topologically)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -8515,13 +8195,10 @@ export 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) => {
@@ -8531,9 +8208,7 @@ export 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
@@ -8663,7 +8338,7 @@ export const topo: {
  *
  * **Example** (Traversing in postorder)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -8675,10 +8350,7 @@ export 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
@@ -8704,7 +8376,7 @@ export const dfsPostOrder: {
    *
    * **Example** (Traversing in postorder)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -8716,10 +8388,7 @@ export 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
@@ -8745,7 +8414,7 @@ export const dfsPostOrder: {
    *
    * **Example** (Traversing in postorder)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -8757,10 +8426,7 @@ export 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
@@ -8852,7 +8518,7 @@ export const dfsPostOrder: {
  *
  * **Example** (Iterating all nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -8862,8 +8528,7 @@ export 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
@@ -8900,7 +8565,7 @@ export const nodes = <N, E, T extends Kind = "directed">(
  *
  * **Example** (Iterating all edges)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -8911,8 +8576,7 @@ export const nodes = <N, E, T extends Kind = "directed">(
  *   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
@@ -8974,7 +8638,7 @@ export interface ExternalsConfig {
  *
  * **Example** (Iterating external nodes)
  *
- * ```ts
+ * ```ts import.meta.vitest
  * import { Graph } from "effect"
  *
  * const graph = Graph.directed<string, number>((mutable) => {
@@ -8988,16 +8652,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
@@ -9015,7 +8673,7 @@ export const externals: {
    *
    * **Example** (Iterating external nodes)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -9029,16 +8687,10 @@ export 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
@@ -9056,7 +8708,7 @@ export const externals: {
    *
    * **Example** (Iterating external nodes)
    *
-   * ```ts
+   * ```ts import.meta.vitest
    * import { Graph } from "effect"
    *
    * const graph = Graph.directed<string, number>((mutable) => {
@@ -9070,16 +8722,10 @@ export 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