Topological Sort, is a Graphs related problem and in this post we will see how we can solve this challenge in C++

Do the Topological sort of a graph This is Different form DFS as in DFS we print each level as we recurrsively go down,but here we store all the nodes till the deepest level and then print from the deepest level

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas