Future Event LIST (Simulation & Modeling) (Linked list Implementation)

by Himanshu Singla

#include
#include
#include

int inter[9] = {1,1,6,3,7,5,2,4,1};
int service[9] = {4,2,5,4,1,5,4,1,4};
int i=0,j=0;

struct eventinfo
{
int type;
int time;
struct eventinfo *next;
} * header;


void addevent(int time, int type)
{
struct eventinfo * node = (struct eventinfo *)malloc(sizeof(struct eventinfo));
struct eventinfo *p, *q;
node->type = type;
node -> time = time;

if(header->next == NULL)
{
header ->next = node;
node->next = NULL;
return ;
}
p = header->next;
q = header;
while((p->timenext;
}
q->next = node;
node -> next = p;

}
void print()
{
struct eventinfo * p = header->next;
while(p!=NULL)
{
//printf("\n");
if(p->type ==1)
printf("(A,");
else
printf("(D,");
printf("%d)",p->time);
p =p->next;


}
}
void depart()
{
int nexttm;
struct eventinfo * node = header->next;
header -> next = node->next;
nexttm = node->time+service[j++];
header->type = 1;
if(header->next != NULL && i>=j)
addevent(nexttm,0);
else
{
header->type =0;
j--;
}
//else server is idle
printf("departure ");
print();

}
void arrival()
{
struct eventinfo *node;
int nexttm;
node = header->next;
header->next = node ->next;
nexttm = node->time + inter[i++];
addevent(nexttm,1);
if(header->type == 0)
{
nexttm = node->time + service[j++];
//printf(" next depart = %d service = %d",nexttm, j-1);
addevent(nexttm,0);
header->type = 1;
}
printf("arrival ");
print();
}
void main()
{

int t, eventtime;

clrscr();
header = (struct eventinfo *) malloc(sizeof(struct eventinfo));
header ->time=0;
header->next = NULL;
header->type = 0;


t =0;
addevent(0,1);
eventtime = header->next->time;
while(t<=60){if(t == eventtime){printf("\n t = %d\t",t);if(header->next->type ==1)
arrival();
else
depart();
if(header->next != NULL)
eventtime = header->next->time;
else
eventtime = 100;
if(i>=9 || j>=9)
eventtime = 100;
}
t++;
if(t>eventtime)
t = eventtime;
}

getch();
}