Back to course home
0% completed
Vote For New Content
Incorrect Test Case for Given Solution?
pjplucinski
Jan 4, 2024
It seems like one of the provided test cases may be incorrect for the question. Please let me know if I missed something.
Input: n=7, edges=[[0,1],[1,2],[2,3],[4,5],[5,6],[6,4]]
Expected Output (from the course): [0]
(My) Expected Output: [0, 4]
The question specifies that we're provided a directed acyclic graph (DAG). However, this subset of edges ([4,5],[5,6],[6,4]) seems to set up a cycle: 4 -> 5 -> 6 -> 4. The provided solution of counting which nodes have in-degrees of 0 couldn't work for this because none of the nodes of a cycle have an in-degree of 0.
2
0
Comments
Comments
Design Gurus2 years ago
You are right. The edge [6,4] should have not been there because of the acyclic constraint. We've removed it.
On this page