|
所在平台: Coursera |
课程主页: https://www.coursera.org/learn/cs-fundamentals-3
课程评论：没有评论
课程名称：无序数据结构 概述：无序数据结构课程涵盖了实现哈希表、不相交集和图所需的数据结构和算法。这些基础数据结构对于处理无序数据非常有用。例如，哈希表提供了通过任意键值（如数字、URL或字典）立即访问数据的能力。图则用于表示项目之间的关系，本课程讨论了多种表示图的数据结构以及多种图的遍历算法，包括找到一个节点到另一个节点的最短路径。图算法还依赖于一种称为不相交集的概念，因此本课程还将涵盖其数据结构及相关算法。 课程大纲： 1. 部分：导论；哈希 2. 部分：不相交集 3. 部分：图数据结构 4. 部分：图算法
Part: 1
Title:Orientation; Hashing
Description:
Part: 2
Title:Disjoint Sets
Description:
Part: 3
Title:Graph Data Structures
Description:
Part: 4
Title:Graph Algorithms
Description:
The Unordered Data Structures course covers the data structures and algorithms needed to implement hash tables, disjoint sets and graphs. These fundamental data structures are useful for unordered data. For example, a hash table provides immediate access to data indexed by an arbitrary key value, that could be a number (such as a memory address for cached memory), a URL (such as for a web cache) or a dictionary. Graphs are used to represent relationships between items, and this course covers several different data structures for representing graphs and several different algorithms for traversing graphs, including finding the shortest route from one node to another node. These graph algorithms will also depend on another concept called disjoint sets, so this course will also cover its data structure and associated algorithms.
