-
parallel-dfs-dag
A parallel implementation of DFS for Directed Acyclic Graphs (https://research.nvidia.com/publication/parallel-depth-first-search-directed-acyclic-graphs)
-
JetBrains
Tell us how you use coding tools. You may win a prize! Are you a developer or a data analyst? Share your thoughts about your coding tools in our short survey and get a chance to win prizes!
-
If you want to laught https://github.com/RoyBellingan/BFS1 This version was not the final, I also added streaming from a database of new vertex, to overcome some of the limit of https://mariadb.com/kb/en/oqgraph-storage-engine/
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a more popular project.
Related posts
-
Get familiar with graph algorithms and C++ concurrency with this parallel DFS implementation, based on an Nvidia paper
-
A C++ parallel implementation of DFS
-
Show HN: Coros – A Modern C++ Library for Task Parallelism
-
Pathfinding Algorithm Visualization Tool Written in Python
-
I created a library that provides a high level of abstraction for interfacing with rabbitmq