cap mad cop mac mad mad cop cop cop cop cis cop cda cop cop cda cop figure an acyclic graph representing course prerequisite structure figure an acyclic graph vertex is storedand that the graph is read into an adjacency listwe can then apply the algorithm in figure to generate topological ordering the function findnewvertexofindegreezero scans the array of vertices looking for vertex with indegree that has not already been assigned topological number it returns not_a_vertex if no such vertex existsthis indicates that the graph has cycle because findnewvertexofindegreezero is simple sequential scan of the array of verticeseach call to it takes (| |time since there are |vsuch callsthe running time of the algorithm is (| | by paying more careful attention to the data structuresit is possible to do better the cause of the poor running time is the sequential scan through the array of vertices if the