public void printShortestPath() {
		int vertex = 0;
		int nextV = 0;

		Iterator<Integer> it = shortestPath.keySet().iterator();
		while (it.hasNext()) {
			vertex = it.next();
			System.out.print(vertex + ":");
			LinkedList<Integer> pathV = shortestPath.get(vertex);
			for (int i = 0; i < pathV.size(); i++) {
				nextV = pathV.get(i);
				System.out.print(nextV + ",");
			}
			System.out.println();
		}
	}