Knuth's Simpath algorithm: Difference between revisions
Content deleted Content added
m Open access bot: doi added to citation with #oabot. |
Removing misplaced Commons category link |
||
| Line 6: | Line 6: | ||
==External links== |
==External links== |
||
{{Wikiquote}} |
{{Wikiquote}} |
||
{{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. |
* [http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath], A CWEB implementation by Donald Knuth. |
||
Revision as of 22:29, 11 July 2020
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.
- [1], A CWEB implementation by Donald Knuth.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |