原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
formation. Figure 14.4 shows the subproblem graph for the rod-cutting problem with n = 4.
It is a directed graph, containing one vertex for each distinct subproblem.
The subproblem graph has a directed edge from the vertex for subproblem x to the vertex f
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea