Graph Algorithms

Обучение бесплатное
Сертификация платная
2 часа курса
О курсе

If you have ever used a navigation service to find the optimal route and estimate time to destination, you've used algorithms on graphs.

Graphs arise in various real-world situations, as there are road networks, water and electricity supply 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 in Facebook, you're going to work with graphs and algorithms on graphs.

In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn what a graph is and its most important properties. You’ll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will also talk about shortest paths algorithms. We will finish with minimum spanning trees, which are used to plan road, telephone and computer networks and also find applications in clustering and approximate algorithms.

Graph Algorithms
Learn how to use algorithms to explore graphs, compute shortest distance, min spanning tree, and connected components.
Что Вы изучите?
  • Graph exploration and decomposition into connected components
  • Shortest paths algorithms, including breadth-first search, Dijkstra’s algorithm and Bellman-Ford algorithm
  • Minimum spanning tree algorithms
Daniel Kane
Daniel Kane
Assistant Professor, Computer Science and Engineering & Dept. of Mathematics UC San Diego
Daniel is an assistant professor at UCSD with a joint appointment between the Department of Computer Science and Engineering and the Department of Mathematics. He holds B.S. from MIT and Ph.D. from Harvard.
Alexander S. Kulikov
Alexander S. Kulikov
Visiting Professor UC San Diego
Alexander is a research fellow at Steklov Mathematical Institute at St. Petersburg, Russia and a visiting professor at University of California, San Diego. He have been teaching algorithms classes for more than eight years.
Michael Levin
Michael Levin
Chief Data Scientist Yandex.Market
Michael serves as chief data scientist at Yandex.Market (Yandex is the leading Internet company in Russia, and Yandex.Market is the leading service for price comparison online shopping in Russia). He has a degree in mathematics from Moscow State University. During his studies Michael was a silver and bronze medalist of ACM ICPC World Finals as a member of Moscow State University team.
Эта платформа предоставляет все курсы бесплатно. Авторами выступают топовые университеты и корпорации, которые стараются удерживать стандарты качества. За несоблюдение дедлайнов, невыполнение домашнего задания студенты теряют баллы. Как и в других платформах, лекционные видео чередуются с практическими заданиями. Обучение проводится на английском, китайском, испанском, французском и хинди.
Graph Algorithms