I Understand
We use cookies.Click here for details.

Graph Search, Shortest Paths, and Data Structures

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

Created by Stanford University


brand

What you’ll learn


From this learning resource you may gain confidence with the skills sought from organizations these days. The most in demand technique in the educational opportunity that is commonly included from employers is Data Analysis.

Who will benefit?


Mapping content from this educational opportunity with nearly 10,000 data-related job descriptions, we discover that those interested in Data Scientist roles would benefit the most.