Write a LISP function, outdegree, of two arguments, a node and the graph, which returns the outdegree of the node. (the outdegree of a node, k, is the number of arcs coming out of the node, i.e. # of arcs that have the node k as a source). The graph is represented by the adjacency list representation.

Write a LISP function, outdegree, of two arguments, a node and the graph, which returns the outdegree of the node. (the outdegree of a node, k, is the number of arcs coming out of the node, i.e. # of arcs that have the node k as a source). The graph is represented by the adjacency list representation.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 5SA

See similar textbooks

Similar questions

A- Declare a self-referential structure for a linked list having one data StudentNode field called GPA (float), and one pointer to StudentNode called next. B- Write a non-recursive function - that counts all the GPAS that are less than or equal to 2 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should return 3. C- Write a recursive function that prints all the GPAS that are higher or equal to 3.5 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should print: 3.5->4.
Write a function that collects information from the user about a graph and builds an adjacency list representation of the graph; incorporate this function in the programs requested. Input: Information about a graph (see instructionsabove) and a node in the graphOutput: Nodes in a depth-first search of the graphbeginning with the given node
Please write Lisp code for the following problem. Consider the list:((name (number1 nation)) (MusicPurchasedNorway) (Pressfreedom Norway) (NobelLiterWinners France)(MovieTixHighPrices Switzerland))write a function to access the MovieTixHighPricesvalue using carand cdr.2 (Your function should work on any property list with this set of properties in this order.)
Write a lisp function f9 that removes duplicates from a list. Example: (f9 ‘(c (a b) c d (a b))) returns (c (a b) d) should mainly just use cond car and cdr
This is assignment used C++. Develop a linked-list processing function, IsolateTargetSoloAsTail, to process a linked list as follows. ● If a target cannot be found on the given list, a new node containing the target is created and added to the list's end (made the new tail node). ► This includes the case where the given list is empty, in which the new tail node added is also the new head node. (This is so because the only node in a 1-node list is the list's head and tail node.) ● If the target appears only once on the given list, the target-matching node is moved to the list's end (made the new tail node). ► Nothing needs to be done if the target-matching node is already the tail node (of the given list). ● If the target appears multiple times on the given list, the first target-matching node is moved to the list's end (made the new tail node), and all other target-matching nodes are to be deleted from the list. ► Note that although…
Write a LISP function f10 that finds the intersection of two lists. The intersection meansthe common elements of the two lists. Example: (f10 ‘(a (a b) c d) ‘(b(a b) d)) returns ((a b) d) CAN ONLY USE CAR AND CDR AND RECURSION SETQ AND DO LIST CANT BE USED
3. Write a LISP function, call it "count", of two arguments, an atom x and a list L of sub-lists, which returns the number of sub-lists in L that contain the atom x. Use recursion. example: > (count 'b ( (ab c) (b c d) (c a) (d ab c)) ). Returns: 3 > (count 'd '((a b) (b) (c a))) Returns: 0
please complete the following in JAVA Implement the graph ADT using the adjacency list structure. thanks! also posting a similar question for adjacency matrix. have a good day!
Turn the linked list implementation into a circular list: Have the previous pointer of the first node point to the last node, and the next pointer of the last node point to the first node. Then remove the last pointer in the List class because the value can now be obtained as first->previous. Reimplement the member functions so that they have the same effect as before. please use linked list. programming language c++
Write a Common Lisp function that does the following: returns (circle i) if i is a number returns (create-list i-4) if i is a non-numeric atom returns (front-or-back i) if i is a list Please show output as well!
A- Declare a self-referential structure StudentNode for a linked list having one data field called GPA (float), and one pointer to StudentNode called next. B- Write a non-recursive function that prints all the GPAS that are less than or equal to 2 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should print: 1.9->2->1.8. C- Write a recursive function that counts all the GPAS that are higher or equal to 3.5 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should return 2.
Write a program (WAP) in c/c++ to create an undirected graph using adjacency list representation. Number of nodes and edges should be taken from the user. After creating the graph, perform following operations:(i) Search a node. Take the node number from the user. If the node is found then print its associated edges.(ii) Insert a node in the graph. (iii) Insert an edge in the graph. Take the node numbers from the user between which the edge is to be inserted.(iv) Delete a node from the graph. Take the node number to be deleted from the user.(v) Apply DFS on the graph and print the graph traversal.(vi) Apply BFS on the graph and print the graph traversal