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

Gain next-level skills with Coursera Plus for $199 (regularly $399). Save now.

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

Instructor: Tim Roughgarden
92,869 already enrolled
(1,995 reviews)
Skills you'll gain
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
Breadth-first and depth-first search; computing strong components; applications.
What's included
9 videos4 readings2 assignments
Dijkstra's shortest-path algorithm.
What's included
4 videos2 readings2 assignments
Heaps; balanced binary search trees.
What's included
9 videos1 reading2 assignments
Hashing; bloom filters.
What's included
9 videos3 readings3 assignments
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 Trial
Status: Free TrialStanford University
Status: Free TrialStanford University
Why people choose Coursera for their career




Learner reviews
1,995 reviews
- 5 stars
86.12%
- 4 stars
11.51%
- 3 stars
1.70%
- 2 stars
0.25%
- 1 star
0.40%
Showing 3 of 1995
Reviewed on Dec 27, 2019
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
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.
Frequently asked questions
To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.
More questions
Financial aid available,




