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).
Ce cours fait partie de la Spécialisation Algorithmes
Offert par
À propos de ce cours
Compétences que vous acquerrez
- Graphs
- Data Structure
- Algorithms
- Hash Table
Offert par
Programme de cours : ce que vous apprendrez dans ce cours
Week 1
Week 2
Week 3
Week 4
Avis
- 5 stars86,17 %
- 4 stars11,48 %
- 3 stars1,71 %
- 2 stars0,25 %
- 1 star0,36 %
Meilleurs avis pour GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
Very useful information for thorough programmers. Especially liked analysis of hash tables implementation and handling collisions in real applications.
It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.
Very well put together course. Problem sets are tricky; however, by the end of the course, you feel quite accomplished and comfortable dealing with graphs and basic data structures.
Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.
À propos du Spécialisation Algorithmes

Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Une aide financière est-elle possible ?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.