parallel-dfs-dag
A parallel implementation of DFS for Directed Acyclic Graphs (https://research.nvidia.com/publication/parallel-depth-first-search-directed-acyclic-graphs) (by morpheusthewhite)
BFS1
a custom tuned bread first searcher (by RoyBellingan)
parallel-dfs-dag | BFS1 | |
---|---|---|
3 | 1 | |
44 | 0 | |
- | - | |
3.9 | 0.0 | |
about 3 years ago | about 4 years ago | |
C++ | C++ | |
MIT License | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
parallel-dfs-dag
Posts with mentions or reviews of parallel-dfs-dag.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-02-26.
BFS1
Posts with mentions or reviews of BFS1.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-02-26.
-
A C++ implementation of a parallel DFS, the best way of getting familiar with C++ concurrency and parallelism
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/
What are some alternatives?
When comparing parallel-dfs-dag and BFS1 you can also consider the following projects:
graphs-cpp - Weighted and unweighted graphs and digraphs with C++
FXGraphAlgorithmSimulator - Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.
Vc - SIMD Vector Classes for C++
ConcurrentDeque - Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17
xnetwork - simple graph library with slotmaps
post-order-heap - C++ implementation of post-order heap, as described by Harvery & Zatloukal. Adapted for heaps of any degree.
gcl - A graph concurrent library for C++
breaking_cycles_in_noisy_hierarchies - breaking cycles in noisy hierarchies