A parallel implementation of DFS for Directed Acyclic Graphs (https://research.nvidia.com/publication/parallel-depth-first-search-directed-acyclic-graphs)
Why do you think that https://github.com/bloomen/gcl is a good alternative to parallel-dfs-dag