omp.c

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <omp.h>

#include "include/graph.h"
#include "include/queue.h"


bool bfs_OMP(Graph *g, int startVertex, int targetVertex, int numThreads) {
    bool visited[g->vertexCount];
    int i, j;
    for (i = 0; i < g->vertexCount; i++) {
        visited[i] = false;
    }

    Queue q;
    initQueue(&q);

    visited[startVertex] = true;
    enqueue(&q, startVertex);

    bool found = false; 

    while (!isQueueEmpty(&q)) {
        int currVertex = dequeue(&q);

        #pragma omp parallel for num_threads(numThreads) shared(found)
        for (j = 0; j < g->vertexCount; j++) {
            if (g->adjMatrix[currVertex][j] == 1 && !visited[j]) {
                visited[j] = true;
                enqueue(&q, j);
                if (j == targetVertex) {
                    found = true;
                }
            }
        }

        if (found) {
            break; 
        }
    }

    return found;
}