Chevron Left
Retour à Algorithms on Graphs

Avis et commentaires pour d'étudiants pour Algorithms on Graphs par Université de Californie à San Diego

4.7
étoiles
1,681 évaluations
273 avis

À propos du cours

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

Meilleurs avis

CS

Jul 01, 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

Oct 07, 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.

Filtrer par :

101 - 125 sur 264 Avis pour Algorithms on Graphs

par Sihua D

Sep 18, 2016

Great Course. Compact and clear. Learnt a great deal from it. Thanks!

par Rahul G

Jun 26, 2020

Highly recommended for anybody who wants to brush up his graph skills.

par Akash K B

Jun 24, 2020

the course is good with small videos and not being a language specific

par PRABAL B D

Jan 20, 2020

Perfect Course to develop you understanding and coding skills in graph

par Kaustubh J

Jun 10, 2019

Excellent course, definitely in my top 5 courses to take in coursera

par Bardaan A

Jan 02, 2017

Incredible collection of graph algorithms. Thoroughly enjoyed it.

par Mandava D

Dec 26, 2017

This is one of the best courses to start with Graph Algorithms.

par Pablo E M M

Mar 01, 2018

Great! course. I lerned many things about graph and algorithm

par Shihab S

Jun 22, 2020

It was helpfull for learning Graphs. Totally understandable.

par Bjornn B O F F

Sep 12, 2017

All you always wanted to know about graphs are here. Awesome

par Devanjan C

Sep 07, 2017

Very lucid and to the point info presented in the lectures.

par VATSAL R

Apr 19, 2020

Really Helped me a lot to brush up my basics on graphs :-)

par Dennis K

May 21, 2018

Amazing class that helped me understand graph algorithms.

par Saurab D

Apr 14, 2018

Excellent materials on graphs. Thanks to the instructors.

par Manikant R

May 30, 2020

Excellent content, gives deep explanations of Algorithms

par Basavasagar K P

Jul 19, 2020

Great course on graphs. The assignments are also great

par Max P Z

Dec 26, 2016

very nice course. The content covered is very useful.

par Christopher W

Apr 11, 2020

Really fantastic course, I learned a lot. Thank you!

par Xi Y

Aug 02, 2016

Why don't you put it in the Data Structures course?

par Virginia R A

Aug 18, 2016

Excellent! I learn some new algorithms on graphs.

par g

Aug 23, 2016

useful and fundamental, interesting assignment

par Sankaranarayanan G

Jun 10, 2016

Excellent inputs on graph theoretic algorithms

par Shravan M

Jul 13, 2016

Good work ! Every concept is well explained !

par Shubhra A

Jan 24, 2019

One of the best courses I have ever taken !

par Debasish M

Jul 09, 2016

Neat and suitable examples for each topics.