|
所在平台: Coursera |
课程主页: https://www.coursera.org/learn/algorithms-graphs-data-structures
课程评论：没有评论
课程名称：图搜索、最短路径与数据结构 课程概述：本部分专门化的主要主题包括数据结构（堆、平衡搜索树、哈希表、布隆过滤器）、图形原语（广度优先和深度优先搜索的应用、连通性、最短路径）及其应用（从去重到社交网络分析）。 课程大纲： 第1周：广度优先和深度优先搜索；计算强连通分量；应用。 第2周：Dijkstra最短路径算法。 第3周：堆；平衡二叉搜索树。 第4周：哈希技术；布隆过滤器。
Part: 1
Title:Week 1
Description:Breadth-first and depth-first search; computing strong components; applications.
Part: 2
Title:Week 2
Description:Dijkstra's shortest-path algorithm.
Part: 3
Title:Week 3
Description:Heaps; balanced binary search trees.
Part: 4
Title:Week 4
Description:Hashing; bloom filters.
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
