Question: creates an adjacency linkedList from a text file using BreathFirstSearch and DeapthFirstSearch Using Java: --- Roster --- Student (Kathryn, 24.1, 36104) has friends: (Christine, 23.9,

creates an adjacency linkedList from a text file using BreathFirstSearch and DeapthFirstSearch Using Java:

--- Roster --- Student (Kathryn, 24.1, 36104) has friends: (Christine, 23.9, 49801) (Max, 23.4, 28608) (Timothy, 23.8, 96813) (Ivianni, 23.5, 13301) Student (Christine, 23.9, 49801) has friends: (Kathryn, 24.1, 36104) (Max, 23.4, 28608) (Brijian, 23.7, 62701) (Jose, 23.6, 55102) Student (Timothy, 23.8, 96813) has friends: (Kathryn, 24.1, 36104) (Brijian, 23.7, 62701) Student (Brijian, 23.7, 62701) has friends: (Christine, 23.9, 49801) (Timothy, 23.8, 96813) Student (Jose, 23.6, 55102) has friends: (Christine, 23.9, 49801) (Antoni, 23.2, 73102) Student (Ivianni, 23.5, 13301) has friends: (Kathryn, 24.1, 36104) (Peter, 23.1, 10000) Student (Max, 23.4, 28608) has friends: (Kathryn, 24.1, 36104) (Christine, 23.9, 49801) (Francisco, 23.3, 87501) Student (Francisco, 23.3, 87501) has friends: (Max, 23.4, 28608) (Antoni, 23.2, 73102) Student (Antoni, 23.2, 73102) has friends: (Jose, 23.6, 55102) (Francisco, 23.3, 87501) Student (Peter, 23.1, 10000) has friends: (Ivianni, 23.5, 13301)

Output:

--- Breadth First Search --- visit: (Kathryn, 24.1, 36104) visit: (Christine, 23.9, 49801) visit: (Max, 23.4, 28608) visit: (Timothy, 23.8, 96813) visit: (Ivianni, 23.5, 13301) visit: (Brijian, 23.7, 62701) visit: (Jose, 23.6, 55102) visit: (Francisco, 23.3, 87501) visit: (Peter, 23.1, 10000) visit: (Antoni, 23.2, 73102)

--- Depth First Search --- visit: (Kathryn, 24.1, 36104) visit: (Christine, 23.9, 49801) visit: (Max, 23.4, 28608) visit: (Francisco, 23.3, 87501) visit: (Antoni, 23.2, 73102) visit: (Jose, 23.6, 55102) visit: (Brijian, 23.7, 62701) visit: (Timothy, 23.8, 96813) visit: (Ivianni, 23.5, 13301) visit: (Peter, 23.1, 10000)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Using Java, you are to implement Dijkstras Algorithm for finding an optimal path between vertices of a graph. Specifically, your main program will take in three parameters: 1. Name a graph file 2....

Computer Science Java: Part 1 Finding Least Expensive Routes (50 points) Consider the problem of finding the least expensive routes to all cities in a network from a given starting point. For...

Java: Linked List Topic: Reversing a Linked-List using Stack Write a program that creates a Linked-List object of 10 Strings of Ransom sizes, then: creates a second Linked-List object containing a...

Add the following methods to the LinkedList class you're writing in class ( Do NOT import Java's LinkedList ) : Method 1 : The clone ( ) method creates a new LinkedList that contains all of the...

Assignment 5-1 (35 Points) Write a program that inserts 25 random integers from 0 to 100 in order into a LinkedList object. The program must: sort the elements, then calculate the sum of the...

Java: Part 1 Finding Least Expensive Routes (50 points) Consider the problem of finding the least expensive routes to all cities in a network from a given starting point. For example, in the network...

The implementation is in Java about a doublylinkedlist. Starter code is given. THANK YOU STARTERCODE: import java.util.AbstractList; /** * TODO * @author TODO * @since TODO */ public class...

Refer to the information below: Provide solution to the Questions below. The University of Cambridge is decided to hold its requirements beneath growing monetary strain. The government continues...

16.18 (Copying and Reversing LinkedLists) Write a program that creates a LinkedList object of 10 characters, then creates a second LinkedList object containing a copy of the first list, but in...

Problem 2 (15 pts) Consider a random sample, X, X2, ..., Xn, from a population, with the parameter and a density function fx(x) = 12 (0 -1x-01, -

Find a big-O estimate for the worst-case complexity in terms of number of comparisons used and the number of terms swapped by the binary insertion sort described in the preamble to Exercise 47 in...

Using Excel, create a template that provides information about various financial ratios. In your template, please include at least two (2) ratios within each type/category of ratios . Include the...

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

3. Identifying situations that require employers to pay workers for their time is a challenge. Managers should understand the conditions that trigger payment of wages. These include shorter meal and...

2. When pay decisions are viewed as inappropriate or unfair, lawsuits can occur. There is growing concern about litigation targeting the misclassification of employees, overtime pay, and other wage...

LO1 Identify the three general components of total rewards and give examples of each.