# LeetCode Daily Challenge Discussion | 1557. Minimum Number of Vertices to Reach All Nodes
bruce1557. Minimum Number of Vertices to Reach All Nodes DescriptionGiven a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges = represents a directed edge from node fromi to node toi.Find the smallest set of vertices…