Knuth's Simpath algorithm
Jump to navigation
Jump to search
This content was retrieved from
Wikipedia : http://en.wikipedia.org/wiki/Knuth's_Simpath_algorithmSimpath 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.
- [1], A CWEB implementation by Donald Knuth.
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
This page is based on the copyrighted Wikipedia article "Knuth's Simpath algorithm"; it is used under the Creative Commons
Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may
redistribute it, verbatim or modified, providing that you comply with
the terms of the CC-BY-SA