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.
Este curso forma parte de Programa Especializado - Estructuras de datos y algoritmos
Algorithms on Graphs
ofrecido por
Universidad de California en San Diego
National Research University Higher School of Economics
Acerca de este Curso
59,625 vistas recientes
Resultados profesionales del estudiante
30%
comenzó una nueva carrera después de completar estos cursos
24%
consiguió un beneficio tangible en su carrera profesional gracias a este curso
15%
consiguió un aumento de sueldo o ascenso
Habilidades que obtendrás
Graph TheoryGraphsGraph Algorithms
Resultados profesionales del estudiante
30%
comenzó una nueva carrera después de completar estos cursos
24%
consiguió un beneficio tangible en su carrera profesional gracias a este curso
15%
consiguió un aumento de sueldo o ascenso
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 3 de 6 en
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Nivel intermedio
Aprox. 16 horas para completar
Sugerido: 5 weeks of study, 3-4 hours/week
Inglés (English)
Subtítulos: Inglés (English)
Programa - Qué aprenderás en este curso
4 horas para completar
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 horas para completar
5 videos (Total 43 minutos), 3 lecturas, 1 cuestionario
5 videos
Representing Graphs9m
Exploring Graphs14m
Connectivity5m
Previsit and Postvisit Orderings7m
3 lecturas
Welcome10m
Slides and External References10m
Slides and External References10m
4 horas para completar
Decomposition of Graphs 2
This week we continue to study graph decomposition algorithms, but now for directed graphs.
4 horas para completar
4 videos (Total 36 minutos), 1 lectura, 1 cuestionario
4 videos
Topological Sort9m
Strongly Connected Components7m
Computing Strongly Connected Components10m
1 lectura
Slides and External References10m
4 horas para completar
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 horas para completar
8 videos (Total 55 minutos), 1 lectura, 1 cuestionario
8 videos
Breadth-First Search7m
Breadth-First Search (continued)6m
Implementation and Analysis9m
Proof of Correctness7m
Proof of Correctness (continued)5m
Shortest-Path Tree6m
Reconstructing the Shortest Path3m
1 lectura
Slides and External References10m
5 horas para completar
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 horas para completar
12 videos (Total 86 minutos), 2 lecturas, 1 cuestionario
12 videos
Naive Algorithm10m
Dijkstra's Algorithm: Intuition and Example7m
Dijkstra's Algorithm: Implementation3m
Dijkstra's Algorithm: Proof of Correctness4m
Dijkstra's Algorithm: Running Time7m
Currency Exchange6m
Currency Exchange: Reduction to Shortest Paths8m
Bellman-Ford Algorithm6m
Bellman-Ford Algorithm: Proof of Correctness6m
Negative Cycles7m
Infinite Arbitrage10m
2 lecturas
Slides and External References10m
Slides and External References10m
Revisiones
Principales revisiones sobre ALGORITHMS ON GRAPHS
por CSJun 30, 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.
por CCOct 6, 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.
por MMMar 28, 2020
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!
por CMMar 6, 2017
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).
por SKApr 23, 2018
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.
por GSDec 2, 2019
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.
por DPNov 7, 2019
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!
por ZHJan 5, 2017
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.
ofrecido por
Universidad de California en San Diego
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
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.
Acerca de Programa especializado Estructuras de datos y algoritmos
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.
Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.
¿Qué recibiré si me suscribo a este Programa especializado?
Cuando te inscribes en un curso, obtienes acceso a todos los cursos que forman parte del Programa especializado y te darán un Certificado cuando completes el trabajo. Se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes auditar el curso sin costo.
¿Cuál es la política de reembolsos?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.