Knuth's Simpath algorithm: Difference between revisions
Content deleted Content added
→top: "zero" does not require a capital initial letter. |
removed Category:Algorithms; added Category:Graph algorithms using HotCat |
||
| Line 11: | Line 11: | ||
{{algorithm-stub}} |
{{algorithm-stub}} |
||
[[Category: |
[[Category:Graph algorithms| ]] |
||
[[Category:Mathematical logic]] |
[[Category:Mathematical logic]] |
||
[[Category:Theoretical computer science]] |
[[Category:Theoretical computer science]] |
||
Revision as of 10:09, 24 August 2015
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 (2009). The Art of Computer Programming, Volume 4, Fascicle 1. Addison-Wesley Professional: Boston, MA, USA.
- ^ "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)
External links
Wikiquote has quotations related to Knuth's Simpath algorithm.
Wikimedia Commons has media related to Donald Ervin Knuth.
- Graphillion library which implements the algorithm for manipulating large sets of paths and other structures.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |