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.^[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.

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.

Donald Knuth

Publications	The Art of Computer Programming "The Complexity of Songs" Computers and Typesetting Concrete Mathematics Surreal Numbers Things a Computer Scientist Rarely Talks About Selected papers series

Software	TeX METAFONT MIXAL (MIX MMIX GNU MDK)

Fonts	AMS Euler Computer Modern Concrete Roman

Literate programming	WEB CWEB

Algorithms	Knuth's Algorithm X Knuth–Bendix completion algorithm Knuth–Morris–Pratt algorithm Knuth shuffle Robinson–Schensted–Knuth correspondence Trabb Pardo–Knuth algorithm Generalization of Dijkstra's algorithm Knuth's Simpath algorithm

Other	Dancing Links Knuth reward check Knuth Prize Man or boy test Quater-imaginary base -yllion Potrzebie system of weights and measures

This article is issued from Wikipedia - version of the 6/27/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.