For my class we are supposed to write a code for a topological sort using that input of 0s and 1s from a text file, I'm not sure how you could do this as every graph I've seen so far only has 2 points (x,y).

Implement the topological sort algorithm list below. For credit, please use the pseudocode given in the textbook for your coding! Input: a file containing a graph. The example is given below: Nodes: 5 0,0,0,0,1 0,0,0,0,0 0,1,0,0,0 0,0,0,1,0 Output: its topological sort 3, 1, 5, 4, 2 gure 3.5I h-first search. Procedure: postvisit(v) for all rEV: visited(e) false deadend[i++]=v; for allEV: if not visited)explore (r) procedure dfs(G) Figure 3.3 Finding all nodes reachable from a particular node for(i-1 to graph length) visited[i] false Input: G (VE) is a graph; veV Output: visited () is set to true for all nodes u reachal visited (r) true previsit() Eor each edge (.u) E: for (i-1 to graph length) if(lvisitedi) explore(1) it not visited () explore (u) postvisit(e) procedure explore(G, v) visited [v]-true for(u-1 to graph length) if(graph[r][u]==1) //edge rocedure previsit(v) pre[v clock clockclock 1 if(visited[u]) explore(G.u) postvisit v) procedure postvisit (v) post [u] = clock clock clock 1