breaking_cycles_in_noisy_hierarchies
parallel-dfs-dag
| breaking_cycles_in_noisy_hierarchies | parallel-dfs-dag | |
|---|---|---|
| 1 | 3 | |
| 71 | 44 | |
| - | - | |
| 10.0 | 3.9 | |
| over 1 year ago | about 3 years ago | |
| Python | C++ | |
| BSD 3-clause "New" or "Revised" 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.
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...
parallel-dfs-dag
What are some alternatives?
Competitive-Python - Python Algorithms Package used in competitive programming
graphs-cpp - Weighted and unweighted graphs and digraphs with C++
pyDag - Scheduling Big Data Workloads and Data Pipelines in the Cloud with pyDag
BFS1 - a custom tuned bread first searcher
pathfinding - Pathfinding library for rust
FXGraphAlgorithmSimulator - Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.
breaking_cycles_in_noisy_hierarchi
Vc - SIMD Vector Classes for C++
trueskill - An implementation of the TrueSkill rating system for Python
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.