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.
- ↑ "Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs". Algorithms. 5: 176–213. 2012. doi:10.3390/a5020176.
External links
Wikiquote has quotations related to: Knuth's Simpath algorithm |
Wikimedia Commons has media related to Donald Ervin Knuth. |
- Graphillion library which implements the algorithm for manipulating large sets of paths and other structures.
- , A CWEB implementation by Donald Knuth.
This article is issued from
Wikipedia.
The text is licensed under Creative Commons - Attribution - Sharealike.
Additional terms may apply for the media files.