To finalize the degree centrality, let us take a look at the undirected graph, but now based on weighted links. It also changes the way proc network computes the degree centrality and the outcomes for nodes and links datasets. Write The code executes proc network to compute the degree centrality for the undirected graph based on weighted links.

Discuss the differences between the array implementation and the linked list implementation of queues.  Describe the advantages and disadvantages of each implementation.

Comparing the Unsorted and Sorted Linked List implementations, the "Put Item" overall seems to be less efficient for the Sorted List. Why is this?

Implement the Linked List using head and tail pointer. Interface (.h file) of LinkedList class is given below. Your task is to provide implementation (.cpp file) for LinkedList class. Interface: template<class Type> class LinkedList { private: Node<Type>* head;               Node<Type>* tail; <Type> data; public:                 LinkedList<Type>(); LinkedList<Type>(const LinkedList<Type> &obj); void sortedInsert(Type); Type deleteFromPosition(int position); //deletes the node at the particular position Type delete(int start,int end); //deletes the nodes from starting to ending position bool isEmpty()const; void print()const; ~LinkedList(); };   program in c++.

Describe a method for finding the middle node of a doubly linked list with header and trailer sentinels by “link hopping,” and without relying on explicit knowledge of the size of the list. In the case of an even number of nodes, report the node slightly left of center as the “middle.” What is the running time of this method? Hint: Consider a combined search from both ends. Also, recall that a link hop is an assign- ment of the form ”p = p.getNext( );” or ”p = p.getPrev( );”.

Because of the nature of a set, the Set interface may be implemented using a variety of other collections or data structures. Describe how you would use a LinkedList to implement the Set interface. Discuss the advantages and disadvantages of this method.

For a weighted graph, each edge is an instance of WeightedEdge.    a. WeightedEdge is an interface that must be implemented differently depending on the data type of the weights on the edges.   b. WeightedEdge is a subtype of Edge.   c. WeightedEdge implements the Edge interface.   d. WeightedEdge is a subclass of AbstractEdge.

Think about the disadvantages of an adjacency list representation for a weighted graph.

Given two (singly) linked lists, determine if the two lists intersect. Return the intersecting node. Note that the intersection is defined based on reference, not value. That is, if the kthnode of the first linked list is the exact same node (by reference) as the jth node of the secondlinked list, then they are intersecting.