Posted By

dsitum1 on 12/03/11

Tagged

Versions (?)

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

Statistics

Viewed 438 times

Favorited by 0 user(s)

Related snippets

red_pokazivac.h

/ Published in: C++

Implementacija reda uz pomoÄ‡ pokazivaÄa

Expand | Embed | Plain Text

Copy this code and paste it in your HTML

struct tpacijent
{
    int x,y,prioritet;
    tpacijent *sljedeci;
};
 
struct tred
{
    tpacijent pacijent;
    tred *sljedeci;
};
 
struct tpok
{
    tred *front, *rear;
} pok;
 
 
tpacijent frontQ(tred *Q)
{
    tred *first = Q->sljedeci;
    return first->pacijent;
}
 
void enqueueQ(tpacijent pacijent, tred *Q)
{
    tred *novi = new tred;
    novi->pacijent = pacijent;
    novi->sljedeci=pok.front;
 
    tred *rear = pok.rear;
    rear->sljedeci = novi;
    pok.rear = novi;
}
 
void dequeueQ(tred *Q)
{
    tred *brisi = Q->sljedeci;
    if (brisi == pok.rear) pok.rear = Q;         //ako smo obrisali zadnji element potrebno promijeniti i pok.rear
    Q->sljedeci = brisi->sljedeci;
    delete brisi;
}
 
bool isemptyQ(tred *Q)
{
    if (pok.front == pok.rear) return true;
    else return false;
}
 
tred *initQ(tred *Q)
{
    Q = new tred;
    Q->sljedeci=Q;
    pok.front=Q;
    pok.rear=Q;
    return Q;
}

Report this snippet Tweet

Comments

Subscribe to comments

Comment:

You need to login to post a comment.