Graph Search, Shortest Paths, and Data Structures
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives...
By Tim Roughgarden on Coursera
About This Course
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).
Topics Covered
Frequently Asked Questions
How much does Graph Search, Shortest Paths, and Data Structures cost?
Visit the Graph Search, Shortest Paths, and Data Structures course page for current pricing and available discounts.
Who teaches Graph Search, Shortest Paths, and Data Structures?
Graph Search, Shortest Paths, and Data Structures is taught by Tim Roughgarden, Stanford University.
What skill level is Graph Search, Shortest Paths, and Data Structures for?
This course is designed for advanced learners.
Similar Courses
HTML & CSS Coding for Beginners: Build your own portfolio!
Chris Dixon
Maya for Beginners: Animation
Lucas Ridley
JavaScript for Beginners (includes 6+ real life projects)
Kalob Taulien
Beginner Bootstrap 4: Hand code beautiful responsive websites fast
Chris Dixon