[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M72SDJEY0NPD0A90VE8Q0YA6":3,"skill-same:01M72SDJEY0NPD0A90VE8Q0YA6":48},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":27,"commitSha":28,"skillDirectory":29,"forksCount":30,"repositoryHtmlUrl":31,"repositoryHomepageUrl":6,"ownerHtmlUrl":32,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":33,"install":34,"resources":47},"01M72SDJEY0NPD0A90VE8Q0YA6","fsharp-graph-algorithms",null,"Hand-roll DAG cycle detection, Kahn topo sort, and synthetic propagation in F#; property-test with FsCheck.","EHotwagner\u002FFS-Skia-UI","EHotwagner","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F1645484?v=4","01M72S7CTBDPQDQHQJKKHY87K9","01M72S7CVFD0JN82RVX21NFEVC",2,"MIT","https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Ffsharp-graph-algorithms\u002FSKILL.md",[],[],"2026-11-10 22:39:42",false,"---\nname: fsharp-graph-algorithms\ndescription: Hand-roll DAG cycle detection, Kahn topo sort, and synthetic propagation in F#; property-test with FsCheck.\ncompatibility: F# governance library (build\u002FGovernance) under net10.0; build-tooling scope only.\nmetadata:\n  author: fs-skia-ui\n  source: docs\u002Freports\u002F2026-05-31-1714-foundations-fsharp-capabilities-and-libraries.md\n---\n\n# fsharp-graph-algorithms\n\nCookbook for the evidence-graph algorithms ported from `compute-task-graph.py`. Owns **C6** (cycle\ndetection), **C7** (topological sort), **C8** (synthetic propagation + root-cause map), and **C9**\n(phase-checkpoint implicit edges). Verdicts from the capability report (`metadata.source`) §4, not\nre-opened.\n\n## When to use\n\nComputing the task DAG (C6–C9 above) over the typed model produced by [[fsharp-parsing]].\n\n## Verdict: hand-roll as pure functions; do NOT pull a graph library\n\nThe three algorithms are small, standard, and central. Hand-rolling over a typed `Task`\u002F`Dep` model\n**guarantees output parity** with the Python (you own every tie-break and ordering), is **pure and\ntestable**, and adds **zero runtime dependency**. **QuikGraph rejected** — a C# dependency for ~40\nlines, and the bespoke propagation rule sits outside it anyway. **FsCheck 3.3.3** (via in-tree Expecto)\n**adopted** for property tests only.\n\n## Exact rules to reproduce (parity-critical)\n\n- **Cycle detection (C6)** — 3-colour DFS (WHITE\u002FGRAY\u002FBLACK); a back-edge to a **GRAY** node is a\n  cycle.\n- **Topological sort (C7)** — Kahn (repeatedly emit zero-in-degree nodes). Preserve the Python's\n  tie-break: emit ready nodes in a **stable sorted order** so rendered output matches byte-for-byte.\n- **Synthetic propagation (C8)** — `effective(T) = synthetic` if `declared(T)=synthetic`; else\n  `auto-synthetic` if `declared(T)=done` AND any dep is `(auto-)synthetic` **except accepted\n  `[SEH]`**; else `declared(T)`. Maintain the upstream root-cause map per auto-synthetic task.\n- **Phase-checkpoint edges (C9)** — inject an implicit dep from every Phase N+1 task to the last\n  Phase N foundation task (pure list manipulation).\n\nGolden-gate (Invariant 6) against the Stage-0 fixtures before deleting the Python.\n\n## API walkthrough + runnable examples\n\n### C6 — cycle detection (3-colour DFS)\n\n```fsharp\nopen System.Collections.Generic\n\ntype Colour =\n    | White\n    | Gray\n    | Black\n\n\u002F\u002F\u002F A back-edge to a GRAY node is a cycle. `edges` maps a node to its successors.\nlet hasCycle (nodes: string list) (edges: Map\u003Cstring, string list>) =\n    let colour = Dictionary\u003Cstring, Colour>()\n    for n in nodes do colour.[n] \u003C- White\n\n    let rec dfs n =\n        colour.[n] \u003C- Gray\n\n        let viaChild =\n            edges\n            |> Map.tryFind n\n            |> Option.defaultValue []\n            |> List.exists (fun child ->\n                match colour.TryGetValue child with\n                | true, Gray -> true\n                | true, Black -> false\n                | _ -> dfs child)\n\n        colour.[n] \u003C- Black\n        viaChild\n\n    nodes |> List.exists (fun n -> colour.[n] = White && dfs n)\n```\n\n### C7 — Kahn topological sort with the Python tie-break\n\nReady nodes are emitted in **sorted** order so the rendered graph is reproducible. `None` means Kahn\ncould not consume every node — a cycle, exactly the C6 condition.\n\n```fsharp\nlet topoSort (nodes: string list) (edges: Map\u003Cstring, string list>) : string list option =\n    let indegree = nodes |> List.map (fun n -> n, 0) |> Map.ofList\n\n    let indegree =\n        edges\n        |> Map.toList\n        |> List.collect snd\n        |> List.fold (fun (acc: Map\u003Cstring, int>) child ->\n            match Map.tryFind child acc with\n            | Some d -> Map.add child (d + 1) acc\n            | None -> acc) indegree\n\n    let rec loop (deg: Map\u003Cstring, int>) emitted =\n        let ready =\n            deg |> Map.toList |> List.filter (fun (_, d) -> d = 0) |> List.map fst |> List.sort\n\n        match ready with\n        | [] -> if Map.isEmpty deg then Some(List.rev emitted) else None\n        | next :: _ ->\n            let children = edges |> Map.tryFind next |> Option.defaultValue []\n\n            let deg =\n                children\n                |> List.fold (fun (acc: Map\u003Cstring, int>) c ->\n                    match Map.tryFind c acc with\n                    | Some d -> Map.add c (d - 1) acc\n                    | None -> acc) (Map.remove next deg)\n\n            loop deg (next :: emitted)\n\n    loop indegree []\n```\n\n### C8 — synthetic propagation + root-cause map\n\n`effective` is computed in topological order so every dependency is already resolved. Accepted `[SEH]`\ntasks are synthetic but the **explicit exception** that does NOT propagate auto-synthetic to dependents.\n\n```fsharp\ntype Declared =\n    | Pending\n    | DoneReal\n    | SyntheticDecl\n\ntype Effective =\n    | EffPending\n    | EffReal\n    | EffSynthetic\n    | EffAutoSynthetic\n\n\u002F\u002F\u002F `order` must be a topological order (see C7). `acceptedSeh` is the set of\n\u002F\u002F\u002F task ids whose synthetic evidence is design-approved and therefore does not\n\u002F\u002F\u002F propagate. Returns the effective status and the upstream root-cause map.\nlet propagate\n    (declared: Map\u003Cstring, Declared>)\n    (acceptedSeh: Set\u003Cstring>)\n    (deps: Map\u003Cstring, string list>)\n    (order: string list)\n    : Map\u003Cstring, Effective> * Map\u003Cstring, string list> =\n\n    let mutable eff = Map.empty\n    let mutable rootCause = Map.empty\n\n    for t in order do\n        let d = declared |> Map.tryFind t |> Option.defaultValue Pending\n\n        let syntheticDeps =\n            deps\n            |> Map.tryFind t\n            |> Option.defaultValue []\n            |> List.filter (fun dep ->\n                not (acceptedSeh.Contains dep)\n                && (match Map.tryFind dep eff with\n                    | Some EffSynthetic\n                    | Some EffAutoSynthetic -> true\n                    | _ -> false))\n\n        let status =\n            match d with\n            | SyntheticDecl -> EffSynthetic\n            | DoneReal when not (List.isEmpty syntheticDeps) -> EffAutoSynthetic\n            | DoneReal -> EffReal\n            | Pending -> EffPending\n\n        eff \u003C- Map.add t status eff\n\n        if status = EffAutoSynthetic then\n            rootCause \u003C- Map.add t syntheticDeps rootCause\n\n    eff, rootCause\n```\n\n### C9 — phase-checkpoint implicit edges\n\nPure list manipulation: every task in Phase N+1 gains an implicit dependency on the last foundation\ntask of Phase N.\n\n```fsharp\n\u002F\u002F\u002F `phases` is the ordered list of (phaseTasks) groups, each the task ids of one\n\u002F\u002F\u002F phase in document order. Adds the implicit edge from each later-phase task to\n\u002F\u002F\u002F the last task of the previous phase.\nlet phaseCheckpointEdges (phases: string list list) : (string * string) list =\n    phases\n    |> List.pairwise\n    |> List.collect (fun (prev, next) ->\n        match List.tryLast prev with\n        | None -> []\n        | Some checkpoint -> next |> List.map (fun t -> t, checkpoint))\n```\n\n### C20 link — FsCheck property tests (adopt)\n\nEncode the invariants and let FsCheck shrink counterexamples. FsCheck 3's F# surface lives in\n`FsCheck.FSharp` (`Prop.forAll`, `ArbMap`); `Check.QuickThrowOnFailure` fails the test on a\ncounterexample. See [[fsharp-build-orchestration]] for wiring these into Expecto.\n\n```fsharp\nopen FsCheck\nopen FsCheck.FSharp\n\n\u002F\u002F\u002F topo order respects every edge; reversing twice is identity (a stand-in for\n\u002F\u002F\u002F the \"ordering is stable\" family of invariants).\nlet runGraphProperties () =\n    Check.QuickThrowOnFailure(fun (xs: int list) -> List.rev (List.rev xs) = xs)\n\n    let ints = ArbMap.defaults |> ArbMap.arbitrary\u003Cint>\n    Check.QuickThrowOnFailure(Prop.forAll ints (fun n -> n + 0 = n))\n```\n\n## Library API + runnable example\n\nThese algorithms now ship as the real `Graph` module in the **`FS.Skia.UI.SkillSupport`**\npackage — its `.fsi` surface lives at `src\u002FSkillSupport\u002FGraph.fsi`. The same code is consumed by\n`FS.Skia.UI.Build` via ProjectReference, so the governance build runs exactly these functions:\n\n- `Graph.topoSort: NodeId list -> Edge list -> Result\u003CNodeId list, NodeId list>` — Kahn order, or\n  `Error` carrying the unresolved (cyclic) node ids.\n- `Graph.detectCycle: NodeId list -> Edge list -> NodeId list option` — `Some cycle` when a back-edge\n  to a GRAY node exists, else `None`.\n- `NodeId = string`; `Edge = NodeId * NodeId`.\n\n```fsharp\nopen FS.Skia.UI.SkillSupport\n\nlet nodes = [ \"T001\"; \"T002\"; \"T003\" ]\nlet edges = [ (\"T001\", \"T002\"); (\"T002\", \"T003\") ]\n\n\u002F\u002F Topological order respecting every edge (Ok in the acyclic case).\nlet order =\n    match Graph.topoSort nodes edges with\n    | Ok sorted -> sorted              \u002F\u002F [ \"T001\"; \"T002\"; \"T003\" ]\n    | Error unresolved -> failwithf \"cycle through %A\" unresolved\n\n\u002F\u002F No cycle here, so detectCycle returns None.\nlet cycle = Graph.detectCycle nodes edges   \u002F\u002F None\n```\n\n## Cautions\n\n- **Tie-break parity.** Kahn must emit ready nodes sorted (as the Python did) or `task-graph.md`\n  drifts byte-for-byte.\n- **Accepted-`[SEH]` is an explicit exception** — synthetic itself, but does NOT make dependents\n  auto-synthetic. Do not drop it.\n- **Propagation runs in topological order** — compute C7 first, then C8 over that order.\n- **Determinism \u002F build-tooling scope.** Pure functions, no I\u002FO, no clock; under `build\u002FGovernance`,\n  ships nowhere.\n\n## Consuming stages\n\nStage 4 (graph compute port: cycle\u002Ftopo\u002Fpropagation), Stage 5 (the in-process gate that replaces the\nshell orchestration). See the plan in `metadata.source`.\n\n## Persistent problems\n\nWhen a problem outlasts reasonable in-repo attempts, extensive external research is\n**mandatory** — consult **official online docs first** (the F#\u002F.NET docs and the driven\nlibrary's own documentation\u002FAPI reference), then community sources (forums, Reddit, Q&A\nsites, issue trackers and changelogs). Record the findings and resolving links in the\nfeature's `specs\u002F\u003Cfeature>\u002Ffeedback\u002F` folder and, for durable lessons, in this skill's\n**Sources** line. Offline, the mandate degrades to recording \"research blocked — \u003Cwhy>\"\nrather than hard-failing the phase.\n\n## Sources \u002F links\n\n- FsCheck 3: \u003Chttps:\u002F\u002Ffscheck.github.io\u002FFsCheck\u002F>\n- Kahn's algorithm \u002F topological sorting: \u003Chttps:\u002F\u002Fen.wikipedia.org\u002Fwiki\u002FTopological_sorting>\n- Capability report: `docs\u002Freports\u002F2026-05-31-1714-foundations-fsharp-capabilities-and-libraries.md` §4.\n\n## Related\n\n[[fsharp-parsing]] (produces the typed model), [[fsharp-code-generation]] (renders the graph),\n[[fsharp-build-orchestration]] (the Expecto + FsCheck test harness),\n[[fsharp-shell-process]] (the in-process gate that replaces the shell orchestration).\n","# fsharp-graph-algorithms\n\nCookbook for the evidence-graph algorithms ported from `compute-task-graph.py`. Owns **C6** (cycle\ndetection), **C7** (topological sort), **C8** (synthetic propagation + root-cause map), and **C9**\n(phase-checkpoint implicit edges). Verdicts from the capability report (`metadata.source`) §4, not\nre-opened.\n\n## When to use\n\nComputing the task DAG (C6–C9 above) over the typed model produced by [[fsharp-parsing]].\n\n## Verdict: hand-roll as pure functions; do NOT pull a graph library\n\nThe three algorithms are small, standard, and central. Hand-rolling over a typed `Task`\u002F`Dep` model\n**guarantees output parity** with the Python (you own every tie-break and ordering), is **pure and\ntestable**, and adds **zero runtime dependency**. **QuikGraph rejected** — a C# dependency for ~40\nlines, and the bespoke propagation rule sits outside it anyway. **FsCheck 3.3.3** (via in-tree Expecto)\n**adopted** for property tests only.\n\n## Exact rules to reproduce (parity-critical)\n\n- **Cycle detection (C6)** — 3-colour DFS (WHITE\u002FGRAY\u002FBLACK); a back-edge to a **GRAY** node is a\n  cycle.\n- **Topological sort (C7)** — Kahn (repeatedly emit zero-in-degree nodes). Preserve the Python's\n  tie-break: emit ready nodes in a **stable sorted order** so rendered output matches byte-for-byte.\n- **Synthetic propagation (C8)** — `effective(T) = synthetic` if `declared(T)=synthetic`; else\n  `auto-synthetic` if `declared(T)=done` AND any dep is `(auto-)synthetic` **except accepted\n  `[SEH]`**; else `declared(T)`. Maintain the upstream root-cause map per auto-synthetic task.\n- **Phase-checkpoint edges (C9)** — inject an implicit dep from every Phase N+1 task to the last\n  Phase N foundation task (pure list manipulation).\n\nGolden-gate (Invariant 6) against the Stage-0 fixtures before deleting the Python.\n\n## API walkthrough + runnable examples\n\n### C6 — cycle detection (3-colour DFS)\n\n```fsharp\nopen System.Collections.Generic\n\ntype Colour =\n    | White\n    | Gray\n    | Black\n\n\u002F\u002F\u002F A back-edge to a GRAY node is a cycle. `edges` maps a node to its successors.\nlet hasCycle (nodes: string list) (edges: Map\u003Cstring, string list>) =\n    let colour = Dictionary\u003Cstring, Colour>()\n    for n in nodes do colour.[n] \u003C- White\n\n    let rec dfs n =\n        colour.[n] \u003C- Gray\n\n        let viaChild =\n            edges\n            |> Map.tryFind n\n            |> Option.defaultValue []\n            |> List.exists (fun child ->\n                match colour.TryGetValue child with\n                | true, Gray -> true\n                | true, Black -> false\n                | _ -> dfs child)\n\n        colour.[n] \u003C- Black\n        viaChild\n\n    nodes |> List.exists (fun n -> colour.[n] = White && dfs n)\n```\n\n### C7 — Kahn topological sort with the Python tie-break\n\nReady nodes are emitted in **sorted** order so the rendered graph is reproducible. `None` means Kahn\ncould not consume every node — a cycle, exactly the C6 condition.\n\n```fsharp\nlet topoSort (nodes: string list) (edges: Map\u003Cstring, string list>) : string list option =\n    let indegree = nodes |> List.map (fun n -> n, 0) |> Map.ofList\n\n    let indegree =\n        edges\n        |> Map.toList\n        |> List.collect snd\n        |> List.fold (fun (acc: Map\u003Cstring, int>) child ->\n            match Map.tryFind child acc with\n            | Some d -> Map.add child (d + 1) acc\n            | None -> acc) indegree\n\n    let rec loop (deg: Map\u003Cstring, int>) emitted =\n        let ready =\n            deg |> Map.toList |> List.filter (fun (_, d) -> d = 0) |> List.map fst |> List.sort\n\n        match ready with\n        | [] -> if Map.isEmpty deg then Some(List.rev emitted) else None\n        | next :: _ ->\n            let children = edges |> Map.tryFind next |> Option.defaultValue []\n\n            let deg =\n                children\n                |> List.fold (fun (acc: Map\u003Cstring, int>) c ->\n                    match Map.tryFind c acc with\n                    | Some d -> Map.add c (d - 1) acc\n                    | None -> acc) (Map.remove next deg)\n\n            loop deg (next :: emitted)\n\n    loop indegree []\n```\n\n### C8 — synthetic propagation + root-cause map\n\n`effective` is computed in topological order so every dependency is already resolved. Accepted `[SEH]`\ntasks are synthetic but the **explicit exception** that does NOT propagate auto-synthetic to dependents.\n\n```fsharp\ntype Declared =\n    | Pending\n    | DoneReal\n    | SyntheticDecl\n\ntype Effective =\n    | EffPending\n    | EffReal\n    | EffSynthetic\n    | EffAutoSynthetic\n\n\u002F\u002F\u002F `order` must be a topological order (see C7). `acceptedSeh` is the set of\n\u002F\u002F\u002F task ids whose synthetic evidence is design-approved and therefore does not\n\u002F\u002F\u002F propagate. Returns the effective status and the upstream root-cause map.\nlet propagate\n    (declared: Map\u003Cstring, Declared>)\n    (acceptedSeh: Set\u003Cstring>)\n    (deps: Map\u003Cstring, string list>)\n    (order: string list)\n    : Map\u003Cstring, Effective> * Map\u003Cstring, string list> =\n\n    let mutable eff = Map.empty\n    let mutable rootCause = Map.empty\n\n    for t in order do\n        let d = declared |> Map.tryFind t |> Option.defaultValue Pending\n\n        let syntheticDeps =\n            deps\n            |> Map.tryFind t\n            |> Option.defaultValue []\n            |> List.filter (fun dep ->\n                not (acceptedSeh.Contains dep)\n                && (match Map.tryFind dep eff with\n                    | Some EffSynthetic\n                    | Some EffAutoSynthetic -> true\n                    | _ -> false))\n\n        let status =\n            match d with\n            | SyntheticDecl -> EffSynthetic\n            | DoneReal when not (List.isEmpty syntheticDeps) -> EffAutoSynthetic\n            | DoneReal -> EffReal\n            | Pending -> EffPending\n\n        eff \u003C- Map.add t status eff\n\n        if status = EffAutoSynthetic then\n            rootCause \u003C- Map.add t syntheticDeps rootCause\n\n    eff, rootCause\n```\n\n### C9 — phase-checkpoint implicit edges\n\nPure list manipulation: every task in Phase N+1 gains an implicit dependency on the last foundation\ntask of Phase N.\n\n```fsharp\n\u002F\u002F\u002F `phases` is the ordered list of (phaseTasks) groups, each the task ids of one\n\u002F\u002F\u002F phase in document order. Adds the implicit edge from each later-phase task to\n\u002F\u002F\u002F the last task of the previous phase.\nlet phaseCheckpointEdges (phases: string list list) : (string * string) list =\n    phases\n    |> List.pairwise\n    |> List.collect (fun (prev, next) ->\n        match List.tryLast prev with\n        | None -> []\n        | Some checkpoint -> next |> List.map (fun t -> t, checkpoint))\n```\n\n### C20 link — FsCheck property tests (adopt)\n\nEncode the invariants and let FsCheck shrink counterexamples. FsCheck 3's F# surface lives in\n`FsCheck.FSharp` (`Prop.forAll`, `ArbMap`); `Check.QuickThrowOnFailure` fails the test on a\ncounterexample. See [[fsharp-build-orchestration]] for wiring these into Expecto.\n\n```fsharp\nopen FsCheck\nopen FsCheck.FSharp\n\n\u002F\u002F\u002F topo order respects every edge; reversing twice is identity (a stand-in for\n\u002F\u002F\u002F the \"ordering is stable\" family of invariants).\nlet runGraphProperties () =\n    Check.QuickThrowOnFailure(fun (xs: int list) -> List.rev (List.rev xs) = xs)\n\n    let ints = ArbMap.defaults |> ArbMap.arbitrary\u003Cint>\n    Check.QuickThrowOnFailure(Prop.forAll ints (fun n -> n + 0 = n))\n```\n\n## Library API + runnable example\n\nThese algorithms now ship as the real `Graph` module in the **`FS.Skia.UI.SkillSupport`**\npackage — its `.fsi` surface lives at `src\u002FSkillSupport\u002FGraph.fsi`. The same code is consumed by\n`FS.Skia.UI.Build` via ProjectReference, so the governance build runs exactly these functions:\n\n- `Graph.topoSort: NodeId list -> Edge list -> Result\u003CNodeId list, NodeId list>` — Kahn order, or\n  `Error` carrying the unresolved (cyclic) node ids.\n- `Graph.detectCycle: NodeId list -> Edge list -> NodeId list option` — `Some cycle` when a back-edge\n  to a GRAY node exists, else `None`.\n- `NodeId = string`; `Edge = NodeId * NodeId`.\n\n```fsharp\nopen FS.Skia.UI.SkillSupport\n\nlet nodes = [ \"T001\"; \"T002\"; \"T003\" ]\nlet edges = [ (\"T001\", \"T002\"); (\"T002\", \"T003\") ]\n\n\u002F\u002F Topological order respecting every edge (Ok in the acyclic case).\nlet order =\n    match Graph.topoSort nodes edges with\n    | Ok sorted -> sorted              \u002F\u002F [ \"T001\"; \"T002\"; \"T003\" ]\n    | Error unresolved -> failwithf \"cycle through %A\" unresolved\n\n\u002F\u002F No cycle here, so detectCycle returns None.\nlet cycle = Graph.detectCycle nodes edges   \u002F\u002F None\n```\n\n## Cautions\n\n- **Tie-break parity.** Kahn must emit ready nodes sorted (as the Python did) or `task-graph.md`\n  drifts byte-for-byte.\n- **Accepted-`[SEH]` is an explicit exception** — synthetic itself, but does NOT make dependents\n  auto-synthetic. Do not drop it.\n- **Propagation runs in topological order** — compute C7 first, then C8 over that order.\n- **Determinism \u002F build-tooling scope.** Pure functions, no I\u002FO, no clock; under `build\u002FGovernance`,\n  ships nowhere.\n\n## Consuming stages\n\nStage 4 (graph compute port: cycle\u002Ftopo\u002Fpropagation), Stage 5 (the in-process gate that replaces the\nshell orchestration). See the plan in `metadata.source`.\n\n## Persistent problems\n\nWhen a problem outlasts reasonable in-repo attempts, extensive external research is\n**mandatory** — consult **official online docs first** (the F#\u002F.NET docs and the driven\nlibrary's own documentation\u002FAPI reference), then community sources (forums, Reddit, Q&A\nsites, issue trackers and changelogs). Record the findings and resolving links in the\nfeature's `specs\u002F\u003Cfeature>\u002Ffeedback\u002F` folder and, for durable lessons, in this skill's\n**Sources** line. Offline, the mandate degrades to recording \"research blocked — \u003Cwhy>\"\nrather than hard-failing the phase.\n\n## Sources \u002F links\n\n- FsCheck 3: \u003Chttps:\u002F\u002Ffscheck.github.io\u002FFsCheck\u002F>\n- Kahn's algorithm \u002F topological sorting: \u003Chttps:\u002F\u002Fen.wikipedia.org\u002Fwiki\u002FTopological_sorting>\n- Capability report: `docs\u002Freports\u002F2026-05-31-1714-foundations-fsharp-capabilities-and-libraries.md` §4.\n\n## Related\n\n[[fsharp-parsing]] (produces the typed model), [[fsharp-code-generation]] (renders the graph),\n[[fsharp-build-orchestration]] (the Expecto + FsCheck test harness),\n[[fsharp-shell-process]] (the in-process gate that replaces the shell orchestration).\n",{"name":5,"metadata":23,"description":7,"compatibility":26},{"author":24,"source":25},"fs-skia-ui","docs\u002Freports\u002F2026-05-31-1714-foundations-fsharp-capabilities-and-libraries.md","F# governance library (build\u002FGovernance) under net10.0; build-tooling scope only.","main","f943406829a9218b2882e09eb88d4ddb539c5e72",".claude\u002Fskills\u002Ffsharp-graph-algorithms",0,"https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI","https:\u002F\u002Fgithub.com\u002FEHotwagner","2026-06-16 16:16:52",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add EHotwagner\u002FFS-Skia-UI --skill fsharp-graph-algorithms",{"tool":40,"command":41},"bunx","bunx skills add EHotwagner\u002FFS-Skia-UI --skill fsharp-graph-algorithms",{"tool":43,"command":44},"pnpm","pnpm dlx skills add EHotwagner\u002FFS-Skia-UI --skill fsharp-graph-algorithms","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Ffsharp-graph-algorithms\u002FSKILL.md",true,[],[49,56,63,70,77,84],{"skillNo":50,"name":51,"nameZh":6,"description":52,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":18},"01M72SGYR4T02T1HTS175E0V86","fs-skia-ui-widgets","Generated product guidance for Skia-rendered FS.Skia.UI Controls, rich text, chart controls, graph controls, DataGrid, and custom wrappers.","https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI\u002Fblob\u002Fmain\u002Ftemplate\u002Fproduct-skills\u002Ffs-skia-ui-widgets\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":18},"01M72SGVZJR1B117QK7TCC6E0J","fs-skia-testing","Assert generated-product expectations and evidence in a governed FS.Skia.UI product.","https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI\u002Fblob\u002Fmain\u002Ftemplate\u002Fproduct-skills\u002Ffs-skia-testing\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":18},"01M72SGTC5HZYEVVVZT4X51AZ3","fs-skia-skiaviewer","Wire a generated FS.Skia.UI product to the desktop viewer host.","https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI\u002Fblob\u002Fmain\u002Ftemplate\u002Fproduct-skills\u002Ffs-skia-skiaviewer\u002FSKILL.md",[],[],{"skillNo":71,"name":72,"nameZh":6,"description":73,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":18},"01M72SGS47RPYPC9JTC39CC6EF","fs-skia-scene","Build pure scene descriptions in a generated FS.Skia.UI product.","https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI\u002Fblob\u002Fmain\u002Ftemplate\u002Fproduct-skills\u002Ffs-skia-scene\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":18},"01M72SGQF4G76C4NGSF69KZRRF","fs-skia-keyboard-input","Map keyboard input to product commands in a generated FS.Skia.UI product.","https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI\u002Fblob\u002Fmain\u002Ftemplate\u002Fproduct-skills\u002Ffs-skia-keyboard-input\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":18},"01M72SGNJP3PMSS2VRP98G7Z42","fs-skia-elmish","Drive a generated FS.Skia.UI product through the pure Elmish adapter.","https:\u002F\u002Fgithub.com\u002FEHotwagner\u002FFS-Skia-UI\u002Fblob\u002Fmain\u002Ftemplate\u002Fproduct-skills\u002Ffs-skia-elmish\u002FSKILL.md",[],[]]