parallel-dfs-dag VS post-order-heap

Compare parallel-dfs-dag vs post-order-heap and see what are their differences.

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)

post-order-heap

C++ implementation of post-order heap, as described by Harvery & Zatloukal. Adapted for heaps of any degree. (by braemhoej)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
parallel-dfs-dag post-order-heap
3 1
44 0
- -
3.9 0.0
about 3 years ago almost 2 years ago
C++ C++
MIT License GNU General Public License v3.0 only
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.

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.

post-order-heap

Posts with mentions or reviews of post-order-heap. We have used some of these posts to build our list of alternatives and similar projects.

What are some alternatives?

When comparing parallel-dfs-dag and post-order-heap you can also consider the following projects:

graphs-cpp - Weighted and unweighted graphs and digraphs with C++

BFS1 - a custom tuned bread first searcher

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

gcl - A graph concurrent library for C++

breaking_cycles_in_noisy_hierarchies - breaking cycles in noisy hierarchies