←back to thread

Show HN: Zig Topological Sort Library for Parallel Processing

(github.com)
110 points ww520 | 2 comments | 01 Apr 25 17:48 UTC | HN request time: 0.508s | source

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.
Show context
chubot ◴[01 Apr 25 19:00 UTC] No.43550252[source]▶
Hm this reminds me that the Python stdlib has grown a module for topological sorting fo a graph:

https://docs.python.org/3/library/graphlib.html

I haven't used it yet, I'd be curious if anyone has

replies(2): >>43550336 #>>43553925 #
1. nerdponx ◴[01 Apr 25 19:09 UTC] No.43550336[source]▶
I used it to build a (now permanently unfinished) lightweight DAG runner that uses only the Python standard library, with the intention that you can just copy the .py file into a project and use it without installing anything other than Python on your system. I think it might be of niche use to some people, but I personally wasn't even dogfooding it, I was just scratching an itch.

The purpose of adding it to the standard library was to implement linear MRO for classes: https://bugs.python.org/issue17005

replies(1): >>43554524 #
2. jessekv ◴[02 Apr 25 07:55 UTC] No.43554524[source]▶
I built one too! I started with networkx but migrated to graphlib with python 3.9.

I run it in production for many customers. It's great to have this in the std lib.