UPS远程监控解决方案.pdf

UPS远程监控解决方案

银行家算法的C语言实现

银行家算法的C语言实现 //head.h #include<iostream> #include <iomanip> using namespace std; #define Max 20 int res_num; //资源类：代表资源数目之用 class R { public: R(); int a; int b; int c; }; R::R() { a=0; b=0; c=0; } //数组类，存储安全序列之用 class Array { public: Array(); int array[Max]; int deep; R work; }; Array::Array() { int array[Max]={0}; deep=0; work.a=0; work.b=0; work.c=0; } //最大资源需求矩阵 void Get_Max(R* &res) { FILE *tp=fopen("Max.txt","r"); fscanf(tp,"%d\n",&res_num); cout<<"The process number is:"<<res_num<<endl; res=new R[res_num+1]; for(int i=1;i<=res_num;i++) { fscanf(tp,"%d\t%d\t%d\n",&res[i].a,&res[i].b,&res[i].c); } fclose(tp); } //已经得到的资源矩阵 void Get_Already(R* &res) { FILE *tp=fopen("Alloction.txt","r"); fscanf(tp,"%d\n",&res_num); //cout<<res_num<<endl; res=new R[res_num+1]; for(int i=1;i<=res_num;i++) { fscanf(tp,"%d\t%d\t%d\n",&res[i].a,&res