N java  Make a dijkestra algorithm that is efficient with large data sets  Runs Dijkstra's algorithm on the graph, starting at the node specified by the start parameter.   * Return a map where the key is the name of the node and the value is the distance from the start node.   * The start node should be included in the returned map, with the value 0 as the distance.   *   * @param start - a5.Node to start Dijkstra's algorithm at   * @return Map of all the nodes in the graph and the distance to the start a5.Node.   */ these is the description of the method the method signature is below  public Map dijkstra(String start); Class  that this method is in is below public class GraphImpl implements Graph {   Map nodes; //do not delete, use this field to store your nodes   // key: name of node. value: a5.Node object associated with name   privateinttotaledges;       publicGraphImpl() {   nodes = newHashMap<>();   totaledges = 0;   }

Sorting  Create a MyLinkedList class with inner Node class, data fields, and the insert(element) method.  Implement a toString method to return all nodes in MyLinkedList.  Implement a recursive sorting and a non-recursive sorting method.

Below you're given a Node class and a LinkedList class. You will implement a method for the LinkedList class named "delete48in148". That is, whenever there is a sequence of nodes with values 1, 4, 8, we delete the 4 and 8. For exCample, Before: 1 -> 4 -> 8 LAfter: 1 Before: 7 -> 1 -> 4 -> 8 -> 9 -> 4 -> 8 After: 7 -> 1 -> 9 -> 4 -> 8 Before: 7 -> 1 -> 4 -> 8 -> 4 -> 8 -> 4 -> 8 -> 9 After: 7 -> 1 -> 9 Note from the above example that, after deleting one instance of 48, there may be new instances of 148 formed. You must delete ALL of them. Requirement: Your implementation must be ITERATIVE (i.e., using a loop). You must NOT use recursion. Recursive solutions will NOT be given marks. import ... # No other import is allowed

Send me your own work not AI generated response or plagiarised response. If I see these things, I'll give multiple downvotes and will definitely report.

Our hash map's data is stored in a LinkedList due to its design. A hash map's usefulness decreases.

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).

Using the graph in the question: Write Java code to create an Adjacency Matrix M to represent the graph. Write Java code to create an Adjacency List L to represent the graph.