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.
By MANCHALA L•
By Om P•
By Shiv M V•
By Ritik M•
By Prabhu N S•
By Nguyen Q T•
By Alvin R Y•
By Sai C•
By Huimeng Z•
By Chen X•
By Andrea Q•
By Md. R Q S•
By Tushar G•
By 321910301014 g•
By D A•
By 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.
By 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.
By Iliya M•
Week 6 has lots of weaknesses. It's like the instructor wanted to tell as fast as he can the concepts and go on...
- few examples
-lack of using gif or any other visualization or picture for A* tutorials !
- no pseudocode for "contract hierarchy" ...!
However, except week 6, everything was just fine and enough to learn and do assignments. I really appreciate the instructors and my own instructor, Dr. Sauleh Eetemadi who suggested this course for learning algorithms on graphs.
By 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.
By 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.
By Ritik S•
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.
By 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.
By 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.