Graph Search, Shortest Paths, and Data Structures

Add to Favourites
1 1 1 1 1
Price: 7167 EUR 7167 EUR
Contact Stanford University

More details about the program


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

Specific details

Category of Education Computer Sciense and IT


Stanford University