Hello,↵
↵
↵
I was trying this problem [problem:510C], basically it asks us to do a topological sort on a DAG. I used a modified↵
↵
DFS to do that — [submission:11664540].↵
↵
I do a DFS to check for a cycle, then I do a topological sort on the DAG if there are no cycles. But I was getting ↵
↵
WA 12th case. I tried reading others' solutions but couldn't find what was wrong with my code. I then used an O(V^2) ↵
↵
topological sort and it passed. Can someone point my mistake. Thanks , Help much appreciated :)
↵
↵
I was trying this problem [problem:510C], basically it asks us to do a topological sort on a DAG. I used a modified↵
↵
DFS to do that — [submission:11664540].↵
↵
I do a DFS to check for a cycle, then I do a topological sort on the DAG if there are no cycles. But I was getting ↵
↵
WA 12th case. I tried reading others' solutions but couldn't find what was wrong with my code. I then used an O(V^2) ↵
↵
topological sort and it passed. Can someone point my mistake. Thanks , Help much appreciated :)
