Chevron Left
Volver a Algorithms on Graphs

Opiniones y comentarios de aprendices correspondientes a Algorithms on Graphs por parte de Universidad de California en San Diego

4.7
estrellas
2,143 calificaciones

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

Principales reseñas

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

1 - 25 de 343 revisiones para Algorithms on Graphs

por Shuo Z

27 de jun. de 2016

por Maksadbek

19 de ene. de 2019

por Milos M

29 de mar. de 2020

por Jonathan O

15 de nov. de 2018

por Andrei K

16 de nov. de 2018

por Priyansh B

10 de oct. de 2018

por Md. A H Z 1

28 de oct. de 2018

por Andrey T

27 de jul. de 2016

por Jasvin M

7 de jul. de 2020

por Greg G

1 de feb. de 2020

por Jan F

7 de oct. de 2018

por Navid

25 de oct. de 2019

por Vlad N

14 de jun. de 2018

por Tushar G

8 de ago. de 2016

por Shubham S

24 de abr. de 2018

por Kishor K P

15 de mar. de 2018

por JIA N

18 de mar. de 2018

por Rudolf Z

7 de nov. de 2018

por Oleksandr S

9 de jun. de 2019

por To P H

20 de sep. de 2018

por Akshive P

4 de oct. de 2018

por Henry R

4 de jul. de 2018

por Vivek N

18 de ago. de 2016

por surya

6 de nov. de 2018

por Zsolt S

16 de ago. de 2016