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.

提供方

## 課程信息

### 學生職業成果

## 30%

## 24%

## 15%

#### 可分享的證書

#### 100% 在線

#### 第 3 門課程（共 6 門）

#### 可靈活調整截止日期

#### 中級

#### 完成時間大約為55 小時

#### 英語（English）

### 您將獲得的技能

### 學生職業成果

## 30%

## 24%

## 15%

#### 可分享的證書

#### 100% 在線

#### 第 3 門課程（共 6 門）

#### 可靈活調整截止日期

#### 中級

#### 完成時間大約為55 小時

#### 英語（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 個視頻**

**3 個閱讀材料**

**完成時間為 4 小時**

## Decomposition of Graphs 2

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

**完成時間為 4 小時**

**4 個視頻**

**1 個閱讀材料**

**完成時間為 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 個視頻**

**1 個閱讀材料**

**完成時間為 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 個視頻**

**2 個閱讀材料**

### 審閱

#### 4.7

##### 來自ALGORITHMS ON GRAPHS的熱門評論

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.

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.

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!

Overall good course, programming tasks are fun!\n\nHowever, 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 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.

very well planned course and fairly challenging assignments. Would recommend this to anyone working as developer who does not have formal education in data structures and algorithms.

Awesome course! Learned a lot about graphs, and I thought it was super awesome. One recommendation is to make the proof videos more engaging, but otherwise, the course was perfect!

Very interesting and well presented course. I particularly wanted to learn more on graphs and this helped me get not only a basic but a more advanced understanding.

Fairly good course. I wish the edge cases for some of the programming assignments had some more discussions. Needed some sifting through the forums while stuck.

Loved the explanations and proofs. They are so explicitly told. And the discussion forum for you well assorted problems in assignment is really helpful.

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!

So far my favorite course of the specialization. The learning path is really smooth and the lectures and programming assignments are to the point.

Great content! And explained very well. I was asked a question on graphs in my amazon interview. Wish I had taken the course earlier. Thanks!

This was an awesome course on graphs and was perfectly taught by the instructors. I thank instructors for such lucid and clear explanations.

Awesome course content. Although assignments for the first weeks are very straight forward unlike the other courses in this specialisation.

Excellent course. Like with the other courses in the series the programming assignment are a great help for understanding the material.

It was really a good experience.\n\nThank You to all the instructors and people who are directly/indirectly related to this course.

this course provides the simplist way to explain algorithms, but more exercises may be helpful to improve understanding of topics.

Great course! it would be better if the course provide more problems that is not directly the implementation of what is taught

This course focussed a lot on the crucial graph algorithms in Computer Science and sets a good base to build up on later.

## 關於 数据结构与算法 專項課程

## 常見問題

我什么时候能够访问课程视频和作业？

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

我订阅此专项课程后会得到什么？

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

退款政策是如何规定的？

有助学金吗？

還有其他問題嗎？請訪問 學生幫助中心。