YoVDO

Graph Search, Shortest Paths, and Data Structures

Offered By: Stanford University via Coursera

Tags

Algorithms and Data Structures Courses Dijkstra's Algorithm Courses Data Structures Courses Hash Tables Courses Breadth-First Search Courses Depth-First Search Courses Bloom Filters Courses Heaps Courses

Course Description

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

Tags

Related Courses

Robotics: Capstone
University of Pennsylvania via Coursera Algorithms on Graphs
University of California, San Diego via Coursera Graph Algorithms
University of California, San Diego via edX Motion Planning for Self-Driving Cars
University of Toronto via Coursera Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
Georgia Institute of Technology via edX