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).

Graph Search, Shortest Paths, and Data Structures
Keep adding new skills with 10,000+ programs for $239 (usually $399). Save now.

Graph Search, Shortest Paths, and Data Structures
This course is part of Algorithms Specialization

Instructor: Tim Roughgarden
93,679 already enrolled
Included with
2,000 reviews
Details to know

Add to your LinkedIn profile
9 assignments
See how employees at top companies are mastering in-demand skills

Build your subject-matter expertise
- Learn new concepts from industry experts
- Gain a foundational understanding of a subject or tool
- Develop job-relevant skills with hands-on projects
- Earn a shareable career certificate

There are 4 modules in this course
Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.
Instructor

Offered by
Explore more from Algorithms
Status: PreviewBirla Institute of Technology & Science, Pilani
Status: Free TrialStanford University
Status: Free Trial
Status: Free Trial
Why people choose Coursera for their career

Felipe M.

Jennifer J.

Larry W.

Chaitanya A.
Learner reviews
- 5 stars
86.06%
- 4 stars
11.48%
- 3 stars
1.69%
- 2 stars
0.24%
- 1 star
0.49%
Showing 3 of 2000
Reviewed on Mar 29, 2020
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.
Reviewed on Jun 8, 2021
Thanks a lot to Prof Roughgarden for great lectures, to course mentors and fellow students for fruitful discussions. It was a hard, but insanely informative course.
Reviewed on Nov 30, 2019
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.




