“Knuth's Simpath algorithm”的意思、由来-开放百科全书

词条

Knuth's Simpath algorithm

释义

References
External links

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. ^{{cite book|last1=Knuth|first1=Donald|title=The Art of Computer Programming, Volume 4A|date=2011|publisher=Addison-Wesley Professional: Boston, MA, USA|page=254,275}}
2. ^{{cite journal|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs|journal=Algorithms|date=2012|volume=5|pages=176–213|doi=10.3390/a5020176}}

External links

[https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.
, A CWEB implementation by Donald Knuth.

5 : Computer arithmetic algorithms|Donald Knuth|Graph algorithms|Mathematical logic|Theoretical computer science

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。