Breadth-First-Search/queue.c at main · Keeththi2003/Breadth-First-Search · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include "queue.h"


Queue *createQueue(int noOfVertex)
{
    Queue *q = (Queue *)malloc(sizeof(Queue));
    q->vertex = (int *)malloc(sizeof(int) * noOfVertex);
    q->front = 0;
    q->rear = 0;
    q->noOfVertex = noOfVertex;

    return q;
}

bool isEmpty(Queue *q)
{
    if (q->front == q->rear)
    {
        return 1;
    }
    return 0;
}

bool isFull(Queue *q)
{
    if (q->rear == q->noOfVertex)
    {
        return 1;
    }
    return 0;
}
void enqueue(Queue *q, int value)
{
    if (isFull(q))
    {
        printf("Queue is Full\n");
    }
    else
    {

        q->vertex[q->rear] = value;
        q->rear++;
    }
}

int dequeue(Queue *q)
{
    int vertex;
    if (isEmpty(q))
    {
        printf("Queue is Empty");
        return -1;
    }
    else
    {
        vertex = q->vertex[q->front];
        q->front++;
    }

    return vertex;
}

void freeQueue(Queue *q)
{
    if (q)
    {
        if (q->vertex)
        {
            free(q->vertex);
        }
        free(q);
    }
}