Graph Search, Shortest Paths, and Data Structures

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

More details about the program

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

Specific details

Category of Education Computer Sciense and IT

University

Stanford University

Comments (0)

There are no comments posted here yet

Leave your comments

Search

Related Programs

As cyber security threats become more sophisticate ...
This class is offered as CS6250 at Georgia Tech wh ...
The program concentrates on questions of informati ...
Established in 1983, our department has grown into ...

 

©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 info@educom.net