数据结构课设电梯模拟——绝对原版,给我好评啊(外国英文资料).doc

数据结构课设电梯模拟——绝对原版,给我好评啊(国外英文资料) / * 10, elevator simulation (5) See the internship section of the problem set, P102 2.8 Added: the Weight of the lift, the time-spent time (30t) for each layer. People: random, assuming that every once in a certain time (n seconds) randomly generated (n seconds later to see if there is another person also is random), in which he is randomly generated the various states. Elevator: just as in real life: when it is on the rise, the person who passes the floor will not open the elevator Algorithm thought: the elevator of the stack is allowed to jump the queue (going together is the person who is) tree, queue is also can jump the queue (people together to peer), If he is impatient with waiting, leave it out. * / # include stdio, h # include stdlib. H H # include map. # define ElemType Personp # define Height 5 / / level Height / / # define Weight 15 / / lift is the maximum Weight # define T 0.1 / / the unit of analog clock (1 for 0.1 second) Double rectime = 0; Typedef struct { Int num. / / mark the persons name Int now; / / the current floor Int des; Double patience; / / maximum wait time (from the elevator door to the elevator) } Person, * Personp; # define open 20 * T / / the time needed for the elevator The time required by the # define close 20 * T / / the elevator # define search 40 * T / / each time that someone passes an elevator # define speed 30 * T / / # define walk 25 * T / / the time it takes to get through the elevator The # define wait 300 * T / / elevator wait time, go beyond that to the first floor The # define per 100 * T / / randomly generates one person at a time / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / stack (the first element is empty) Typedef struct node { ElemType date; Struct node * next; } SNode, * Stackp; / / stack Void InitStack (Stackp top) / / set up the stack (operator and number Shared) { SNode *) malloc (sizeof); Top - next