Knuth's Simpath algorithm
Simpath is an algorithm introduced by Donald Knuth that constructs a zero-suppressed decision diagram (ZDD) representing all simple paths between two vertices in a given graph.[1][2]
References
- ^ Knuth, Donald (2011). The Art of Computer Programming, Volume 4A. Addison-Wesley Professional: Boston, MA, USA. p. 254,275.
- ^ Yoshinaka, Ryo; Saitoh, Toshiki; Kawahara, Jun; Tsuruma, Koji; Iwashita, Hiroaki; Minato, Shin-Ichi (2012). "Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs". Algorithms. 5 (2): 176–213. doi:10.3390/a5020176.
External links
Wikiquote has quotations related to Knuth's Simpath algorithm.
- Graphillion library which implements the algorithm for manipulating large sets of paths and other structures.
- A CWEB implementation by Donald Knuth.
- v
- t
- e
Donald Knuth
- The Art of Computer Programming
- "The Complexity of Songs"
- Computers and Typesetting
- Concrete Mathematics
- Surreal Numbers
- Things a Computer Scientist Rarely Talks About
- Selected papers series
- TeX
- Metafont
- MIXAL (MIX
- MMIX)
- AMS Euler
- Computer Modern
- Concrete Roman
- WEB
- CWEB
- Knuth's Algorithm X
- Knuth–Bendix completion algorithm
- Knuth–Morris–Pratt algorithm
- Knuth shuffle
- Robinson–Schensted–Knuth correspondence
- Trabb Pardo–Knuth algorithm
- Generalization of Dijkstra's algorithm
- Knuth's Simpath algorithm
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
