課程大綱：圖搜索、短路徑和數(shù)據(jù)結構培訓
Week 1Breadth-first and depth-first search; computing strong components; applications.
Week 2Dijkstra's shortest-path algorithm.
Week 3Heaps; balanced binary search trees.
Week 4Hashing; bloom filters.
加入高級會員獲得助教答疑
