Write a JAVA program of A Data File Structure for a connected graph that produces a tree. There is a cycle in a graph only if there is a back edge present in the graph. A back edge is an edge that is joining a node to itself (self-loop) or one of its ancestor in the tree produced by Data File Structure. To find the back edge to any of its ancestor keep a visited array and if there is a back edge to any visited node then there is a loop and return true. Algorithm: 1. Create the graph using the given number of edges and vertices. 2. Create a recursive function that that current index or vertex, visited and recursion stack. 3. Mark the current node as visited and also mark the index in recursion stack. 4. Find all the vertices which are not visited and are adjacent to the current node. Recursively call the function for those vertices, if the recursive function returns true return true. 5. If the adjacent vertices are already marked in the recursion stack then return true. 6. Create a wrapper class, that calls the recursive function for all the vertices and if any function returns true, return true. 7. Else if for all vertices the function returns false return false. 1 Adja cent list (g) 0-1,2,3 1-0,2 2-0, 1 3- 0,4 4-3 3

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.