Knuth's Simpath algorithm: Difference between revisions
Content deleted Content added
updated a book reference; added a reference to source code |
→External links: fix link formatting |
||
| Line 8: | Line 8: | ||
{{Commons category|Donald Ervin Knuth}} |
{{Commons category|Donald Ervin Knuth}} |
||
* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures. |
* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures. |
||
* [http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath], A CWEB implementation by Donald Knuth. |
|||
Revision as of 15:51, 18 September 2017
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.
{{cite journal}}: CS1 maint: unflagged free DOI (link)
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. |