parallel-dfs-dag
xnetwork
| parallel-dfs-dag | xnetwork | |
|---|---|---|
| 3 | 1 | |
| 44 | 1 | |
| - | - | |
| 3.9 | 0.0 | |
| about 3 years ago | almost 4 years ago | |
| C++ | Rust | |
| 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
xnetwork
-
Started learning Rust, decided to start by implementing a graph data structure with each node keeping references to its neighbors.
In 2020, someone published a proof-of-concept graph backed by slotmap but it hasn't been maintained since the week it was first published.
What are some alternatives?
graphs-cpp - Weighted and unweighted graphs and digraphs with C++
FXGraphAlgorithmSimulator - Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.
BFS1 - a custom tuned bread first searcher
sonic - 🦔 Fast, lightweight & schema-less search backend. An alternative to Elasticsearch that runs on a few MBs of RAM.
alga-paper - A minimalistic, elegant and powerful approach to working with graphs in a functional programming language
Vc - SIMD Vector Classes for C++
gping - Ping, but with a graph
ConcurrentDeque - Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17
rustworkx - A high performance Python graph library implemented in Rust.
post-order-heap - C++ implementation of post-order heap, as described by Harvery & Zatloukal. Adapted for heaps of any degree.
gcl - A graph concurrent library for C++