Jump to content

Knuth's Simpath algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rebooted (talk | contribs) at 22:44, 11 July 2014. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This article is a stub. You can help Wikipedia by expanding it.

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 (2009). The Art of Computer Programming, Volume 4, Fascicle 1. Addison-Wesley Professional: Boston, MA, USA.
  2. ^ "Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs". Algorithms. 5: 176–213. 2012. doi:doi:10.3390/a5020176. {{cite journal}}: Check |doi= value (help)
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.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Knuth%27s_Simpath_algorithm&oldid=616584903"