Knuth's Simpath algorithm: Difference between revisions
Content deleted Content added
m Moving Category:Graph algorithms to Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms Tag: Reverted |
m Moving Category:Algorithms in graph theory to Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4 |
||
| Line 15: | Line 15: | ||
[[Category:Computer arithmetic algorithms]] |
[[Category:Computer arithmetic algorithms]] |
||
[[Category:Donald Knuth]] |
[[Category:Donald Knuth]] |
||
[[Category: |
[[Category:Graph algorithms]] |
||
[[Category:Mathematical logic]] |
[[Category:Mathematical logic]] |
||
[[Category:Theoretical computer science]] |
[[Category:Theoretical computer science]] |
||
Latest revision as of 19:56, 12 October 2024
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
[edit]- ^ 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
[edit]
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.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |