Graph Search, Shortest Paths, and Data Structures

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

This course starts from the beginning, covering th ...
In this course we will learn about Recommender Sys ...
Have you ever wanted to build a new musical instru ...
The job of a data scientist is to glean knowledge ...


©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