public void findShortestPath(){
		
		for(int i = 0; i < locCount; i++){
			for(int j = 0; j < locCount; j++){
				shortestPath[i][j] = matrix[i][j];
			}
		}
		
		for(int j = 0; j < locCount; j++){
			shortestPath[j][j] = 0;
		}
		
		
		for(int k=0;k<locCount;k++){
			for(int i=0;i<locCount;i++){
				for(int j=0;j<locCount;j++){
					if(shortestPath[i][j]<(shortestPath[i][k]+shortestPath[k][j])){
						shortestPath[i][j] = shortestPath[i][j];
					}
					else{
						shortestPath[i][j] = (shortestPath[i][k]+shortestPath[k][j]);
					}
				}
			}
			
		}		
	}