Implement a Breadth-First Search of the people in the network who are reachable from person id 3980. You can implement BFS with a queue and the pseudocode is given in CLRS. Print out the distance (number of connections) from person 3980 to every person who is reachable from 3980 via edge traversals. Note that not all people in this network may be reachable via edge traversals from user id 3980, so users that are not accessible can be ignored in BFS. All the distances printed out are the shortest paths from 3980 and another person as determined by BFS. For example: "3985 is at a distance of 1 from 3980.""4014 is at a distance of 2 from 3980."

Implement a Breadth-First Search of the people in the network who are reachable from person id 3980. You can implement BFS with a queue and the pseudocode is given in CLRS. Print out the distance (number of connections) from person 3980 to every person who is reachable from 3980 via edge traversals. Note that not all people in this network may be reachable via edge traversals from user id 3980, so users that are not accessible can be ignored in BFS. All the distances printed out are the shortest paths from 3980 and another person as determined by BFS. For example: "3985 is at a distance of 1 from 3980.""4014 is at a distance of 2 from 3980."

Similar questions

For now, we're making do with a rudimentary hash map in which all the values are stored in a single bucket (that is, they are all in the same LinkedList). Once a hash map's goal is met, it is considered successful.
Given the desired order in which the manatees are to arrive down south, how do I dermine if there is any way Hugh can use the drainpipe to achive the desired order? This problem can be solved by using a stack. A stack is an ordered collected of elements that operations to push(), peek(), pop(). In Java the interface Deque has those operations. The ArrayDeque class implements the Deque Interface. Input All input is to be read from the standard input stream. The input consists of several blocks of lines and is terminated by a line with just 0. The first line of each block indicates the number of manatees 0 < N < 100,000. In each of the next lines of the block there is a permutation of the numbers 1, 2, ..., N. For N=3, the permutation 2 3 1 means that the first manatee needs to be placed at the end of line and that the second manatee needs to be placed at the front of the line. The last line of each block contains just 0 signaling the end of the block. Output For each permutation…
Implement a method to remove a node in the middle of a singly linked list (i.e., any node except the first and last node, not necessarily the exact middle), given only access to that node.EXAMPLElnput:the node c from the linked list a->b->c->d->e->fResult: nothing is returned, but the new linked list looks like a ->b->d->e->f
Write a Java program that reads in a list of integers from the console, and prints out the median of the list. The program should use a priority queue to efficiently compute the median. Explain the time and space complexity of your solution.
Implement a method to remove a node from the centre of a singly linked list—that is, any node other than the first and last nodes, not necessarily in that precise order.EXAMPLElnput:the node c from the linked list a->b->c->d->e->fResult: nothing is returned, but the new linked list looks like a ->b->d->e->f
There are an undetermined number of nodes in the fastest linkedlist.Is there one that stands out as being the longest?
Write a method “rotate” that takes a java LinkedList of integers as a parameter and an integer variable ‘count’ to represent the number of rotations. This method is to rotate the LinkedList count number of times counterclockwise (considering the head is on the left, tail on the right.
There are an undetermined number of nodes in the fastest linkedlist.Is there one that stands out as being the longest?
Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new MileageTrackerNode();lastNode = headNode; // TODO: Read in the number of nodes // TODO: For the read in number of nodes, read// in data and insert into the linked list // TODO: Call the PrintNodeData() method// to print the entire linked list //…
Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user- input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 7/16/18 5
Add a method findMiddle() that finds the middle node of a doubly linked list by link hopping, without relying on explicit knowledge of the size of the list. Counting nodes is not the correct way to do this. In the case of an even number of nodes, report the node slightly left of center as the middle. You can assume the list has at least one item. Your findMiddle() code will be located in DoublyLinkedList.java. If you’re using size(), you’re doing it wrong. Starter code for the findMiddle() method: // Janet McGregor 4/20/2053 public E findMiddle() { Node<E> middleNode = header.next; Node<E> currentNode = header.next; // the rest of your code goes here return middleNode.element; } You will test findMiddle() with the following three tests cases. Sample program output: Finding the middle of the list: (1, 2, 3, 4, 5, 6, 7) The middle value is: 4 Finding the middle of this list: (1, 2, 3, 4) The middle value is: 2 Finding the middle of this…
Write a BCPL program that reads a sequence of strings typed by the user and creates a linked list containing them all. But there will be some special command words. These should be obeyed but not inserted into the list An input of END will be used to mark the end of the input sequence. The progrm should stop. An input of ALL means that the whole list should be printed. It is perfectly OK for the list to come out backwards. An input of DELETE means that the next word is to be removed from the list and its memory (for the link object and for the string) must be recycled with freevec (even though freevec doesn't do anything yet). Remember you will need to implement and use strdup(). Remember that strings are packed, four bytes per word, into an array. You use the "byte N of S" syntax to access the individual bytes. Also remember that an extra 0 byte is added to mark the end of the string. Example run: $ run hw4 Enter the strings and deletions: > hello > this > program > works…