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.
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 Md. R Q S•
por Tushar G•
por 321910301014 g•
por D A•
por RICARDO G•
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.
por Archit H•
It was a really comprehensive course on graphing algorithms that are of a lot of use in today's day and age. We don't realize the back-end processing going on while surfing through navigation systems and many other applications.
I extremely enjoyed the course; however, I would appreciate it if the content could be modified so as to facilitate coders of all ages.
Yet in the end, I am truly grateful to the instructors for teaching me such advanced topics with so much proficiency.
por Anup V•
The course was awesome but the "Algorithms on Graphs" course the month after has some ridiculous extras. Since the course hereafter will have additions related to how Graphs are used in the real world today - I have to give this current course 4 stars. I can't comment on the next course but I think talking about how graphs are used in RL is immeasurable. Good Luck. I do hope you give this course a chance if you're interested in Graphs or looking for a refresher like I was.
por Ayush C•
This course introduced me to graphs, and various algorithms on graphs, which are very useful and interesting. It is a great course to understand various graph algorithms. Although the number of questions in programming assignments in this course were lesser than in previous courses of the specialization. Nonetheless, it completely explains various graph algorithms lucidly and teaches how to apply them with interesting questions in assignments.
This a great course for revising algorithms on graph. Assignments are also good for understanding problems better. You can do this course in a day or two . It is that much understandable. Also you can do submission on any programming languages from c++, python, java which is rare on any other course on Coursera. But if you want to learn from scratch then please also refer external reference for algorithms.
por Jungho K•
Lectures were very clear and assignments were really helpful for me to understand gist of each algorithms. This course, however, only covers 1. Basic concepts of Graph, 2. Shortest Path, and 3. Minimum Spanning Tree which doesn’t seem to be rich.
With more diverse and interesting problems associated with Graph included, I strongly believe that students will get much from this course.
por Willem S•
The course contents and assignments are clear and well-structured. Compared to the algorithms & data structures courses, this one was a lot easier (for me anyway). I would have liked additional content on, for instance, (Markovian) grids/fields, but perhaps this will be covered in the 'advanced algorithms' course.
por Aleksandr F•
Great course, would have been better, if authors added more assignments and material to study as graphs have so many applications. Anyways, I do believe that motivated learners will go ahead and find more challenges for themselves. As always, thanks to all the instructors, keep up the good work!
por Sumanth H•
The course is amazing with a good problem-set. If looked at critically , the number of problems can be increased and some of the pseudo code's actual code in some language can be included in the lecture as some implementations are tough to get on our own without any help.
por Anton B•
Very useful course with clear presentation of material. Removing 1 star for lack of recent feedback, even if missing link to programming assignment's problem statement file is reported. One shouldn't have to fish around in forums to find it!
por Dmitri M•
I have finished the specialization. This course is mostly useful though challenging. I wish there were less overly theoretical lectures and more practical examples and assignments instead. Textbooks already have theory.
por Christoph M•
Overall good course, programming tasks are fun!
However, 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 Deep P•
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 Fahmim M S•
This course helps me to a better understanding of Graph Theory. The exercise was a little bit difficult but it can help me to gain more knowledge to solve these problem.
por Huan L•
The content of the course is good and easy to follow. However, I wish the grader's response provided more helpful information (such as conditions of the failed test).
por Zac H•
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.
por Липянин В Г•
Perfect as previous courses of the specialization. Just basic graph algorithms were given. I'm inclined to believe, it was introduction to algorithms on graphs.
por Aakarsh N•
Fairly good course. I wish the edge cases for some of the programming assignments had some more discussions. Needed some sifting through the forums while stuck.
por MAYANK K•
Covers almost all topics, clear all concepts with good explanation and examples. Instructors are fluent and engaging, while assignments are also good.