Posted By

mdzeko on 12/03/11

Tagged

Versions (?)

Last Edited at 12/03/11 08:26am

Statistics

Viewed 510 times

Favorited by 0 user(s)

Related snippets

red_pokazivac.h

/ Published in: C++

naknadno dodana biblioteka zaglavlja red_pokazivac.h

Expand | Embed | Plain Text

Copy this code and paste it in your HTML

#include<iostream>
struct tpacijent
{
  int cek, traj, prioritet, redni;
  tpacijent *next;
};
 
struct tred
{
  tpacijent *front;
  tpacijent *rear;
};
 
/////////////////////////////////////
 
tred* InitQ(tred *q)
{
      q = new tred;
      q->front = new tpacijent;
      q->front->next = NULL;
      q->rear = q->front;
      return q;
}
 
/////////////////////////////////////
 
bool IsEmptyQ(tred *q)
{
  if(q->front==q->rear)
  return 1;
  return 0;
}
 
/////////////////////////////////////
 
tpacijent FronQ(tred *q)
{
          if(!IsEmptyQ(q)) 
          return *q->front->next;
}
 
/////////////////////////////////////
 
void EnQueueQ(tpacijent x, tred *q)
{
  tpacijent *novi = new tpacijent;
  memcpy(novi,&x,sizeof(tpacijent));
  novi->next = NULL;
  if(IsEmptyQ(q))
  {
                 q->front->next = novi;
                 q->rear = novi;
  } 
  else 
  {
       q->rear->next = novi;
       q->rear = novi;
  }
}
 
/////////////////////////////////////
 
bool DeQueueQ(tred *q)
{
  if(IsEmptyQ(q)) 
  return false;
  tpacijent *first = q->front->next;
  if(first->next)
  q->front->next = first->next;
  else
  q->front = q->rear;
}

Report this snippet Tweet

Comments

Subscribe to comments

Comment:

You need to login to post a comment.