Stanford University - Graph Search, Shortest Paths, and Data Structures
5.0 /5- Offered byCoursera
Graph Search, Shortest Paths, and Data Structures at Coursera Overview
Graph Search, Shortest Paths, and Data Structures
at Coursera
Duration | 12 hours |
Mode of learning | Online |
Difficulty level | Intermediate |
Credential | Certificate |
Graph Search, Shortest Paths, and Data Structures at Coursera Highlights
Graph Search, Shortest Paths, and Data Structures
at Coursera
- Earn a Certificate on successful course completion from The Stanford University
- Get unlimited access to the course content
- Graded Assignments with Peer Feedback
- Shareable Specialization and Course Certificates
- 41 % Started a new career after completing this specialization
Read more
Graph Search, Shortest Paths, and Data Structures at Coursera Course details
Graph Search, Shortest Paths, and Data Structures
at Coursera
Skills you will learn
More 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)
Graph Search, Shortest Paths, and Data Structures at Coursera Curriculum
Graph Search, Shortest Paths, and Data Structures
at Coursera
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
Other courses offered by Coursera
– / –
3 months
Beginner
View Other 6715 Courses
Graph Search, Shortest Paths, and Data Structures
at Coursera
Student Forum
Anything you would want to ask experts?
TechnologyComputer ScienceData Structures and AlgorithmsGraph Search, Shortest Paths, and Data Structures