Work · alternatives · 2026
24 alternatives to Zig Topological Sort Library for Parallel Processing
I believe the best way to learn a language is by doing an in-depth project. This is my first Zig project intended for learning the ropes on publishing a Zig package. It turns out to be quite solid and performant. It might be a bit over-engineered. This little library is packed with the following features: - Building dependency graph from dependency data. - Performing topological sort on the dependency graph. - Generating dependence-free subsets for parallel processing. - Cycle detection and cycle reporting.
Zig Topological Sort Library for Parallel Processing is a dependency graph management library for Zig that builds dependency graphs, performs topological sorting, and generates dependency-free subsets for parallel… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1OA
I made an early version of a sorted collection library for Zig. Sorted collections are data structures that maintain the data in sorted order. Examples of these data structures are `java.util.TreeMap` in Java and `std::map` in C++. These data structures are mainly used for fast lookups (point search) and fast range searches. The library is available on GitHub: https://github.com/CogitatorTech/ordered
Oct 2025 · its alternatives →
- 2
Zig library for HyperLogLog estimation. Contribute to axiomhq/zig-hyperloglog development by creating an account on GitHub.
2023 · github.com · its alternatives →
- 3
Hi all, I've talked about glidesort a few times on HN already, but it's finally ready for release. If you have any questions, feel free to ask. An academic paper on glidesort that goes into a lot more detail than the readme is upcoming, but is not ready yet. I will be giving a talk on glidesort tomorrow at FOSDEM 2023 in the Rust Devroom at 16:10, you can seek me out there as well. In other news, I am leaving academia soon, so if you have interesting (Rust) jobs the coming months feel free to approach me.
2023 · github.com · its alternatives →
- 4
HypergraphZ – directed hypergraph library in Zig with Python bindings - yamafaktory/hypergraphz
2024 · github.com · its alternatives →
- 5
HypergraphZ – directed hypergraph library in Zig with Python bindings - yamafaktory/hypergraphz
2024 · github.com · its alternatives →
- 6
Minimalist, dependency-free virtual machine sandbox for microcontrollers and other resource-constrained devices. Single C file, no dynamic memory allocations, asynchronous design, pure C99 - ringtailsoftware/uvm32
Dec 2025 · github.com · its alternatives →
- 7ZD
Hi everyone, I've made an open-source library for using design by contract (DbC) principles in the Zig programming language. It's called Zig-DbC, and it currently provides the following features: - A simple API to define preconditions, postconditions, and invariants. - Contracts are active in `Debug`, `ReleaseSafe`, and `ReleaseSmall` modes to catch bugs early. - All checks are removed at compile time in `ReleaseFast` mode for zero performance cost. - An optional mode to handle partial state changes in functions that return errors. - Transparent error handling that propagates errors from…
2025 · its alternatives →
- 8
Hey there HN! We’re Antonio, Luca, and Yuhang, and we’re excited to introduce Fast GraphRAG, an open-source RAG approach that leverages knowledge graphs and the 25 years old PageRank for better information retrieval and reasoning. Building a good RAG pipeline these days takes a lot of manual optimizations. Most engineers intuitively start from naive RAG: throw everything in a vector database and hope that semantic search is powerful enough. This can work for use cases where accuracy isn’t too important and hallucinations are tolerable, but it doesn’t work for more difficult queries that…
2024 · github.com · its alternatives →
- 9
Fast SIMD sorting routines for int and float arrays - zvrba/SortingNetworks
2021 · github.com · its alternatives →
- 10
Hey HN, we want to share HelixDB (https://github.com/HelixDB/helix-db/), a project a college friend and I are working on. It’s a new database that natively intertwines graph and vector types, without sacrificing performance. It’s written in Rust and our initial focus is on supporting RAG. Here’s a video runthrough: https://screen.studio/share/szgQu3yq. Why a hybrid? Vector databases are useful for similarity queries, while graph databases are useful for relationship queries. Each stores data in a way that’s best for its main type of query (e.g.…
2025 · github.com · its alternatives →
- 11IB
We show the potential of modern, embedded graph databases in the browser by demonstrating a fully in-browser chatbot that can perform Graph RAG using Kuzu (the graph database we're building) and WebLLM, a popular in-browser inference engine for LLMs. The post retrieves from the graph via a Text-to-Cypher pipeline that translates a user question into a Cypher query, and the LLM uses the retrieved results to synthesize a response. As LLMs get better, and WebGPU and Wasm64 become more widely adopted, we expect to be able to do more and more in the browser in combination with LLMs, so a lot of…
2025 · blog.kuzudb.com · its alternatives →
- 12
A collection of high-performance data structures for Zig.
Dec 2025 · github.com · its alternatives →
- 13
An alternative to stack traces for your Go errors. Contribute to bracesdev/errtrace development by creating an account on GitHub.
2023 · github.com · its alternatives →
- 14
Creating high-quality scientific figures can be time-consuming and challenging, even though sketching ideas on paper is relatively easy. Furthermore, recreating existing figures that are not stored in formats preserving semantic information is equally complex. To tackle this problem, we introduce DeTikZify, a novel multimodal language model that automatically synthesizes scientific figures as semantics-preserving TikZ graphics programs based on sketches and existing figures. We also introduce a Monte Carlo Tree Search-based inference algorithm that enables DeTikZify to iteratively refine its…
2024 · github.com · its alternatives →
- 15
A distributed, fast open-source graph database featuring horizontal scalability and high availability - GitHub - vesoft-inc/nebula: A distributed, fast open-source graph database featuring horizontal scalability and high availability
2020 · github.com · its alternatives →
- 16
I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec-driven workflow. The book covers roughly a first 1-2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more. All…
Mar 2026 · amoilanen.github.io · its alternatives →
- 17
I finally got tired of XKCD #2347 living rent-free in my head, so I built Stacktower: a tool that takes any real package’s dependency graph and turns it into an actual tower of bricks. Along the way I had to wrestle some surprisingly spicy problems. Full blog post here: https://stacktower.io The result is half visualization tool, half love letter to the chaos of modern dependency trees. Open-source, works with PyPI, Cargo, npm, and more. Code: https://github.com/matzehuels/stacktower
Dec 2025 · stacktower.io · its alternatives →
- 18WH
2022 · memgraph.com · its alternatives →
- 19
integer compression library for Zig based on FastLanes - steelcake/zint
Dec 2025 · github.com · its alternatives →
- 20
A graph-based functional API for building complex scikit-learn pipelines. - alegonz/baikal
2020 · github.com · its alternatives →
- 21
Haskell re-implementation of STOKE, the stochastic superoptimizer - blaze/notebooks/tutorial.ipynb at master · bollu/blaze
2019 · github.com · its alternatives →
- 22IB
Hi everyone, I recently built a tool called Ziggy. Ziggy is a alternative to tools like Typeform except Ziggy uses AI to ask dynamic questions like you would ask when doing an interview with a user with some pretty powerful analytics. It's completely open source and was made to help save time and money doing 1-on-1 interviews with a lot of users in a short amount of time. We're also looking for any and all feedback so let me know what you think! Give it a try here by doing a feedback survey for Ziggy: https://www.useziggy.com/zy/MtAp-d7ebzylr
2024 · useziggy.com · its alternatives →
- 23
This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
2024 · github.com · its alternatives →
- 24
I'm a machine learning engineer and researcher. I got fed up with how difficult it is to understand why neural networks behave the way they do, so i wrote a library to help with it. Comgra (computation graph analysis) is a library you can use with pytorch to extract all the tensor data you care about and visualize it graphically in a browser. This allows for a much more detailed analysis of what is happening than the usual approach of using tensorboard. You can go investigate tensors as training proceeds, drill down into individual neurons, inspect single data sets that are of special…
2023 · github.com · its alternatives →
Also compare
- Ordered – A sorted collection library for Zig alternatives
- HyperLogLog in Zig alternatives
- Glidesort, a new stable sort in Rust up to ~4x faster for random data alternatives
- HypergraphZ – A Hypergraph Implementation in Zig alternatives
- HyperZig – A Hypergraph Implementation in Zig alternatives
- Tiny VM sandbox in C with apps in Rust, C and Zig alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →