Graph Search, Shortest Paths, and Data Structures
Stanford University via Coursera
Overview
Class Central Tips
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).
Syllabus
- Week 1
- Breadth-first and depth-first search; computing strong components; applications.
- Week 2
- Dijkstra's shortest-path algorithm.
- Week 3
- Heaps; balanced binary search trees.
- Week 4
- Hashing; bloom filters.
Taught by
Tim Roughgarden
Tags
Related Courses
-
Algorithms, Part II
Princeton University
4.8 -
Data Structures: An Active Learning Approach
University of California, San Diego
5.0 -
Data Structures
University of Madras, Chennai, CEC
-
Algorithms
Stanford University
-
Introduction to Data Structures & Algorithms in Java
-
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University
Reviews
0.0 rating, based on 0 reviews
Never Stop Learning!
