def depthfirst(node): #depth first search function if node not in visited: visited.append(node) for neighbour in graph[node]: depthfirst(neighbour) def findpath(): # function to find the path path = [] for i in range(len(visited)-1): if is adjacent(visited[i], visited[i+1]): path.append(visited[i]) else: path.append(visited[i]) for j in range(len(path)-1, -2, -1): path.append(path[j-1]) if is_adjacent(path[j-1], break path.append(visited[-1]) return path def is_adjacent(node1, node2): #funnction to check if 2 nodes are adjacent if nodel in graph[node2]: return True else: return False graph={ 1: [2,3], 2: [1,3], 3: [1,2,5, 4], 4: [6,11,3,5], 5: [7,4,3], 6: [8,4], 7: [5,9], 8: [6], 9: [7,10], 10: [9,12], 11: [12,4], 12: [10,11] } visited[i+1]): visited = 0 start = int(input("Enter starting node: ")) depthfirst(start) path = findpath() #print path print(*path, sep= '->')

def depthfirst(node): #depth first search function if node not in visited: visited.append(node) for neighbour in graph[node]: depthfirst(neighbour) def findpath(): # function to find the path path = [] for i in range(len(visited)-1): if is adjacent(visited[i], visited[i+1]): path.append(visited[i]) else: path.append(visited[i]) for j in range(len(path)-1, -2, -1): path.append(path[j-1]) if is_adjacent(path[j-1], break path.append(visited[-1]) return path def is_adjacent(node1, node2): #funnction to check if 2 nodes are adjacent if nodel in graph[node2]: return True else: return False graph={ 1: [2,3], 2: [1,3], 3: [1,2,5, 4], 4: [6,11,3,5], 5: [7,4,3], 6: [8,4], 7: [5,9], 8: [6], 9: [7,10], 10: [9,12], 11: [12,4], 12: [10,11] } visited[i+1]): visited = 0 start = int(input("Enter starting node: ")) depthfirst(start) path = findpath() #print path print(*path, sep= '->')

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Node* temp=new node(); if(temp==0) return 0; return 1; we can use this to check if the linked queue is full or not Select one: True False
Consider the following linked list C++ code: - struct node { int data; struct node *next; }start = NULL; struct node *new_node; Select one: а. new_node=(struct node *)malloc(sizeof(struct node)); b. Non of Above C. new_node=(struct node)malloc(sizeof(struct node)); new_node=(struct *)malloc(sizeof(struct node)); d. new_node=(struct node *)malloc((struct node));
The reference to the next node in a linked list is referred to as a(n) -------------
ADT Graph Iterator: Create either a DFS graph iterator or a BFS graph iterator by implementing java.util.lterator interface. An ADT graph iterator should have a reference to an ADT graph. It should also have a DFS search method or a BFS search method.
Consider the following function:int mystery(NodeInt32* node){int counter = 0; while (node != NULL) {counter++;node = node->next; } return counter;}
typedef struct node{int data;struct node *left,*right;}BST;The node structure of BST is shown above. Please design an efficient algorithm to return the maximum keyword value in BST. Completion function: int findmax (BST *T)
Question 3 public E unknown() { Node pt1,pt2; if (head != null) { pt1=head; pt2= getNode(size-1); if (pt1.data.equals(pt2.data)) return getNode(size/2).data; else return pt1.data; } A It returns half of the data of the last node in the list or the data of the first node B It returns half of the data of the last node in the list or the data of the last node in the list C It returns the data of the middle node in the list or the data of the first node It returns the data of the middle node in the list or the data of the last node in the list
Given the following definition for a LinkedList: // LinkedList.h class LinkedList { public: LinkedList(); // TODO: Implement me void printEveryOther() const; private: struct Node { int data; Node* next; }; Node * head; }; // LinkedList.cpp #include "LinkedList.h" LinkedList::LinkedList() { head = nullptr; } Implement the function printEveryOther, which prints every other data value (i.e. those at the odd indices assuming 0-based indexing).
In a linked list, devise an approach that will remove all nodes with the same key.
Exercise 2 Given the following function to update a node in a standard linked list:public boolean update(Node head, int oldValue, int newValue){if (head == null)return false;while (head != null)if (head.data == oldValue){head.data = newValue;return true;}elsehead = head.next;return false;}There may be an error with the code. Answer the following:1) Design your own linked list of 4 nodes with different values2) If the code has an error, describe the issue and provide an example of calling theupdate function with values of your choice and show what the linked list looks likea. Also, show the code changes you would make to fix the error3) If the code does not have an error, provide an example of calling the update functionwith values of your choice and show what the linked list looks likeFor example, if your linked list was 1 -> 2 -> 3 -> 4, and you think there is an error withthis code, you could say something like “the problem with the code is xxx and after callingupdate(3, 5),…
Computer Science Exercise: shape [★★★] Write a function same_shape : 'a tree -> 'b tree -> bool that determines whether two trees have the same shape, regardless of whether the values they carry at each node are the same. Hint: use a pattern match with three branches, where the expression being matched is a pair of trees. please use Ocaml for the coding
Course Data Structure And Algorithum Question : Complete the following method in the LinkedList class. The method contains is supposed to return true if the there is a node in the list that is equal to the given Comparable key. You can assume the Node class has the public fields, data (a Comparable) and next (a pointer to another Node). public boolean contains(Comparable key) {