Advanced Search

Posted By

fkuster on 12/01/11

Tagged

Versions (?)

Last Edited at 12/01/11 04:33am

Statistics

Viewed 363 times
Favorited by 0 user(s)

Related snippets

484
red_pokazivac.h
497
red_pokazivac.h
467
red_pokazivac.h
480
strukture 3 red_pokazivac.h
503
red_pokazivac.h
497
Cekaonica i pacjenti - red_pokazivac.h
510
red_pokazivac.h
510
red_pokazivac.h
496
red_pokazivac.h

red_pokazivac.h

/ Published in: C++
Save to your folder(s)
Zaglavlje za program.

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. struct pacijent {
  2.        int prior, x, y;
  3.        };
  4. struct qu {
  5.        pacijent el;
  6.        qu *next;
  7.        };
  8. struct que {
  9.        qu *front, *rear;
  10.        };
  11. que red;
  12.  
  13. pacijent FrontQ (que red_atp) {
  14.       return ((red_atp.front)->next)->el;;
  15. }
  16. void EnQueueQ (pacijent pac, que &red_atp) {
  17.      qu *novi=new qu;
  18.      novi->el=pac;
  19.      novi->next=NULL; 
  20.      (red_atp.rear)->next=novi;
  21.      red_atp.rear=novi;
  22. }
  23. void DeQueueQ (que &red_atp) {
  24.      qu *brisi=red_atp.front;
  25.      red_atp.front=(red_atp.front)->next;
  26.      delete brisi;
  27. }
  28. bool IsEmptyQ (que red_atp) {
  29.      if (red_atp.rear==red_atp.front) return true;
  30.      return false;    
  31. }
  32. void InitQ (que &red_atp) {
  33.      qu *novi=new qu;
  34.      novi->next=NULL;
  35.      red.rear=novi;
  36.      red.front=novi;     
  37. }

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.