Knuth's Simpath algorithm
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by JJMC89 bot III (talk | contribs) at 19:56, 12 October 2024 (Moving Category:Algorithms in graph theory to Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4). The present address (URL) is a permanent link to this version.Revision as of 19:56, 12 October 2024 by JJMC89 bot III (talk | contribs) (Moving Category:Algorithms in graph theory to Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4)
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.
Stub icon
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.