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

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

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Write a code in C language that will create graphs and write them to a file in a particular format. The program should be able to accept a number of vertices, create an cycleusing adjacency list data structure and finally output the graph. Where N is the number of vertices in the graph with V vertices and E edges. P[] = Pointer for each vertex V, 1 <= V <= N denoting the starting point in E[] of the list ofvertices adjacent to vertex V. That is, the vertices adjacent to vertex V are indicated inlocations E[P[V]], E[P[V]+1], ..., E[P[V+1]-1].E[] = list of distinct graph edges (length = 2E)Give the asymptotic running timeRun your code for various values of n and time itCreate a table showing the running times for various values.Create a graph of the running times vs various values. Use a linear scale on theaxis.
Write a Java program that: • Defines a linked list data structure to represent a collection of integers. • Populates the linked list with random integers. • Implements three different operations on the linked list: Finding the maximum element Finding the minimum element Calculating the sum of all elements • Tests these operations and ensures their correctness. Provide a big-Oh characterization, in terms of n, of the time complexity for each of the implemented operations on the linked list. Improve the linked list implementation to have a method for removing duplicates in O(N) time complexity.
In Python the only import that may be used is Numpy A function called ttransition_matrix, which will take as input a directed graph object G. The function will return a numpy array which represents the transition matrix of the graph. You may assume that the vertices of G have labels from 0 to |V | − 1 where |V | is the number of vertices in the graph
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following is the expected output: Run: original order of strings: Java C# PHP Python Reverse order of strings: Python PHP C#Java BUILD SUCCESSFUL
unique please Your task for this assignment is to identify a spanning tree in one connected undirected weighted graph using C++. Implement a spanning tree algorithm using C++. A spanning tree is a subset of the edges of a connected undirected weighted graph that connects all the vertices together, without any cycles. The program is interactive. Graph edges with respective weights (i.e., v1 v2 w) are entered at the command line and results are displayed on the console. Each input transaction represents an undirected edge of a connected weighted graph. The edge consists of two unequal non-negative integers in the range 0 to 9 representing graph vertices that the edge connects. Each edge has an assigned weight. The edge weight is a positive integer in the range 1 to 99. The three integers on each input transaction are separated by space. An input transaction containing the string “end-of-file” signals the end of the graph edge input. After the edge information is read, the process…
Please use C++ and provide the code along with a sample output The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Implement quicksort in a JAVA programming language. The first version will use the first element of the array as the pivot. Please help me with a Java code , It needs to take the input from a file of 100 data elements. Can someone please help me with this coding problem. I have the data set file , but I cannot upload it in here. Kindly help me with the code.
Write a c++ program that implements a linked list as an abstract datatype. The program must be: *Be type flexibl.,that is,could a list of intergers,string,or any type *Allow the user to add members into the list *Delete members from the list *Make sure the list is still sorted after all deletion and addition *Show all the function implemetation
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following(attached) is the expected output:
Develop a program in C++ that will implement a Josephus Circle using circular linked list. There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number m which indicates that m-1 persons are skipped and mth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive.
Develop a program in C++ that will implement a Josephus Circle using circular linked list. There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number m which indicates that m-1 persons are skipped and mth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive. ***Using #include <iostream>
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python. The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following is the expected output: