Skip to content

Practice Minimum Number of Vertices to Reach All Nodes

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1557
LeetCode Problem

Minimum Number of Vertices to Reach All Nodes

Problem Statement

Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to node toi. Find the smallest set of vertices from which all nodes in the graph are reachable. It's guaranteed that a unique solution exists. Notice that you can return the vertices in any order.

Source: Minimum Number of Vertices to Reach All Nodes on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
n = 6, edges = [[0,1],[0,2],[2,5],[3,4],[4,2]]
Output
[0,3]

# Example 2

Input
n = 5, edges = [[0,1],[2,1],[3,1],[1,4],[2,4]]
Output
[0,2,3]

Constraints

2 <= n <= 10^5
1 <= edges.length <= min(10^5, n * (n - 1) / 2)
edges[i].length == 2
0 <= fromi, toi < n
All pairs (fromi, toi) are distinct.

Related LeetCode Problems

Practice more problems similar to Minimum Number of Vertices to Reach All Nodes.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.