<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/description/">Minimum Number of Vertices to Reach All Nodes - LeetCode</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1557/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1557/main.fsx</a></p>
<pre><code class="lang-plaintext">let findSmallestSetOfVertices (n: int) (edges: (int * int) list) : int list =
    let reachables = edges |&gt; List.map snd |&gt; Set.ofList

    seq { 0 .. (n - 1) }
    |&gt; Seq.filter (fun i -&gt; Set.contains i reachables |&gt; not)
    |&gt; List.ofSeq
</code></pre>


## URL

[Minimum Number of Vertices to Reach All Nodes - LeetCode](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/description/)

## Code

[https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1557/main.fsx](https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1557/main.fsx)

```plaintext
let findSmallestSetOfVertices (n: int) (edges: (int * int) list) : int list =
    let reachables = edges |> List.map snd |> Set.ofList

    seq { 0 .. (n - 1) }
    |> Seq.filter (fun i -> Set.contains i reachables |> not)
    |> List.ofSeq
```

LeetCode 1557. Minimum Number of Vertices to Reach All Nodes in F#

URL

Code