算法设计与分析PPT.rar

[{"title":"（ 32 个子文件 3.45MB ） 算法设计与分析PPT.rar","children":[{"title":"算法设计与分析PPT","children":[{"title":"9.2 Matching.ppt <span style='color:#111;'> 354.50KB </span>","children":null,"spread":false},{"title":"07assignment.ppt <span style='color:#111;'> 480.00KB </span>","children":null,"spread":false},{"title":"12 Backtracking1.ppt <span style='color:#111;'> 713.00KB </span>","children":null,"spread":false},{"title":"2 growth of functions.ppt <span style='color:#111;'> 305.50KB </span>","children":null,"spread":false},{"title":"9.1 Network Flow.ppt <span style='color:#111;'> 1.10MB </span>","children":null,"spread":false},{"title":"1 Introduction1.ppt <span style='color:#111;'> 723.00KB </span>","children":null,"spread":false},{"title":"__MACOSX","children":[{"title":"._8 Advanced Graph algorithms.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._13 Branch and Bound.ppt <span style='color:#111;'> 210B </span>","children":null,"spread":false},{"title":"._9.1 Network Flow.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._5 Divider and Conquer.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._07assignment.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._11 NP Complete Theory.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._1 Introduction1.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._4 Recursive.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._9.2 Matching.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._6 Dynamic Programming.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._7 Greedy Algorithms.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._9 Network Flow and Matching.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._10 Linear Programming.ppt <span style='color:#111;'> 210B </span>","children":null,"spread":false},{"title":"._3 Algorithm Analysis.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._2 growth of functions.ppt <span style='color:#111;'> 266B </span>","children":null,"spread":false},{"title":"._12 Backtracking1.ppt <span style='color:#111;'> 210B </span>","children":null,"spread":false}],"spread":false},{"title":"8 Advanced Graph algorithms.ppt <span style='color:#111;'> 3.19MB </span>","children":null,"spread":false},{"title":"5 Divider and Conquer.ppt <span style='color:#111;'> 863.00KB </span>","children":null,"spread":false},{"title":"7 Greedy Algorithms.ppt <span style='color:#111;'> 1.34MB </span>","children":null,"spread":false},{"title":"10 Linear Programming.ppt <span style='color:#111;'> 377.00KB </span>","children":null,"spread":false},{"title":"6 Dynamic Programming.ppt <span style='color:#111;'> 3.58MB </span>","children":null,"spread":false},{"title":"11 NP Complete Theory.ppt <span style='color:#111;'> 581.50KB </span>","children":null,"spread":false},{"title":"13 Branch and Bound.ppt <span style='color:#111;'> 1.48MB </span>","children":null,"spread":false},{"title":"4 Recursive.ppt <span style='color:#111;'> 632.00KB </span>","children":null,"spread":false},{"title":"9 Network Flow and Matching.ppt <span style='color:#111;'> 1.35MB </span>","children":null,"spread":false},{"title":"3 Algorithm Analysis.ppt <span style='color:#111;'> 451.00KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]