B

BFS

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).

The goal of this project is to generate mazes (done in a reasonable amount of time), solve them (from 4 different ways and done in a reasonable amount of time), and print the solution.

Parallel Program for Breadth First Search (BFS) Push and Pull Variants Using OpenMP Atomic, OpenMP Critical, OpenMP Locks and GCC Atomics