课程信息
4.7
1,039 个评分
173 个审阅

第 3 门课程(共 6 门)

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

根据您的日程表重置截止日期。

中级

完成时间大约为17 小时

建议:5 weeks of study, 3-4 hours/week...

英语(English)

字幕:英语(English)

您将获得的技能

Graph TheoryGraphsGraph Algorithms

第 3 门课程(共 6 门)

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

根据您的日程表重置截止日期。

中级

完成时间大约为17 小时

建议:5 weeks of study, 3-4 hours/week...

英语(English)

字幕:英语(English)

教学大纲 - 您将从这门课程中学到什么

1
完成时间为 4 小时

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 个视频 (总计 43 分钟), 3 个阅读材料, 1 个测验
5 个视频
Representing Graphs9分钟
Exploring Graphs14分钟
Connectivity5分钟
Previsit and Postvisit Orderings7分钟
3 个阅读材料
Welcome10分钟
Slides and External References10分钟
Slides and External References10分钟
2
完成时间为 4 小时

Decomposition of Graphs 2

This week we continue to study graph decomposition algorithms, but now for directed graphs....
4 个视频 (总计 36 分钟), 1 个阅读材料, 1 个测验
4 个视频
Topological Sort9分钟
Strongly Connected Components7分钟
Computing Strongly Connected Components10分钟
1 个阅读材料
Slides and External References10分钟
3
完成时间为 4 小时

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 个视频 (总计 55 分钟), 1 个阅读材料, 1 个测验
8 个视频
Breadth-First Search7分钟
Breadth-First Search (continued)6分钟
Implementation and Analysis9分钟
Proof of Correctness7分钟
Proof of Correctness (continued)5分钟
Shortest-Path Tree6分钟
Reconstructing the Shortest Path3分钟
1 个阅读材料
Slides and External References10分钟
4
完成时间为 5 小时

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 个视频 (总计 86 分钟), 2 个阅读材料, 1 个测验
12 个视频
Naive Algorithm10分钟
Dijkstra's Algorithm: Intuition and Example7分钟
Dijkstra's Algorithm: Implementation3分钟
Dijkstra's Algorithm: Proof of Correctness4分钟
Dijkstra's Algorithm: Running Time7分钟
Currency Exchange6分钟
Currency Exchange: Reduction to Shortest Paths8分钟
Bellman-Ford Algorithm6分钟
Bellman-Ford Algorithm: Proof of Correctness6分钟
Negative Cycles7分钟
Infinite Arbitrage10分钟
2 个阅读材料
Slides and External References10分钟
Slides and External References10分钟
5
完成时间为 4 小时

Minimum Spanning Trees

In this module, we study the minimum spanning tree problem. We will cover two elegant greedy algorithms for this problem: the first one is due to Kruskal and uses the disjoint sets data structure, the second one is due to Prim and uses the priority queue data structure. In the programming assignment for this module you will be computing an optimal way of building roads between cities and an optimal way of partitioning a given set of objects into clusters (a fundamental problem in data mining)....
5 个视频 (总计 53 分钟), 1 个阅读材料, 1 个测验
5 个视频
Greedy Algorithms4分钟
Cut Property9分钟
Kruskal's Algorithm15分钟
Prim's Algorithm13分钟
1 个阅读材料
Slides and External References10分钟
6
完成时间为 34 小时

Advanced Shortest Paths Project (Optional)

In this module, you will learn Advanced Shortest Paths algorithms that work in practice 1000s (up to 25000) of times faster than the classical Dijkstra's algorithm on real-world road networks and social networks graphs. You will work on a Programming Project based on these algorithms. You will find the shortest paths on the real maps of parts of US and the shortest paths connecting people in the social networks. We encourage you not only to use the ideas from this module's lectures in your implementations, but also to come up with your own ideas for speeding up the algorithm! We encourage you to compete on the forums to see whose implementation is the fastest one :)...
17 个视频 (总计 130 分钟), 3 个阅读材料, 2 个测验
17 个视频
Bidirectional Search10分钟
Six Handshakes6分钟
Bidirectional Dijkstra5分钟
Finding Shortest Path after Meeting in the Middle9分钟
Computing the Distance2分钟
A* Algorithm11分钟
Performance of A*2分钟
Bidirectional A*6分钟
Potential Functions and Lower Bounds5分钟
Landmarks (Optional)10分钟
Highway Hierarchies and Node Importance7分钟
Preprocessing7分钟
Witness Search10分钟
Query8分钟
Proof of Correctness9分钟
Node Ordering14分钟
3 个阅读材料
Slides and External References10分钟
Slides and External References10分钟
Slides and External Refernces10分钟
1 个练习
Bidirectional Dijkstra, A* and Contraction Hierarchies
4.7
173 个审阅Chevron Right

15%

完成这些课程后已开始新的职业生涯

11%

通过此课程获得实实在在的工作福利

热门审阅

创建者 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.

创建者 EMSep 23rd 2017

Great!\n\nHard concepts explained clearly and in depth, in the same fashion as the previous two courses (Algo Toolbox and Data Structure).\n\nGood job!

讲师

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Daniel M Kane

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

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

关于 加州大学圣地亚哥分校

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

关于 国立高等经济大学

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

关于 数据结构与算法 专项课程

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....
数据结构与算法

常见问题

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您注册课程后,将有权访问专项课程中的所有课程,并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

还有其他问题吗?请访问 学生帮助中心