Knuth's Simpath algorithm

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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.

External links

  • Graphillion library which implements the algorithm for manipulating large sets of paths and other structures.
  • [1], A CWEB implementation by Donald Knuth.



Retrieved from "https://en.wikipedia.org/w/index.php?title=Knuth%27s_Simpath_algorithm&oldid=801248211"
This content was retrieved from Wikipedia : http://en.wikipedia.org/wiki/Knuth's_Simpath_algorithm
This page is based on the copyrighted Wikipedia article "Knuth's Simpath algorithm"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA