vertex(label,wasvisited){int labelbool wasvisited} verteces[]

graph(verteces[],arry[][],new){set num=0;while(verteces[num]==null)num=num++;verteces[num].label=newset i=0while(i<=num)arry[i][num]=1;set i=0while(i<=num)arry[num][i]}

topological sortingset i=0;for(j=0;j<=num;j++){if(a[i][j])==1)