Replies: 1 comment
-
Depends on how your dependency graph is represented, but some time ago we translated (in a somehow mechanic way, although by hand) the Nixpkgs list library to Nickel for benchmarking, and the library does implement a topological sort: nickel/benches/nixpkgs/lists.ncl Line 433 in ce9501d Note that this code is used to benchmark the typechecker, so it's not actually tested for correctness in practice. But this can be a good starting point! |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
given a dependency graph, how does one go about doing a topological sort?
Beta Was this translation helpful? Give feedback.
All reactions