public List<Integer> getShortedPath(Integer start, Integer stop) {
		dijkstra(start, stop);
		vertex.clear();
		distance.clear();

		Integer i = stop;
		ArrayList<Integer> path = new ArrayList<>();
		while(i != start && i != null) {
			i = predecessors.get(i);
			if(i != null && !i.equals(start)){
				path.add(i);
			}
		}
	
		return path;
	}