[{"title":"( 16 个子文件 19.67MB ) data structure(普林斯顿大学)","children":[{"title":"princeton(data structure)","children":[{"title":"16Geometric.pdf <span style='color:#111;'> 1.28MB </span>","children":null,"spread":false},{"title":"14MST.pdf <span style='color:#111;'> 1.46MB </span>","children":null,"spread":false},{"title":"24CombinatorialSearch.pdf <span style='color:#111;'> 1.76MB </span>","children":null,"spread":false},{"title":"20Compression.pdf <span style='color:#111;'> 1.05MB </span>","children":null,"spread":false},{"title":"01UnionFind.pdf <span style='color:#111;'> 1.24MB </span>","children":null,"spread":false},{"title":"11UndirectedGraphs.pdf <span style='color:#111;'> 2.77MB </span>","children":null,"spread":false},{"title":"22LinearProgramming.pdf <span style='color:#111;'> 1.12MB </span>","children":null,"spread":false},{"title":"23Reductions.pdf <span style='color:#111;'> 1.24MB </span>","children":null,"spread":false},{"title":"07SymbolTables.pdf <span style='color:#111;'> 835.38KB </span>","children":null,"spread":false},{"title":"21PatternMatching.pdf <span style='color:#111;'> 1.14MB </span>","children":null,"spread":false},{"title":"06PriorityQueues.pdf <span style='color:#111;'> 1.10MB </span>","children":null,"spread":false},{"title":"05AdvTopicsSorting.pdf <span style='color:#111;'> 753.38KB </span>","children":null,"spread":false},{"title":"02StackQueue.pdf <span style='color:#111;'> 1.02MB </span>","children":null,"spread":false},{"title":"13DirectedGraphs.pdf <span style='color:#111;'> 1.45MB </span>","children":null,"spread":false},{"title":"17GeometricSearch.pdf <span style='color:#111;'> 1.86MB </span>","children":null,"spread":false},{"title":"15ShortestPaths.pdf <span style='color:#111;'> 1.69MB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]