What problem does it solve? Modeling dependencies, task ordering, reachability, and routing in TypeScript requires correct graph construction, cycle detection, and shortest-path logic, which is error-prone to implement by hand. This Skill provides expert guidance for Effect v4's Graph module so you can build immutable directed and undirected graphs and run proven algorithms over them. ## Core Features & Use Cases - Graph Construction & Mutation: Create directed or undirected graphs with scoped mutation via Graph.mutate, addNode, addEdge, and bulk map/filter transforms. - Traversal & Structure Analysis: Run lazy DFS, BFS, postorder, and topological walkers, plus isAcyclic, stronglyConnectedComponents, connectedComponents, and isBipartite checks. - Shortest Paths & Visualization: Compute routes with dijkstra, astar, bellmanFord, and floydWarshall, and export diagrams to GraphViz DOT or Mermaid. - Use Case: Model a build pipeline as a DAG, detect dependency cycles via stronglyConnectedComponents, derive execution order with topo, and render the pipeline as a Mermaid diagram. ## Quick Start Use the effect-graph skill to build a directed task dependency graph in Effect TypeScript, detect cycles, and produce a topological execution order.
