public List<Edge> getDirections(Node to)
	{

		directionKeys.clear();
		Node[] route = calculateRoute(to).toArray(new Node[calculateRoute(to).size()]);
		//HashMap<String, Double> directions = new HashMap<>();
		List<Edge> listToReturn = new ArrayList<>();

		for (int i = 0; i < route.length; i++)
		{
			int next = 0;
			if (!(i + 1 == route.length))
			{
				next = i + 1;
			}
			HashSet<Edge> edges = graph.get(route[i]);
			//System.out.println(edges.size());
			for (Edge edge : edges)
			{
				if ((edge.getFromNode().equals(route[next]) || edge.getToNode().equals(route[next])))
				{
					listToReturn.add(edge);
					directionKeys.add(edge.getRoadName());
				}
			}
		}
		//System.out.println("Directions size " + directions.size());
		return listToReturn;
	}