https://github.com/frangio/pruesse-ruskey

https://github.com/frangio/pruesse-ruskey

Last synced: about 1 month ago
JSON representation

• Host: GitHub
• URL: https://github.com/frangio/pruesse-ruskey
• Owner: frangio
• Created: 2023-03-11T21:01:22.000Z (almost 2 years ago)
• Default Branch: master
• Last Pushed: 2023-11-15T20:26:39.000Z (about 1 year ago)
• Last Synced: 2024-10-16T10:21:28.029Z (2 months ago)
• Language: Rust
• Size: 35.2 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Enumerating all topological sorts of a DAG in constant amortized time, implemented in Rust following Canfield and Williamson's non-recursive variant of Pruesse-Ruskey. 

1. Pruesse, G. and Ruskey, F. 1994. _Generating linear extensions fast_. https://doi.org/10.1137/s0097539791202647

4. Canfield, E.R. and Williamson, S.G. 1995. _A loop-free algorithm for generating the linear extensions of a poset_. https://doi.org/10.1007/bf01108590

> **Note**

> Beware, the implementation is not particularly readable.