C Algorithms - Topological Sort

Let us say that the order relation that was defined the in introduction lesson was a partial one for example a1 a0 a1 a2 a3. The problem is to determine a list of order in which if ai aj then ai will come before aj in the final sorted list .Read More..........
C Algorithms - Topological Sort