visited $[1--]=0$; finished $[1-]=0$; out $1--$; stage $[1-]=1$;for $=1$ to for $<mn\; id="EditorElement\_16106676">1</mn>$ to if $[][]=1$out $[]=$ out $[]+1$;for $=1$ to if out $[]=0$ then @$()()$visited $[$i$]=1$;for $=1$ to if $[][]=1$out $[]=$out$[]+1$;for $=1$ to if $[][]=1$if visited $[]=1$if finished $=0$end; cycle;else go$()()$stage $[]$stage$[]$finished $[]=1$

I need a simple c code which uses simple c functions $($ and exact variable and function in the prevoious pseudo code $)$ that allows the user to input a graph then the graph will be print sorted as a topological sort$)$ please explain the code line by line