Im unable to debug

#1

Can someone help me debug my code. There’s something wrong in this Topological sorting code using DFS.

Thanks

Link: https://ide.codingblocks.com/s/224523

#2

What exactly is the issue? Also mention the expected output.

#3

I’m missing a node in my sort output.

#4

I’m getting 4 as a key in my printGraph function,

#5

But not in my topological sort function.

#6

You have to visit each and every node. If you visit only i.first in adjacency list then some nodes will be left out. Problem was due to line 54. You can dry run and check with the adjacency list formed.
Check now:

Identical codes. DFS Topological sort working with map and not with unordered_map
#7

But i is the map object, so every key in the map object is being visited once. when i use the iterator. Thanks for the working code though. but i dont see why iterator should fail.

#8

Also, the solution is working when I know the numer of nodes. what if I dont know the number of nodes? Thanks

#9

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.