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

4.7
estrelas
1,870 classificações
313 avaliaçõ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 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, 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

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

CC
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:

201 — 225 de 303 Avaliações para o Algorithms on Graphs

por pengwei

11 de Dez de 2016

great course

por Neeraj S A

2 de Out de 2016

Great Course

por Weidong X

13 de Jul de 2016

Good course!

por Sumit T

23 de Ago de 2020

exceptional

por Manish S

17 de Jan de 2020

its awesome

por uddeshya p

2 de Set de 2019

its awesome

por Carlos D R S

22 de Jul de 2017

Está perro.

por Đặng T S

11 de Dez de 2016

nice course

por MANCHALA L

19 de Ago de 2020

Excellent.

por Om P

13 de Jul de 2017

Awesome !!

por Shiv M V

3 de Nov de 2020

Excellent

por Ritik M

21 de Set de 2020

excellent

por Prabhu N S

14 de Jul de 2020

excellent

por nguyen7thai

18 de Set de 2016

Very good

por Alvin R Y

1 de Nov de 2020

awesome!

por Sai C

15 de Jun de 2020

great !!

por Huimeng Z

13 de Mai de 2020

helpful!

por Chen X

13 de Mar de 2019

Useful

por Andrea Q

17 de Set de 2017

useful

por Md. R Q S

10 de Set de 2020

great

por Tushar G

18 de Jul de 2016

great

por Sasisrivundavilli

18 de Out de 2020

good

por D A

19 de Abr de 2020

good

por RICARDO G

24 de Mai de 2017

G

por ftgo

9 de Set de 2020

Another very interesting course. Slightly lighter than the previous ones, this is focused on graphs and their applications in shorter path and vertex connectivity.

* Interesting to see connectivity (minimum spanning tree) applied to other domains, such as data clustering with K-Means;

* Dijkstra's algorithm is still the basis of everything to search for the shortest path. Optional content features improvements that enable applications on real world maps and social networks. It worths to revisit in the future and participate in routing challenges.