Graph Search, Shortest Paths, and Data Structures

This course is part of Algorithms Specialization

Instructor: Tim Roughgarden

Skills you'll gain

  •   Data Structures
  •   Network Routing
  •   Network Analysis
  •   Computational Thinking
  •   Graph Theory
  •   Algorithms
  •   Network Model
  •   Theoretical Computer Science

    • There are 4 modules in 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).

    Week 2

    Week 3

    Week 4

    Explore more from Algorithms

    C++: Data Structures and Algorithms

    Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

    Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

    Data Structures and Algorithms

    ©2025  ementorhub.com. All rights reserved