银行家算法实验报告(12)

for(i=0;i<M;i++){ apply=0;

for(j=0;j<N;j++){

if (Finish[i]==False&&Need[i][j]<=Work[j]) {

apply++; if(apply==N)

{ cout<<" "<<i<<" "; for(d=0;d<N;d++)

cout<<Work[d]<<" "; cout<<" ";

for(d=0;d<N;d++) cout<<Need[i][d]<<" "; cout<<" "; for(d=0;d<N;d++) cout<<Allocation[i][d]<<" "; cout<<" "; for(m=0;m<N;m++) {

Work[m]=Work[m]+Allocation[i][m]; cout<<Work[m]<<" ";

}//变分配数 Finish[i]=True; temp[k]=i; cout<<" ";