public int[] getReversePath(int[] path) 
	{
		int[] reversePath = new int[path.length];

		for (int i = 1; i < reversePath.length; i++)
			reversePath[i-1] = path[path.length - 1 - i];

		reversePath[reversePath.length-1]=nodeStartedFrom;
				
		return reversePath;
	}