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.
автор: Lee Z Y•
Great material! The 6th week is tough though (I think that was the first time in the course they grade your solution with real world datasets - graphs that goes by millions of nodes) - I only managed to finish bidirectional Dijkstra before bailing out (for the record up until now I had finished every single programming assignment before this). I won't say it's a bad thing, cause I cruise through week 1-5, so having week 6 is rather humbling.
Fantastic course! I am new on graph algorithms and this course totally mesmerized me. The course material is just right for me , neither too difficult nor too easy. And the programming task is challenging and I like the way the test cases not shown to us because it pushed me to think of strange or rare case on which my program may fail. I really learned a lot from this course! Thanks to the instructors!
автор: Nandan K•
This was one of the more challenging course in the specialization. Learnt a lot about graphs, traversing, running time, shortest paths, minimum spanning trees etc., Most of all the problem statement gradually became challenging and we had to actually model the problem statement to fit the algorithm. Do not leave the course in between because it becomes a lot harder to quickly resume where you left.
автор: Ashish D S•
This is my first course on Coursera. Not only that this is first time I have learned any algorithms course officially. I was little afraid first to directly jump to third course in 6 course package. The instructors are very good and the assignments are superb. I am looking forward to complete the remaining all extra assignments in the course to make maximum utilization of learning.
автор: Gael H•
Great course! Even though I am not a programmer and didn't do the other courses in the specializations, I could still go through this course with only a small amount of personal research on data structures (which are covered in previous courses of the specialization). Assignments are fun and challenging. Strongly recommended for anyone interested in graphs. Thank you guys.
автор: Deepak M•
This course is enough for a beginner to actually understand what a graph is and how to think a problem solving approach for problems with the help of graphs. It not only tells a detailed knowledge about graphs and algorithms but also develop thinking of problems in a graphical way which is very impressive. I am fully satisfied with this course.
автор: Kevin K•
This is an interesting course, which is closely related to the graph theory in mathematics. As the previous courses, programming assignments are given every week but it is slightly harder than before. Some pseudo codes are not that easy to convert into the programming language. Yet, it is one of the excellent courses in Coursera.
автор: Kamran M•
Very useful and thorough course for computer scientists and serious software engineers. The assignments are excellent requiring deep understanding of the subject matter. The instructors are very competent and their approach in mathematical proofing of the underlying algorithms is perhaps what sets this course apart from others.
автор: Abhishek M•
It was one of the best course. The problems in the programming weekly assignments were very carefully designed. All the mentors were really amazing and having in-depth knowledge in algorithms. I thoroughly enjoyed the course and I feel I am much more comfortable tacking graph problems and solving them efficiently. Thank you!
автор: Matt H•
Outstanding. I highly recommend paying for this course instead of auditing it, so you have access to the graded homework assignments. The problems are ingenious, and so much fun I wish I could do them again. Without doing the assignments, I wouldn't have learned as much as I did. It's well worth the money.
автор: Rashim N T•
This course is very informative and gives an amazing experience learning about graphs and their uses.
It covers alot of topics like BFS, DFS, Djikstra, Prim, Kruskal, astar which are VERY IMPORTANT to understand for any CS student.
I am highly grateful to the teachers for making such a wonderful course.
автор: Jenna W•
Fun course, well done. Overall I felt the class materials were very handled in this course. Further, it was tightly focused on a related set of algorithms where knowledge of each built on preceding knowledge well. Everything I need from a distance/on-line course and presented well.
автор: Wendell H•
Great content, great problem sets.
Minor issue. sometimes transcript at the bottom of video were incorrect or says [INAUDIBLE]
Link for Week 5 instructions were missing from Instructions page, and students need to hunt for it from the forums where other students posted the link.
автор: H.M F R•
Good course with clear explanation on core concept. The pseudo code can be easily translated to language of choice. The proof of the algorithm help build core understanding of graph theory and can be used to create custom algorithms for different industrial implementation.
автор: Shubham B•
The lectures and materials were very good. This sets a concrete foundation to Graph Algorithms though it might be a bit steep for a complete starter. But the course is highly recommended. The assignments are amazing and helps to build confidence in building graph problems.
автор: Muhammad Y•
All the concepts and ideas in the course were explained very clearly and briefly. Furthermore, the proofs were less mathematical and explained very intuitively. So overall its a nice course to take both for newbies and also for ones looking for refresher of the concepts.
автор: Tamilarasu S•
Very good course. Starts with gentle introduction to graphs followed by various traversal schemes.
Shortest path problems and minimum spanning tree problems are covered in great detail.
Advanced graph algorithms such as A* are also covered.
Very well organized course.
автор: Joseph T•
This course was a lot of fun. The word load is spot on. My strategy was to start from the assignment then go back to the videos and notes for tips and clues. This allowed me to do easy assignments fast and then not spend unnecessary time on harder assignments.
автор: Basma A•
This Course is delivering an extensive amount of information that will boost your problem-solving skills as a developer. It enabled me to solve many problems on platforms like leetcode.
yet it is delivering that content in a simple and clear way to understand.
автор: Jeff G•
This class got me a job! Job interview asked me a bunch of graph problems and after just taking this course I was more than ready to answer. I was the "top candidate" they had ever seen so they say (I have my doubts). Worth the time and money.
Brilliant course material. Sometimes the formal proofs can get boring, but that's the maths part of it for you! Programming assignments are super important to do honestly if you want to glean every bit of information from this course.
автор: Charles S•
For me this was a refresher. And it was an excellent way to explain and work on graphing algorithms. The step-by-step explanations of the algorithms here are great for truly understanding what's going on under the hood, so to speak.
автор: Stefan V•
Great course, loved it! Maybe a bit easier than the previous ones in this specialization, or maybe it's just because I started using python(compared to java and c in previous courses). Anyways the course was fun. :)
автор: Rishab A•
The way the prof. teaches is really amazing . I got all whatever he said and i really enjoyed the course.
Thanks to Coursera team for putting up this course for begginers like me and special thanks to the Professor .
автор: Andrii S•
Lectures and their slides are terse but very to the point, and structured well. Assignments are amazingly interesting and challenging, especially optional ones for the last week - highly recommend doing them.