parallel-dfs-dag
gcl
parallel-dfs-dag | gcl | |
---|---|---|
3 | 1 | |
44 | 62 | |
- | - | |
3.9 | 3.1 | |
about 3 years ago | 11 months ago | |
C++ | C++ | |
MIT License | MIT License |
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
gcl
What are some alternatives?
graphs-cpp - Weighted and unweighted graphs and digraphs with C++
idle - Idle is an asynchronous and hot-reloadable C++ dynamic component framework
BFS1 - a custom tuned bread first searcher
nodeeditor - Qt Node Editor. Dataflow programming framework
FXGraphAlgorithmSimulator - Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.
Taskflow - A General-purpose Parallel and Heterogeneous Task Programming System
Vc - SIMD Vector Classes for C++
Rstein.AsyncCpp - The RStein.AsyncCpp library is a set of types that should be familiar for anyone who knows the Task Parallel Library (TPL) for .NET (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.
breaking_cycles_in_noisy_hierarchies - breaking cycles in noisy hierarchies