À propos de ce cours
48,218 consultations récentes

100 % en ligne

Commencez dès maintenant et apprenez aux horaires qui vous conviennent.

Dates limites flexibles

Réinitialisez les dates limites selon votre disponibilité.

Niveau intermédiaire


Sous-titres : Anglais

Compétences que vous acquerrez

Graph TheoryGraphsGraph Algorithms

100 % en ligne

Commencez dès maintenant et apprenez aux horaires qui vous conviennent.

Dates limites flexibles

Réinitialisez les dates limites selon votre disponibilité.

Niveau intermédiaire


Sous-titres : Anglais

Programme du cours : ce que vous apprendrez dans ce cours

4 heures pour terminer

Decomposition of Graphs 1

Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect set of computers into a network or efficient algorithm to automatically find communities and opinion leaders hot in Facebook, you're going to work with graphs and algorithms on graphs. In this module, you will learn ways to represent a graph as well as basic algorithms for decomposing graphs into parts. In the programming assignment of this module, you will apply the algorithms that you’ve learned to implement efficient programs for exploring mazes, analyzing Computer Science curriculum, and analyzing road networks. In the first week of the module, we focus on undirected graphs.

5 vidéos (Total 43 min), 3 lectures, 1 quiz
5 vidéos
Representing Graphs9 min
Exploring Graphs14 min
Connectivity5 min
Previsit and Postvisit Orderings7 min
3 lectures
Welcome10 min
Slides and External References10 min
Slides and External References10 min
4 heures pour terminer

Decomposition of Graphs 2

This week we continue to study graph decomposition algorithms, but now for directed graphs.

4 vidéos (Total 36 min), 1 lecture, 1 quiz
4 vidéos
Topological Sort9 min
Strongly Connected Components7 min
Computing Strongly Connected Components10 min
1 lecture
Slides and External References10 min
4 heures pour terminer

Paths in Graphs 1

In this module you will study algorithms for finding Shortest Paths in Graphs. These algorithms have lots of applications. When you launch a navigation app on your smartphone like Google Maps or Yandex.Navi, it uses these algorithms to find you the fastest route from work to home, from home to school, etc. When you search for airplane tickets, these algorithms are used to find a route with the minimum number of plane changes. Unexpectedly, these algorithms can also be used to determine the optimal way to do currency exchange, sometimes allowing to earh huge profit! We will cover all these applications, and you will learn Breadth-First Search, Dijkstra's Algorithm and Bellman-Ford Algorithm. These algorithms are efficient and lay the foundation for even more efficient algorithms which you will learn and implement in the Shortest Paths Capstone Project to find best routes on real maps of cities and countries, find distances between people in Social Networks. In the end you will be able to find Shortest Paths efficiently in any Graph. This week we will study Breadth-First Search algorithm.

8 vidéos (Total 55 min), 1 lecture, 1 quiz
8 vidéos
Breadth-First Search7 min
Breadth-First Search (continued)6 min
Implementation and Analysis9 min
Proof of Correctness7 min
Proof of Correctness (continued)5 min
Shortest-Path Tree6 min
Reconstructing the Shortest Path3 min
1 lecture
Slides and External References10 min
5 heures pour terminer

Paths in Graphs 2

This week we continue to study Shortest Paths in Graphs. You will learn Dijkstra's Algorithm which can be applied to find the shortest route home from work. You will also learn Bellman-Ford's algorithm which can unexpectedly be applied to choose the optimal way of exchanging currencies. By the end you will be able to find shortest paths efficiently in any Graph.

12 vidéos (Total 86 min), 2 lectures, 1 quiz
12 vidéos
Naive Algorithm10 min
Dijkstra's Algorithm: Intuition and Example7 min
Dijkstra's Algorithm: Implementation3 min
Dijkstra's Algorithm: Proof of Correctness4 min
Dijkstra's Algorithm: Running Time7 min
Currency Exchange6 min
Currency Exchange: Reduction to Shortest Paths8 min
Bellman-Ford Algorithm6 min
Bellman-Ford Algorithm: Proof of Correctness6 min
Negative Cycles7 min
Infinite Arbitrage10 min
2 lectures
Slides and External References10 min
Slides and External References10 min
176 avisChevron Right


a commencé une nouvelle carrière après avoir terminé ces cours


a bénéficié d'un avantage concret dans sa carrière grâce à ce cours


a obtenu une augmentation de salaire ou une promotion

Principaux examens pour Algorithms on Graphs

par CCOct 7th 2018

Good balance between theory and practice. The assignments are well thought to measure the understanding of videos, which I had to watch many times to grasp the hidden tips from the instructor.

par SKApr 24th 2018

This course is very much helpful for the graph beginners. As a suggestion, i would like to say that add some extra contents on the data structures which is to be used in the algorithm.



Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering

Michael Levin

Computer Science

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

À propos de Université de Californie à San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

À propos de Université nationale de recherche, École des hautes études en sciences économiques

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

À propos de la Spécialisation Structures de données et algorithmes

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
Structures de données et algorithmes

Foire Aux Questions

  • Une fois que vous êtes inscrit(e) pour un Certificat, vous pouvez accéder à toutes les vidéos de cours, et à tous les quiz et exercices de programmation (le cas échéant). Vous pouvez soumettre des devoirs à examiner par vos pairs et en examiner vous-même uniquement après le début de votre session. Si vous préférez explorer le cours sans l'acheter, vous ne serez peut-être pas en mesure d'accéder à certains devoirs.

  • Lorsque vous vous inscrivez au cours, vous bénéficiez d'un accès à tous les cours de la Spécialisation, et vous obtenez un Certificat lorsque vous avez réussi. Votre Certificat électronique est alors ajouté à votre page Accomplissements. À partir de cette page, vous pouvez imprimer votre Certificat ou l'ajouter à votre profil LinkedIn. Si vous souhaitez seulement lire et visualiser le contenu du cours, vous pouvez accéder gratuitement au cours en tant qu'auditeur libre.

D'autres questions ? Visitez le Centre d'Aide pour les Etudiants.