轮渡模拟（国外英文资料）.docVIP

轮渡模拟（国外英文资料） # include iostream. H # include stdlib. H The # include time.h / / this file contains the previous time function and the ctime function Typedef int ElemType; Struct LNode { ElemType data; / / domain LNode * next; / / link pointer fields }; Struct LinkQueue { LNode * front; / / head pointer LNode * rear; / / tail pointer }; Void InitQueue (LinkQueue Q) / / initialize the queue { Q.f ront = Q.r ear = NULL; } Void EnQueue (LinkQueue Q, ElemType item) / / insert an element into the queue { LNode * newptr = new LNode (); Newptr - data = item; Newptr - next = NULL; If (Q.r ear = = NULL) / / if the queue is empty, the new node is both the first and the end of the team Q.f ront = Q.r ear = newptr; Q.r ear - next = newptr; / / if the queue is not empty, the new node is linked to the back of the queue Q.r ear = newptr; } ElemType OutQueue (LinkQueue Q) / / remove an element from the queue { If (Q.f ront = = NULL) / / if the queue is empty, it terminates { Cout Empty! endl; The exit (1); } LNode * p; / / the first element of the queue to be returned P = Q.f ront; / / the first pointer to the recovery team ElemType a = p - data; / / make the first pointer to the next node Q.f ront = p - next; / / if the queue is empty after deletion, the tail pointer is empty If (Q.f ront = = NULL) Q.r ear = NULL; The delete p; Return a; / / the teams first element to be deleted } Void ClearQueue (LinkQueue Q) / / remove all elements from the queue and make it empty { LNode * b; / / give p to the hour B = Q.f ront; While (Q.f ront! = NULL) / / delete each element in the queue in turn { Q.f ront = b - next; The delete b; B = Q.f ront; } Q.r ear = NULL; / / the tail pointer is empty } Bool EmptyQueue (LinkQueue HQ) / / check that the queue is empty { Return HQ. Front = = NULL; } / / output the car number for this ferry Void Print (int a, int n) { Long t; T = time (0); / / the current machine system time is stored in t for seconds Cout endl; Cout the ferry beg