This course includes
Course Overview
This technology-agnostic course will teach you about many classical graph algorithms essential for a well-rounded software engineer. You will begin with an introduction to the running-time analysis of algorithms and the representation and structure of graphs. You’ll cover the depth-first search algorithm and its many applications, like detecting cycles, topological sorting, and identifying cut-vertices and strongly connected components. You will then cover algorithms for finding shortest paths and minimum...
What You'll Learn
An understanding of classical graph algorithms
The ability to think and visualize in terms of graph structures
An inside-out understanding of what makes each algorithm work the way it does
Cultivation of a broader perspective that informs other computing disciplines
What You'll Learn
An understanding of classical graph algorithms
Show more
Course Content
Introduction
Review: Asymptotic Notation and Math Prerequisites
Working with Graphs
Depth-First Search and Applications
Prelude: Shortest Paths
Single-source Shortest Paths in Weighted Digraphs
12 Lessons
All Pairs Shortest Paths
5 Lessons
Minimum Spanning Tree
12 Lessons
Flows
6 Lessons
Matchings and Vertex Covers
11 Lessons
Conclusion
1 Lesson
Trusted by 1.4 million developers working at companies
Anthony Walker
@_webarchitect_
Emma Bostian 🐞
@EmmaBostian
Evan Dunbar
ML Engineer
Carlos Matias La Borde
Software Developer
Souvik Kundu
Front-end Developer
Vinay Krishnaiah
Software Developer
Eric Downs
Musician/Entrepeneur
Kenan Eyvazov
DevOps Engineer
Souvik Kundu
Front-end Developer
Eric Downs
Musician/Entrepeneur
Anthony Walker
@_webarchitect_
Emma Bostian 🐞
@EmmaBostian
See how Educative uses AI to make your learning more immersive than ever before.
Instant Code Feedback
AI-Powered Mock Interviews
Adaptive Learning
Explain with AI
AI Code Mentor