普林斯顿大学丨算法第四版 Princeton University 丨 Algorithms Part 2

3.0万
53
2020-02-18 01:06:11
472
435
2130
58
原地址:https://www.coursera.org/learn/algorithms-part2 教材:Algorithms,Fourth Edition 算法 第四版 Algorithm part 1:av60977932
Artes, Scientia, Veritas | PhD | Combinatorics
视频选集
(1/66)
01_course-introduction
09:23
01_introduction-to-graphs
09:33
02_graph-api
14:48
03_depth-first-search
26:23
04_breadth-first-search
13:35
05_connected-components
18:57
06_graph-challenges
14:30
01_introduction-to-digraphs
08:31
02_digraph-api
04:57
03_digraph-search
20:58
04_topological-sort
12:55
05_strong-components
20:23
01_introduction-to-msts
04:05
02_greedy-algorithm
12:57
03_edge-weighted-graph-api
11:16
04_kruskals-algorithm
12:29
05_prims-algorithm
33:17
06_mst-context
10:35
01_shortest-paths-apis
10:52
02_shortest-path-properties
14:47
03_dijkstras-algorithm
18:59
04_edge-weighted-dags
19:24
05_negative-weights
21:03
01_introduction-to-maxflow
10:34
02_ford-fulkerson-algorithm
06:33
03_maxflow-mincut-theorem
09:40
04_running-time-analysis
08:50
05_java-implementation
14:30
06_maxflow-applications
22:21
01_strings-in-java
17:44
02_key-indexed-counting
12:07
03_lsd-radix-sort
15:01
04_msd-radix-sort
13:43
05_3-way-radix-quicksort
07:24
06_suffix-arrays
19:26
01_r-way-tries
32:20
02_ternary-search-tries
22:43
03_character-based-operations
20:04
01_introduction-to-substring-search
06:43
02_brute-force-substring-search
10:12
03_knuth-morris-pratt
33:16
04_boyer-moore
08:38
05_rabin-karp
16:15
01_regular-expressions
20:04
02_res-and-nfas
13:15
03_nfa-simulation
18:25
04_nfa-construction
11:43
05_regular-expression-applications
20:07
01_introduction-to-data-compression
22:28
02_run-length-coding
06:00
03_huffman-compression
24:15
04_lzw-compression
27:34
01_introduction-to-reductions
09:33
02_designing-algorithms
08:14
03_establishing-lower-bounds
09:24
04_classifying-problems
12:46
01_brewers-problem
21:17
02_simplex-algorithm
11:50
03_simplex-implementations
16:22
04_linear-programming-reductions
11:47
01_introduction-to-intractability
17:01
02_search-problems
10:58
03_p-vs-np
16:30
04_classifying-problems12
13:44
05_np-completeness
12:39
06_coping-with-intractability
14:02
客服
顶部
赛事库 课堂 2021拜年纪