public int findPath(int beginning, int target, Oergi oergi) {
		this.path = new ArrayList<Integer>();
		
		this.oergi = oergi;
		prioritizeVortexes(beginning);
		
		while (!vortexHeap.isEmpty()) {
			Vortex closestVortex = vortexHeap.remove();
			if (closestVortex.getId() == target) {
				backtrackPath(closestVortex);
				return closestVortex.getDayDistance() + 1;
			}
			ArrayList<Integer> neighbors = closestVortex.getNeighbors();
			ArrayList<Integer> paths = closestVortex.getPaths();
			for (int i=0; i<neighbors.size(); i++) {
				relax(closestVortex, paths.get(i), neighbors.get(i));
			}
		}
		
		return -1;
	}