parallel-dfs-dag
breaking_cycles_in_noisy_hierarchies
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 |
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
breaking_cycles_in_noisy_hierarchies
-
Elo for VCS – Founder's Choice
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?
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.