If you have ever used a navigation service to find 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, 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.
提供方
加州大学圣地亚哥分校
国立高等经济大学
数据结构与算法 專項課程加州大学圣地亚哥分校課程信息
109,267 次近期查看
學生職業成果
30%
完成這些課程後已開始新的職業生涯
24%
通過此課程獲得實實在在的工作福利
15%
加薪或升職
可分享的證書
完成後獲得證書
100% 在線
立即開始，按照自己的計劃學習。
第 3 門課程（共 6 門）
可靈活調整截止日期
根據您的日程表重置截止日期。
中級
完成時間大約為55 小時
英語（English）
字幕：英語（English）
您將獲得的技能
Graph TheoryGraphsGraph Algorithms
學生職業成果
30%
完成這些課程後已開始新的職業生涯
24%
通過此課程獲得實實在在的工作福利
15%
加薪或升職
可分享的證書
完成後獲得證書
100% 在線
立即開始，按照自己的計劃學習。
第 3 門課程（共 6 門）
可靈活調整截止日期
根據您的日程表重置截止日期。
中級
完成時間大約為55 小時
英語（English）
字幕：英語（English）
提供方
加州大学圣地亚哥分校
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.
教學大綱 - 您將從這門課程中學到什麼
完成時間為 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.
完成時間為 4 小時
5 個視頻 （總計 43 分鐘）, 3 個閱讀材料, 1 個測驗
5 個視頻
Graph Basics4分鐘
Representing Graphs9分鐘
Exploring Graphs14分鐘
Connectivity5分鐘
Previsit and Postvisit Orderings7分鐘
3 個閱讀材料
Welcome10分鐘
Slides and External References10分鐘
Slides and External References10分鐘
完成時間為 4 小時
Decomposition of Graphs 2
This week we continue to study graph decomposition algorithms, but now for directed graphs.
完成時間為 4 小時
4 個視頻 （總計 36 分鐘）, 1 個閱讀材料, 1 個測驗
4 個視頻
Topological Sort9分鐘
Strongly Connected Components7分鐘
Computing Strongly Connected Components10分鐘
1 個閱讀材料
Slides and External References10分鐘
完成時間為 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.
完成時間為 4 小時
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分鐘
完成時間為 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.
完成時間為 5 小時
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分鐘
審閱
來自ALGORITHMS ON GRAPHS的熱門評論
由 CS 提供2019年6月30日
Excellent Course for anyone looking to expertise Graph Algorithm. Professor's explained each problem and algorithm in a very easy to learn approach. Grades are tough and yet func to get challenged.
由 CC 提供2018年10月6日
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.
由 MM 提供2020年3月28日
An awesome overview of the graph algorithms. Some assignments are really challenging, but luckily forums are a great place where people have already faced them. A definitive recommendation!
由 CM 提供2017年3月6日
Overall good course, programming tasks are fun! However, some of the video lectures are only of average quality. Accent of the TA is sometimes confusing (fyi I'm not a native speaker).
關於 数据结构与算法 專項課程
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.
常見問題
When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.
Is financial aid available?
Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project. Learn more.
還有其他問題嗎？請訪問 學生幫助中心。
© 2020 Coursera Inc.保留所有權利。
