经典算法 分支限界法 分治法 动态规划 贪心算法 回溯法

[{"title":"（ 52 个子文件 274KB ） 经典算法 分支限界法 分治法 动态规划 贪心算法 回溯法","children":[{"title":"新建文件夹","children":[{"title":"第五讲 贪心算法","children":[{"title":"Bag.C <span style='color:#111;'> 749B </span>","children":null,"spread":false},{"title":"第5讲 贪心算法.doc <span style='color:#111;'> 67.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"第三讲 分治法","children":[{"title":"第3讲 分治法.doc <span style='color:#111;'> 88.50KB </span>","children":null,"spread":false}],"spread":true},{"title":"专题树","children":[{"title":"12.txt <span style='color:#111;'> 12.43KB </span>","children":null,"spread":false},{"title":"13.txt <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"5.txt <span style='color:#111;'> 13.03KB </span>","children":null,"spread":false},{"title":"排序二叉树的建立和查找 西安交通大学精品课程 软件开发技术基础.files","children":[{"title":"blank.gif <span style='color:#111;'> 43B </span>","children":null,"spread":false},{"title":"b_dot.jpg <span style='color:#111;'> 1.84KB </span>","children":null,"spread":false},{"title":"wtb.jpg <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false},{"title":"lbar.jpg <span style='color:#111;'> 9.82KB </span>","children":null,"spread":false},{"title":"styleNN.css <span style='color:#111;'> 2.14KB </span>","children":null,"spread":false},{"title":"188.gif <span style='color:#111;'> 1.43KB </span>","children":null,"spread":false},{"title":"ln.jpg <span style='color:#111;'> 2.73KB </span>","children":null,"spread":false},{"title":"wt.jpg <span style='color:#111;'> 6.93KB </span>","children":null,"spread":false},{"title":"b.jpg <span style='color:#111;'> 1.90KB </span>","children":null,"spread":false},{"title":"sy1.jpg <span style='color:#111;'> 6.21KB </span>","children":null,"spread":false},{"title":"style.css <span style='color:#111;'> 2.75KB </span>","children":null,"spread":false},{"title":"logo1.jpg <span style='color:#111;'> 51.39KB </span>","children":null,"spread":false}],"spread":false},{"title":"1.txt <span style='color:#111;'> 67B </span>","children":null,"spread":false},{"title":"最优二叉树——编码方案.files","children":[{"title":"blank.gif <span style='color:#111;'> 160B </span>","children":null,"spread":false},{"title":"esearch.gif <span style='color:#111;'> 45.34KB </span>","children":null,"spread":false},{"title":"shu6.62.gif <span style='color:#111;'> 419B </span>","children":null,"spread":false},{"title":"up.gif <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"workplan.gif <span style='color:#111;'> 262B </span>","children":null,"spread":false},{"title":"style.css <span style='color:#111;'> 621B </span>","children":null,"spread":false},{"title":"logo1.jpg <span style='color:#111;'> 10.90KB </span>","children":null,"spread":false}],"spread":true},{"title":"4.txt <span style='color:#111;'> 4.90KB </span>","children":null,"spread":false},{"title":"14.txt <span style='color:#111;'> 10.03KB </span>","children":null,"spread":false},{"title":"6.txt <span style='color:#111;'> 1.62KB </span>","children":null,"spread":false},{"title":"3.txt <span style='color:#111;'> 4.05KB </span>","children":null,"spread":false},{"title":"7.txt <span style='color:#111;'> 1.66KB </span>","children":null,"spread":false},{"title":"8.txt <span style='color:#111;'> 3.87KB </span>","children":null,"spread":false},{"title":"9.txt <span style='color:#111;'> 6.01KB </span>","children":null,"spread":false},{"title":"10.txt <span style='color:#111;'> 6.05KB </span>","children":null,"spread":false},{"title":"11.txt <span style='color:#111;'> 2.46KB </span>","children":null,"spread":false},{"title":"2.txt <span style='color:#111;'> 4.89KB </span>","children":null,"spread":false},{"title":"Avl_tree","children":[{"title":"web","children":[{"title":"avltree.html <span style='color:#111;'> 1.72KB </span>","children":null,"spread":false}],"spread":false},{"title":"说明.txt <span style='color:#111;'> 872B </span>","children":null,"spread":false}],"spread":false}],"spread":false},{"title":"第一讲 回溯法","children":[{"title":"Maze.txt <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"Horse.C <span style='color:#111;'> 1.26KB </span>","children":null,"spread":false},{"title":"Bag_0_1.C <span style='color:#111;'> 494B </span>","children":null,"spread":false},{"title":"Queen.C <span style='color:#111;'> 966B </span>","children":null,"spread":false},{"title":"第1讲 回溯法.doc <span style='color:#111;'> 71.50KB </span>","children":null,"spread":false}],"spread":true},{"title":"第四讲 动态规划","children":[{"title":"ShortDist.C <span style='color:#111;'> 801B </span>","children":null,"spread":false},{"title":"复件 MatrixChain.C <span style='color:#111;'> 627B </span>","children":null,"spread":false},{"title":"Bag_0_1.C <span style='color:#111;'> 669B </span>","children":null,"spread":false},{"title":"第4讲 动态规划.doc <span style='color:#111;'> 97.00KB </span>","children":null,"spread":false},{"title":"MatrixChain.C <span style='color:#111;'> 627B </span>","children":null,"spread":false}],"spread":true},{"title":"第二讲 分支限界法","children":[{"title":"Maze.txt <span style='color:#111;'> 1.14KB </span>","children":null,"spread":false},{"title":"第2讲 分支限界法.doc <span style='color:#111;'> 108.50KB </span>","children":null,"spread":false},{"title":"Bag_0_1.C <span style='color:#111;'> 1.10KB </span>","children":null,"spread":false},{"title":"ShortPath.C <span style='color:#111;'> 1.40KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]