Home Stanford Graph Search, Shortest Paths, and Data Structures

Graph Search, Shortest Paths, and Data Structures

95
0
Graph Search, Shortest Paths, and Data Structures
Stanford University Online Course Highlights
  • weeks long
  • 4-8 hours a week
  • FREE, Upgradable
  • Self-Paced
  • Taught by:Tim Roughgarden, Professor
  • View Course Syllabus

stanford

Online Course Details:

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).

SKILLS YOU WILL GAIN

  • Graphs
  • Data Structure
  • Algorithms
  • Hash Table

Take This Online Course