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.
External links
- Graphillion library which implements the algorithm for manipulating large sets of paths and other structures.
