原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
sort,” or a “topological sort of the transpose” of the subproblem graph. In other words,
no subproblem is considered until all of the subproblems it depends upon have been solved.
Similarly, using notions that we’ll visit in Section 20.3, you can view the top-down meth
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea