Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Online Course

Graph Search, Shortest Paths, and Data Structures

Stanford University via Coursera

(0)
253

Taken this course? Share your experience with other students. Write review

Overview

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

Help Center

Most commonly asked questions about Coursera

Reviews for Coursera's Graph Search, Shortest Paths, and Data Structures Based on 0 reviews

  • 5 star 0%
  • 4 star 0%
  • 3 star 0%
  • 2 star 0%
  • 1 star 0%

Did you take this course? Share your experience with other students.

Write a review

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free

Never stop learning Never Stop Learning!

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free