Graph Search, Shortest Paths, and Data Structures

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

• Understand complex data structures
• Apply graph search algorithms
• Analyze connectivity and shortest paths
• Use algorithms in practical network applications

• Basic familiarity with the topic and its common terminology
• Readiness to practice through applied exercises or case-based work