Chevron Left
Voltar para Algorithms on Graphs

Comentários e feedback de alunos de Algorithms on Graphs da instituição Universidade da Califórnia, San Diego

2,143 classificações

Sobre o curso

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 a 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 online course, you will first learn what a graph is and what are some of the most important properties. Then you'll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will then talk about shortest paths algorithms — from the basic ones to those which open door for 1000000 times faster algorithms used in Google Maps and other navigational services. You will use these algorithms if you choose to work on our Fast Shortest Routes industrial capstone project. 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....

Melhores avaliações


30 de jun de 2019

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.


6 de out de 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.

Filtrar por:

326 — 343 de 343 Avaliações para o Algorithms on Graphs

por Pancerny M

21 de abr de 2020

por Prakhar A

1 de jul de 2020

por Мозоленко В К

26 de ago de 2019

por Pengchong L

18 de mar de 2019

por Tarek S

13 de ago de 2019

por Venkata S R M

12 de jul de 2020


21 de jul de 2020

por Araslanova A

24 de mar de 2017

por Sherif W

6 de jun de 2016

por Eduard C

18 de set de 2021

por Isaiah L

12 de abr de 2017

por Евгений С

23 de nov de 2020

por Alireza Z

18 de fev de 2021

por Nikhil C

29 de jan de 2020

por Yuriy

31 de jan de 2020

por Ahmed M

6 de jun de 2020

por WeichuDuan

7 de ago de 2017


12 de ago de 2016