Blog

Programming Consider the task of checking to see if a graph…

Programming Consider the task of checking to see if a graph contains a cycle. This task can, of course, be accomplished with a recursive DFS algorithm. Unfortunately, in very large graphs it is not appropriate to use recursion to explore, because it requires a vast amount of system memory (to track each recursive call). Implement a method for checking for a cycle in a graph using the DFS algorithm WITHOUT using recursion. Assume that the Stack ADT is available and you are using the standard Graph ADT discussed in class. (Huge Hint: start by thinking about BFS, and how it works without recursion.) Assume a marked variable exists and has been set up to be the size of the graph and with every index set to false. public static boolean[] marked;public static boolean hasCycle(Graph G, int start) {Stack s = new Stack();//TODO: implement this method.