←back to thread

Show HN: Zig Topological Sort Library for Parallel Processing

(github.com)
110 points ww520 | 1 comments | 01 Apr 25 17:48 UTC | HN request time: 0.214s | 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. paulddraper ◴[02 Apr 25 05:40 UTC] No.43553925[source]▶
It’s a common algorithmic need.

Not as common as array sort. But still common.