This project contains the coding of three solutions to perform a bfs search on a dag, namely, a sequential version and two parallel versions: the former uses standard cpp thread, while the latter uses ...

WBFS -worker breadth first search- scans the entire set of vertices exhaustively at each iteration to determine the current frontier QBFS -queue breadth first search- maintains a global frontier and ...