Hewo everyone look at me I look ugly don't I<br>

Create a linked list for library patrons. Put at least 8 patrons in the list. (You should hard code this data.) Ask for a person

Evgesh-ka [11]

Answer:

Explanation:

#include <bits/stdc++.h>

using namespace std;

/* Link list node */

class Node

{

public:

string Name;

long Library_card_number;

string Street;

string City;

long Zip;

Node* next;

};

/* Given a reference (pointer to pointer) to the head

of a list and an int, push a new node on the front

of the list. */

void push(Node** head_ref,string name,long lcn,string street,string city,long zip)

{

/* allocate node */

Node* new_node = new Node();

/* put in the key */

new_node->Name = name;

new_node->Library_card_number = lcn;

new_node->Street = street;

new_node->City = city;

new_node->Zip = zip;

/* link the old list off the new node */

new_node->next = (*head_ref);

/* move the head to point to the new node */

(*head_ref) = new_node;

}

/* Checks whether the value x is present in linked list */

Node* search(Node* head, string x)

{

Node* current = head; // Initialize current

while (current != NULL)

{

if (current->Name == x)

return current;

current = current->next;

}

return NULL;

}

/* Driver program to test count function*/

int main()

{

/* Start with the empty list */

Node* head = NULL;

int x = 21;

/* Use push() to construct below list

14->21->11->30->10 */

push(&head, "Joe",1,"hippy Street","Bay area",2009);

push(&head, "Marie",2,"lippy street","san jose",2010);

push(&head, "Harry",3,"gippy Street","Bay area",2009);

push(&head, "Ashish",4,"dippy street","san jose",2010);

push(&head, "Zuck",5,"sippy Street","Bay area",2009);

push(&head, "Gates",6,"kippy street","san jose",2010);

push(&head, "Page",7,"pippy Street","Bay area",2009);

push(&head, "Brin",8,"dippy street","san jose",2010);

string name;

cout<<"Enter name of the person to search: ";

cin>>name;

Node* z = search(head,name);

if(z!=NULL){

cout<<"\nPerson found in the list"<<endl;

cout<<"Name: "<<z->Name<<endl;

cout<<"Library Card Number: "<<z->Library_card_number<<endl;

cout<<"Street: "<<z->Street<<endl;

cout<<"City: "<<z->City<<endl;

cout<<"Zip: "<<z->Zip<<endl;

}else{

cout<<"No person found with the name "<<name<<endl;

}

return 0;

}

7 0

3 years ago

Implement a Breadth-First Search of the people in the network who are reachable from person id 3980. You can implement BFS with

Gnoma [55]

Answer:

Check the explanation

Explanation:

import java.io.File;

import java.io.FileNotFoundException;

import java.util.LinkedList;

import java.util.Scanner;

import static org.junit.Assert.assertEquals;

/**

* CS146 Assignment 3 Node class This class is used for undirected graphs

* represented as adjacency lists The areFriends() method checks if two people

* are friends by checking if an edge exists between the two

*

*/

public class NetworkAdjList {

// Initialize array with max number of vertices taken from SNAP

static int max_num_vertices = 88234;

static LinkedList<Integer>[] adjacencyList = new LinkedList[max_num_vertices];

public static void createAdjacencyList() {

// Initialize array elements

for (int j = 0; j < max_num_vertices; j++) {

adjacencyList[j] = new LinkedList<Integer>();

}

// Get file path of the 3980.edges file

String filePath = "C:\\Users\\shahd\\Documents\\CS146\\Assignment 3\\Question 3\\Question3\\src\\a3\\3980.edges";

File f = new File(filePath);

// Use Scanner to read edges from the file and put it into adjacency list

int a;

int b;

try {

Scanner fileIn = new Scanner(f);

while (fileIn.hasNext()) {

a = fileIn.nextInt();

b = fileIn.nextInt();

adjacencyList[a].add(b);

adjacencyList[b].add(a); // We need to add the edges both ways

}

} catch (FileNotFoundException e) {

e.printStackTrace();

}

public static boolean areFriends(int A, int B) {

// If the adjacency list contains (A, B) edge, then return true, else false

if (adjacencyList[A].contains(B)) {

return true;

} else {

return false;

}

private static void bfsHelper(boolean visited[], int currentNode, int dis, int sourceNode) {

dis++;

if(!visited[currentNode]) {

visited[currentNode] = true;

for(int neighbor: adjacencyList[currentNode]) {

System.out.println(neighbor + " is at a distance of " + dis + " from " + sourceNode);

bfsHelper(visited, neighbor, dis++, sourceNode);

}

public static void BFStraversal(int start) {

boolean visited[] = new boolean[max_num_vertices];

bfsHelper(visited, start, 0, start);

}

public static void main(String[] args) {

/**

* These test cases assume the file 3980.edges was used

*/

createAdjacencyList();