The University Network

Graph Search, Shortest Paths, and Data Structures

Description

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

Price: Enroll For Free!

Language: English

Subtitles: English

Graph Search, Shortest Paths, and Data Structures – Stanford University