public static int[]  FindShortPath(weighted w, int first, int second){
		
		int Path[] = new int[1];
		
		w.Path = new int[w.size()]; // Shortest Path and distance of that. 
		
		System.out.print("Processing Path...");
		w = count_Point(w,first,-1,second,Path,0);
		System.out.println(" ... Path Found!!");

		
		System.out.println(" ");
		System.out.println(" # ");
		
		for (int i = 0;i < w.Path.length;i++){
			System.out.print(" ");
			System.out.print(w.Path[i]);
		}
		
		return w.Path;
		
	}