Knuth's Simpath algorithm
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.{{cite book|last1=Knuth|first1=Donald|title=The Art of Computer Programming, Volume 4A|date=2011|publisher=Addison-Wesley Professional: Boston, MA, USA|page=254,275}}{{cite journal|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs|journal=Algorithms|date=2012|volume=5|issue=2|pages=176–213|doi=10.3390/a5020176|last1=Yoshinaka|first1=Ryo|last2=Saitoh|first2=Toshiki|last3=Kawahara|first3=Jun|last4=Tsuruma|first4=Koji|last5=Iwashita|first5=Hiroaki|last6=Minato|first6=Shin-Ichi|doi-access=free}}
References
{{Reflist}}
External links
{{Wikiquote}}
- [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].
{{Donald Knuth navbox}}
Category:Computer arithmetic algorithms
Category:Theoretical computer science
{{-}}
{{algorithm-stub}}