parallel-dfs-dag VS breaking_cycles_in_noisy_hierarchies

Compare parallel-dfs-dag vs breaking_cycles_in_noisy_hierarchies 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)
WorkOS - The modern identity platform for B2B SaaS
The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
workos.com
featured
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
parallel-dfs-dag breaking_cycles_in_noisy_hierarchies
3 1
44 71
- -
3.9 10.0
about 3 years ago over 1 year ago
C++ Python
MIT License BSD 3-clause "New" or "Revised" 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.

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.

breaking_cycles_in_noisy_hierarchies

Posts with mentions or reviews of breaking_cycles_in_noisy_hierarchies. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-07-12.
  • Elo for VCS – Founder's Choice
    2 projects | news.ycombinator.com | 12 Jul 2023
    I think that's a pretty good idea. Have you checked out the paper "Breaking Cycles in Noisy Hierarchies"? It looks pretty similar to what you're looking for and the code is open source: https://github.com/zhenv5/breaking_cycles_in_noisy_hierarchi...

What are some alternatives?

When comparing parallel-dfs-dag and breaking_cycles_in_noisy_hierarchies you can also consider the following projects:

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

Competitive-Python - Python Algorithms Package used in competitive programming

BFS1 - a custom tuned bread first searcher

pyDag - Scheduling Big Data Workloads and Data Pipelines in the Cloud with pyDag

FXGraphAlgorithmSimulator - Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.

pathfinding - Pathfinding library for rust

Vc - SIMD Vector Classes for C++

breaking_cycles_in_noisy_hierarchi

ConcurrentDeque - Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17

trueskill - An implementation of the TrueSkill rating system for Python

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.