Jump to content

Knuth's Simpath algorithm: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
updated a book reference; added a reference to source code
Line 1: Line 1:
'''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.<ref>{{cite book|last1=Knuth|first1=Donald|title=The Art of Computer Programming, Volume 4, Fascicle 1|date=2009|publisher=Addison-Wesley Professional: Boston, MA, USA}}</ref><ref>{{cite journal|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs|journal=Algorithms|date=2012|volume=5|pages=176–213|doi=10.3390/a5020176}}</ref>
'''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.<ref>{{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}}</ref><ref>{{cite journal|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs|journal=Algorithms|date=2012|volume=5|pages=176–213|doi=10.3390/a5020176}}</ref>


==References==
==References==
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 04:40, 31 July 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

  1. ^ Knuth, Donald (2011). The Art of Computer Programming, Volume 4A. Addison-Wesley Professional: Boston, MA, USA. p. 254,275.
  2. ^ "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)
  • Graphillion library which implements the algorithm for manipulating large sets of paths and other structures.
[1], A CWEB implementation by Donald Knuth.