public Dijkstra(HashMap<Node, HashSet<Edge>> graph, Node fromNode, Node toNode, boolean heuristic)
	{
		this.graph = graph;
		this.fromNode = fromNode;
		this.toNode = toNode;
		edgeTo = new HashMap<>();
		for (Node node : graph.keySet())
		{
			node.setDistTo(Double.POSITIVE_INFINITY);
			node.setHeuristic(Double.POSITIVE_INFINITY);
		}
		pQueue = new PriorityQueue(1, new NodeDistToComparator());
		createRoutes(heuristic);
	}