IN 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 methodthe method signature is below public Map<String, Double> dijkstra(String start);Class that this method is in is belowpublic class GraphImpl implements Graph { Map<String, Node> 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; } please and thank you

This is to find the shortest path in graph. its a searching algorithm.

Answered: N java Make a dijkestra algorithm…

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

Related questions

Question

IN 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<String, Double> dijkstra(String start);

Class that this method is in is below

public class GraphImpl implements Graph {
	Map<String, Node> 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;
	}