Posted By


maperokov on 11/22/10

Tagged


Statistics


Viewed 43 times
Favorited by 0 user(s)

red_pokazivac.h


/ Published in: C++
Save to your folder(s)



Copy this code and paste it in your HTML
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. struct zadatak{
  5. char pre_ime[30], transakcija[20];
  6. int god_rod;
  7. float stanje;
  8. };
  9. typedef zadatak element;
  10. struct tred{
  11. element R;
  12. tred *sljedeci;
  13. };
  14. struct tredt{
  15. tred *celo, *zacelje;
  16. };
  17. typedef struct tredt red;
  18. typedef struct tred *elementi;
  19. element FrontQ(red *r){
  20. if(r -> celo != r -> zacelje) return(r -> celo -> sljedeci -> R);
  21. else{
  22. cout << "Red je prazan!\n";
  23. exit(0);
  24. }
  25. }
  26. void EnQueueQ(element b, red *r){
  27. tred *novi = new tred;
  28. novi -> R = b;
  29. novi -> sljedeci = NULL;
  30. r -> zacelje -> sljedeci = novi;
  31. r -> zacelje = novi;
  32. }
  33. elementi Z;
  34. element DeQueueQ(red *r){
  35. if(r -> celo != r -> zacelje){
  36. Z = r -> celo;
  37. r -> celo = r -> celo -> sljedeci;
  38. }
  39. else{
  40. cout << "Red je prazan!\n";
  41. exit(0);
  42. }
  43. }
  44. int IsEmptyQ(red *r){
  45. if(r -> celo == r -> zacelje) return 1;
  46. else return 0;
  47. }
  48. red *InitQ(red *r){
  49. r = new red;
  50. tred *novi = new tred;
  51. r -> celo = novi;
  52. r -> zacelje = novi;
  53. novi -> sljedeci = NULL;
  54. return r;
  55. }

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.