public int[] nClosest(int inputN, int StartingID) {
    	//inputN = 5;
        int queueN = inputN + 1 ; 
        int closev = StartingID ;
        int [] resultG = new int[queueN];
        
        if (!queue1.isEmpty()) {
     	      
     	   for (int i=0;i< queueN;i++) {
     		   
     		        closev =queue1.dequeue();
     		        resultG[i] = closev; // the first key is the source itself
     	   			
     	   }		
        } else  
        	System.out.println("emply Queue.");
        
        return resultG;
       
    }