Knuth's Simpath algorithm explained

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]}

External links

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

Notes and References

1. Book: Knuth. Donald. The Art of Computer Programming, Volume 4A. 2011. Addison-Wesley Professional: Boston, MA, USA. 254,275.
2. Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs. Algorithms. 2012. 5. 2. 176–213. 10.3390/a5020176. Yoshinaka. Ryo. Saitoh. Toshiki. Kawahara. Jun. Tsuruma. Koji. Iwashita. Hiroaki. Minato. Shin-Ichi. free.