algo-p2
视频
|
2016-9-6 05:16
|
2024-8-20 01:59
|
167
|
1.78 GB
|
66
|
- lectures/week0/Algorithms Part II 0.0 Course Introduction (922).mp442.66MB
- lectures/week1/01-undirected-graphs/Algorithms Part II 1.0 Introduction to Graphs (932).mp424.57MB
- lectures/week1/01-undirected-graphs/Algorithms Part II 1.1 Graph API (1447).mp420.58MB
- lectures/week1/01-undirected-graphs/Algorithms Part II 1.2 Depth-First Search (2622).mp467.02MB
- lectures/week1/01-undirected-graphs/Algorithms Part II 1.3 Breadth-First Search (1334).mp432.57MB
- lectures/week1/01-undirected-graphs/Algorithms Part II 1.4 Connected Components (1856).mp424.75MB
- lectures/week1/01-undirected-graphs/Algorithms Part II 1.5 Graph Challenges (1429).mp454.93MB
- lectures/week1/02-directed-graphs/Algorithms Part II 2.0 Introduction to Digraphs (830).mp413.31MB
- lectures/week1/02-directed-graphs/Algorithms Part II 2.1 Digraph API (456).mp47.21MB
- lectures/week1/02-directed-graphs/Algorithms Part II 2.2 Digraph Search (2056).mp427.59MB
- lectures/week1/02-directed-graphs/Algorithms Part II 2.3 Topological Sort (1254).mp427.38MB
- lectures/week1/02-directed-graphs/Algorithms Part II 2.4 Strong Components (2022).mp426.06MB
- lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.0 Introduction to MSTs (404).mp412.43MB
- lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.1 Greedy Algorithm (1256).mp418.29MB
- lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.2 Edge-Weighted Graph API (1115).mp415.12MB
- lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.3 Kruskal's Algorithm (1228).mp416.87MB
- lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.4 Prim's Algorithm (3315).mp466.78MB
- lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.5 MST Context (1034).mp416.42MB
- lectures/week2/02-shortest-paths/Algorithms Part II 4.0 Shortest Paths APIs (1051).mp427.71MB
- lectures/week2/02-shortest-paths/Algorithms Part II 4.1 Shortest Path Properties (1446).mp433.94MB
- lectures/week2/02-shortest-paths/Algorithms Part II 4.2 Dijkstra's Algorithm (1858).mp451.4MB
- lectures/week2/02-shortest-paths/Algorithms Part II 4.3 Edge-Weighted DAGs (1923).mp426.49MB
- lectures/week2/02-shortest-paths/Algorithms Part II 4.4 Negative Weights (2101).mp427.84MB
- lectures/week3/01-maximum-flow/Algorithms Part II 5.0 Introduction to Maxflow (1033).mp414.99MB
- lectures/week3/01-maximum-flow/Algorithms Part II 5.1 Ford-Fulkerson Algorithm (632).mp48.51MB
- lectures/week3/01-maximum-flow/Algorithms Part II 5.2 Maxflow-Mincut Theorem (938).mp420.43MB
- lectures/week3/01-maximum-flow/Algorithms Part II 5.3 Running Time Analysis (8-49).mp412.67MB
- lectures/week3/01-maximum-flow/Algorithms Part II 5.4 Java Implementation (14-29).mp418.85MB
- lectures/week3/01-maximum-flow/Algorithms Part II 5.5 Maxflow Applications (22-20).mp433.19MB
- lectures/week3/02-radix-sorts/Algorithms Part II 6.0 Strings in Java (17-43).mp425.38MB
- lectures/week3/02-radix-sorts/Algorithms Part II 6.1 Key-Indexed Counting (12-06).mp416.76MB
- lectures/week3/02-radix-sorts/Algorithms Part II 6.2 LSD Radix Sort (15-00).mp420.7MB
- lectures/week3/02-radix-sorts/Algorithms Part II 6.3 MSD Radix Sort (13-41).mp418.77MB
- lectures/week3/02-radix-sorts/Algorithms Part II 6.4 3-way Radix Quicksort (7-22).mp411.91MB
- lectures/week3/02-radix-sorts/Algorithms Part II 6.5 Suffix Arrays (1925).mp455.3MB
- lectures/week5/01-tries/Algorithms Part II 7.0 R-way Tries (3219).mp461.75MB
- lectures/week5/01-tries/Algorithms Part II 7.1 Ternary Search Tries (2242).mp429.27MB
- lectures/week5/01-tries/Algorithms Part II 7.2 Character-Based Operations (2003).mp432.72MB
- lectures/week5/02-substring-search/Algorithms Part II 8.0 Introduction to Substring Search (642).mp49.04MB
- lectures/week5/02-substring-search/Algorithms Part II 8.1 Brute-Force Substring Search (1011).mp414.13MB
- lectures/week5/02-substring-search/Algorithms Part II 8.2 Knuth-Morris-Pratt (3314).mp445.04MB
- lectures/week5/02-substring-search/Algorithms Part II 8.3 Boyer-Moore (836).mp412.01MB
- lectures/week5/02-substring-search/Algorithms Part II 8.4 Rabin-Karp (1613).mp424.58MB
- lectures/week6/01-regular-expressions/Algorithms Part II 9.0 Regular Expressions (2003).mp430.83MB
- lectures/week6/01-regular-expressions/Algorithms Part II 9.1 REs and NFAs (1314).mp419.06MB
- lectures/week6/01-regular-expressions/Algorithms Part II 9.2 NFA Simulation (1827).mp435.25MB
- lectures/week6/01-regular-expressions/Algorithms Part II 9.3 NFA Construction (1142).mp416.56MB
- lectures/week6/01-regular-expressions/Algorithms Part II 9.4 Regular Expression Applications (2009).mp466.3MB
- lectures/week6/02-data-compression/Algorithms Part II 10.0 Introduction to Data Compression (2227).mp436.04MB
- lectures/week6/02-data-compression/Algorithms Part II 10.1 Run-Length Coding (559).mp49.11MB
- lectures/week6/02-data-compression/Algorithms Part II 10.2 Huffman Compression (2414).mp434.02MB
- lectures/week6/02-data-compression/Algorithms Part II 10.3 LZW Compression (2733).mp437.15MB
- lectures/week7/01-reductions/Algorithms Part II 11.0 Introduction to Reductions (925).mp417.45MB
- lectures/week7/01-reductions/Algorithms Part II 11.1 Designing Algorithms (813).mp411.87MB
- lectures/week7/01-reductions/Algorithms Part II 11.2 Establishing Lower Bounds (916).mp416.45MB
- lectures/week7/01-reductions/Algorithms Part II 11.3 Classifying Problems (12-45).mp418.52MB
- lectures/week7/02-linear-programming/Algorithms Part II 12.0 Brewer-'s Problem (21-15).mp429.77MB
- lectures/week7/02-linear-programming/Algorithms Part II 12.1 Simplex Algorithm (11-49).mp416.12MB
- lectures/week7/02-linear-programming/Algorithms Part II 12.2 Simplex Implementations (1621).mp479.71MB
- lectures/week7/02-linear-programming/Algorithms Part II 12.3 Linear Programming Reductions (11-46).mp420.79MB
- lectures/week7/03-intractability/Algorithms Part II 13.0 Introduction to Intractability (1700).mp434.49MB
- lectures/week7/03-intractability/Algorithms Part II 13.1 Search Problems (1056).mp421.23MB
- lectures/week7/03-intractability/Algorithms Part II 13.2 P vs. NP (1629).mp429.95MB
- lectures/week7/03-intractability/Algorithms Part II 13.3 Classifying Problems (1343).mp421.37MB
- lectures/week7/03-intractability/Algorithms Part II 13.4 NP-Completeness (1238).mp431.8MB
- lectures/week7/03-intractability/Algorithms Part II 13.5 Coping with Intractability (1401).mp421.66MB
不会用的朋友看这里
把磁力链接复制到离线下载,或者bt下载软件里即可下载文件,或者直接复制迅雷链接到迅雷里下载!
亲,你造吗?将网页分享给您的基友,下载的人越多速度越快哦!
违规内容投诉邮箱:[email protected]
概述
838888磁力搜索是一个磁力链接搜索引擎,是学术研究的副产品,用于解决资源过度分散的问题
它通过BitTorrent协议加入DHT网络,实时的自动采集数据,仅存储文件的标题、大小、文件列表、文件标识符(磁力链接)等基础信息
838888磁力搜索不下载任何真实资源,无法判断资源的合法性及真实性,使用838888磁力搜索服务的用户需自行鉴别内容的真伪
838888磁力搜索不上传任何资源,不提供Tracker服务,不提供种子文件的下载,这意味着838888磁力搜索 838888磁力搜索是一个完全合法的系统