Graph Search, Shortest Paths, and Data Structures

Stanford University

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

Certificate Available ✔

Get Started / More Info
Graph Search, Shortest Paths, and Data Structures
More Algorithms Courses

Data Science Foundations: Data Structures and Algorithms

University of Colorado Boulder

Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform...

Algorithmic Toolbox

University of California San Diego

This online course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching,...

Cloud Computing Concepts, Part 1

University of Illinois at Urbana-Champaign

Cloud computing systems today, whether open-source or used inside companies, are built using a common set of core techniques, algorithms, and design philosophies...

The Blockchain

University of California, Irvine

Begin your exploration of blockchain technologies with a look at fundamental blockchain concepts along with an application in which blockchain technology plays a...