Graph Search, Shortest Paths, and Data Structures

Add to Favourites
1 1 1 1 1
Price: 1610 EUR 1610 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

Comments (0)

There are no comments posted here yet

Leave your comments


Related Programs

Technology drives society, and computer science is ...
As part of our Professional Certificate Program in ...
This Specialization builds on the success of the P ...
*Note - This is an Archived course* This is a p ...


©2023 EDUCOM NET. All Rights Reserved.

If you find an inaccuracy or you have comments on the description of the university or program - please let us know