### Write a program that checks whether the graph is cyclic

Assignment Help Basic Computer Science
##### Reference no: EM131340910

1. Let's have as given a graph G(V, E) and two of its vertices x and y. Write a program that finds the shortest path between two vertices measured in number of vertices staying on the path.

2. Let's have as given a graph G(V, E). Write a program that checks whether the graph is cyclic.

3. Implement a recursive traversal in depth in an undirected graph and a program to test it.

#### Implement the structure circular queue with array

Implement the necessary methods for adding, removing the element in succession and retrieving without removing the element in succession. If an operation is invalid, throw a

#### Implement the data structure deque

Create a DynamicStack class to implement dynamically a stack (like a linked list, where each element knows its previous element and the stack knows its last element). Add me

#### Implement the data structure dynamic doubly linked list

Implement the operations for adding, removing and searching for an element, as well as inserting an element at a given index, retrieving an element by a given index and a me

#### Finds the longest subsequence of equal numbers

Write a method that finds the longest subsequence of equal numbers in a given List and returns the result as new List. Write a program to test whether the method works corre

#### Catch and handle all possible exceptions

A text file words.txt is given, containing a list of words, one per line. Write a program that deletes in the file text.txt all the words that occur in the other file. Catch

#### Does the program work for large files

Write a program that replaces every occurrence of the substring "start" with "finish" in a text file. Can you rewrite the program to replace whole words only? Does the progr

#### Define a class to hold multiple values in a hash-table

Implement a data structure, which can quickly do the following two operations: add an element and extract the smallest element. The structure should accept adding duplicated

#### Implement the data structure hash-table in a class hashtable

Resole the collisions with quadratic probing. When the hash table load runs over 75%, perform resizing to 2 times larger capacity. Implement the following methods and proper

### Write a Review 