Please help write the algorithm

Section 6.4.2: Acyclic Networks Implement the simple algorithm introduced in this section (as a new function) to determine whether a network is acyclic or not. Run your algorithm on the three networks supplied: acyclic1.edgelist, acyclic2. edgelist, and acyclic3.edgelist. The edgelist format is a simple format to save a network in which each line has the name of one node, a space (or tab or some sort of whitespace), and then the name of another node each of these lines specifies an edge between the two nodes (it can be interpreted as directed or undirected way, so we need to specify). To read in this kind of network use the zen.io.edgelist module: G = zen.io.edgelist.read(acyclici.edgelist', directed=True) Since you'll reuse this code (at least three times), it makes sense to define a small function to run the algorithm. Then beneath this function call it for each of the three graphs. You'll probably want to use a while loop. Also, a very relevant (and convenient) implementation detail of zen is that when you remove a node, then all the edges to/from that node are also automatically removed. Section 6.4.2: Acyclic Networks Implement the simple algorithm introduced in this section (as a new function) to determine whether a network is acyclic or not. Run your algorithm on the three networks supplied: acyclic1.edgelist, acyclic2. edgelist, and acyclic3.edgelist. The edgelist format is a simple format to save a network in which each line has the name of one node, a space (or tab or some sort of whitespace), and then the name of another node each of these lines specifies an edge between the two nodes (it can be interpreted as directed or undirected way, so we need to specify). To read in this kind of network use the zen.io.edgelist module: G = zen.io.edgelist.read(acyclici.edgelist', directed=True) Since you'll reuse this code (at least three times), it makes sense to define a small function to run the algorithm. Then beneath this function call it for each of the three graphs. You'll probably want to use a while loop. Also, a very relevant (and convenient) implementation detail of zen is that when you remove a node, then all the edges to/from that node are also automatically removed