About this Course

90,753 recent views

Learner Career Outcomes

30%

started a new career after completing these courses

24%

got a tangible career benefit from this course

15%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 55 hours to complete
English

Skills you will gain

Graph TheoryGraphsGraph Algorithms

Learner Career Outcomes

30%

started a new career after completing these courses

24%

got a tangible career benefit from this course

15%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 55 hours to complete
English

Offered by

Placeholder

University of California San Diego

Placeholder

National Research University Higher School of Economics

Syllabus - What you will learn from this course

Content RatingThumbs Up91%(8,524 ratings)Info
Week
1

Week 1

4 hours to complete

Decomposition of Graphs 1

4 hours to complete
5 videos (Total 43 min), 4 readings, 1 quiz
5 videos
Representing Graphs9m
Exploring Graphs14m
Connectivity5m
Previsit and Postvisit Orderings7m
4 readings
Welcome10m
Rules on the academic integrity in the course10m
Slides and External References10m
Slides and External References10m
Week
2

Week 2

4 hours to complete

Decomposition of Graphs 2

4 hours to complete
4 videos (Total 36 min), 1 reading, 1 quiz
4 videos
Topological Sort9m
Strongly Connected Components7m
Computing Strongly Connected Components10m
1 reading
Slides and External References10m
Week
3

Week 3

4 hours to complete

Paths in Graphs 1

4 hours to complete
8 videos (Total 55 min), 1 reading, 1 quiz
8 videos
Breadth-First Search7m
Breadth-First Search (continued)6m
Implementation and Analysis9m
Proof of Correctness7m
Proof of Correctness (continued)5m
Shortest-Path Tree6m
Reconstructing the Shortest Path3m
1 reading
Slides and External References10m
Week
4

Week 4

5 hours to complete

Paths in Graphs 2

5 hours to complete
12 videos (Total 86 min), 2 readings, 1 quiz
12 videos
Naive Algorithm10m
Dijkstra's Algorithm: Intuition and Example7m
Dijkstra's Algorithm: Implementation3m
Dijkstra's Algorithm: Proof of Correctness4m
Dijkstra's Algorithm: Running Time7m
Currency Exchange6m
Currency Exchange: Reduction to Shortest Paths8m
Bellman-Ford Algorithm6m
Bellman-Ford Algorithm: Proof of Correctness6m
Negative Cycles7m
Infinite Arbitrage10m
2 readings
Slides and External References10m
Slides and External References10m

Reviews

TOP REVIEWS FROM ALGORITHMS ON GRAPHS

View all reviews

About the Data Structures and Algorithms Specialization

Data Structures and Algorithms

Frequently Asked Questions

More questions? Visit the Learner Help Center.