银行业务模拟(c源代码)

{
Event *p;
Event *q0;
Event *q;
p=head;p=p->next->next;q=head;q0=head;q=q->next;
while(p!=null)
{
if(q->occuitime>=p->occuitime)
{
int Lenth;
Event *p;
p=head;
p=p->next;
Lenth=GetEventLenth(head);
if(Lenth>0)
{
while(p!=null)
{
printf("事件发生事件：%d，事件类型：",p->occuitime);
if(Lenth==0)
head->next=q;
else
{
q->next=head->next;
head->next=q;
sortEnvetList(head);
}
return(head);
}
void DelEventHead(Event *head)
Creat4Window(Q);
float averagetime,a,b;
Bank_Simulation(head,Q);
// printf("平均逗留时间是：%f",averagetime);
printf("\n\n*******************银行业务模拟系统***********************\n\n\n");
int occuitime;
int eventtype;
top=(Event *)malloc(sizeof(Event));
OpenForDay(head);
while(GetEventLenth(head)!=0)
{
top=EventHead(head);kkk=(top->eventtype)%10;
{
int Lenth;
Event *p;
p=head;
p=p->next;
Lenth=GetEventLenth(head);
if(Lenth>0)
head->next=(head->next)->next,free(p);
}

void PrintEventList(Event *head)
void Creat4Window(Queue *Q[5]); //4个窗口创建
int GetShortQueue(Queue *Q[5]); //得到最短的 队列
void Bank_Simulation(Event *head,Queue *Q[5]); //模拟银行业务函数
{
int time=0,arrivetime;
int a,b,t;
arrivetime=GetTOpQueue(0,*(Q+num));
t=occuitime-arrivetime;
DeQueue(*(Q+num));
TotalTime=TotalTime+t;
if(GetQueueLenth(*(Q+num))!=0)
typedef struct Event{ //事件表 类型
int occuitime;
int eventtype; //0代表到达，1代表离开
struct Event *next;
}Event;
typedef struct QueueElem{ //队列 元素 类型
printf(" CustomerNum=%d\n",CustomerNum);
printf(" TotalTime=%d\n",TotalTime);
averagetime=(float)TotalTime/CustomerNum;
printf(" 平均逗留时间为：%0.2f\n",averagetime);
num=(top->eventtype)/10;
occuitime=top->occuitime;
DelEventHead(head);
if(kkk==0)
CustomerArrived(occuitime,Q,head);
else
CustomerDeparture(occuitime,num,head,Q);
if(p->eventtype==0)
printf("客户到达\n");
else if(p->eventtype==1)
printf("客户离开\n");
p=p->next;
}
}
else
printf("事件是空的！\n");
}
void sortEnvetList(Event *head)
}Queue; // 银行 窗口 队列
int CustomerNum=0; //总时间
int TotalTime=0; //总人数
Event *createventlist(Event *head); //创建 事件列表
//次代码是，数据结构（严蔚敏 吴伟民）第3章关于银行业务模拟算法的实现，可直接拷贝到VC6.0中运行
# include <stdio.h>
# include <malloc.h>
# include <stdlib.h>
# define null 0
# define closetime 100 //营业时间，可以自定义
Event *EventHead(Event *head)
{
Event *p=null;
int Lenth;
Lenth=GetEventLenth(head);
if(Lenth>0)
p=head->next;
return(p);
}
Event *addEvent(Event *head,int occuitime,int eventtype)
{
int Lenth;
Event *p;
Event *q;
q=(Event *)malloc(sizeof(Event));
q->occuitime=occuitime;
q->eventtype=eventtype;
q->next=null;
Lenth=GetEventLenth(head);
void CustomerDeparture(int occuitime,int num,Event *head,Queue *Q[5]);
void OpenForDay(Event *head);
Queue *CreatQueue(); //队列有关操作
void EnQueue(int arrivetime,int durationtime,Queue *head);
int arrivetime;
int durationtime; // 业务 所需办理 时间
struct QueueElem *next;
}QueueElem;
typedef struct{
QueueElem *front;
QueueElem *rear;
void OpenForDay(Event *head,Queue *Q[5]); //初始化
void main()
{
Event *head;
head=createventlist(head); //将 事件 加入到 事件列表
Queue *Q[5];
{
a=GetTOpQueue(1,*(Q+num));
b=a+occuitime;
addEvent(head,b,(num*10+1));
}
}
//******************事件表的操作，即链表的操作**********************************************************
void DeQueue(Queue *head);
void PrintQueue(Queue *head);
int GetQueueLenth(Queue *head);
int GetTOpQueue(int flag,Queue *head); //falg为0代表返回arrivetime，1代表返回durationtime;
{
int i=0; // i 为事件表 的 长度
Event *p;
p=head;
p=p->next;
while(p!=null)
{
p=p->next;i++;
}
// printf("iiii=====%d\n",i);
return(i);
}
Event *createventlist(Event *head)
{
head=(Event *)malloc(sizeof(Event));
if(head)
head->next=null;
return(head);