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[edit]

  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[edit]

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