Algorithms on Graphs
FREE
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. UC San …
Instructor Details
Courses : 8
Specification: Algorithms on Graphs
|
49 reviews for Algorithms on Graphs
Add a review Cancel reply
This site uses Akismet to reduce spam. Learn how your comment data is processed.
Price | Free |
---|---|
Provider | |
Duration | 16 hours |
Year | 2016 |
Level | Intermediate |
Language | English |
Certificate | Yes |
Quizzes | Yes |
FREE
Torgashov N –
Awesome course!
Maksadbek A –
Course instructors did not reply my questions on a discussion forum! I did not have any help from them, they are very passive.
Shubhra A –
One of the best courses I have ever taken !
Muhammad U G –
Most fun course in the series
RUOCHI Z –
thanks for providing the amazing courses
Vedant P –
Exceptionally good course. Basics covered here stand the test of even the toughest hackathons.
Chen X –
Useful
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.
Pengchong L –
The lecture is pretty much scripted from the DPV book…
kumar v –
One of the Best course available on coursera . Make me perfect on algorithm and also improve my thinking skills
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!
Namrata P –
Amazing course
Mahmoud H S –
this course provides the simplist way to explain algorithms, but more exercises may be helpful to improve understanding of topics.
Oleksandr –
The course is good, assessments were challenging. However, I did not like using of USSR map in second week lectures.
Kaustubh K J –
Excellent course, definitely in my top 5 courses to take in coursera
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.
PANKAJ V –
The explanation of lecturer is not good as expected. Overall it is good.
Namrata G –
Loved the explanations and proofs. They are so explicitly told. And the discussion forum for you well assorted problems in assignment is really helpful.
Natraj n c –
Great course! Loved it!
Chitrang S –
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.
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.
Putcha L N R –
Great course for learning or revisiting the concepts of algorithms on graphs. Definitely recommend it.
Tarek S –
programming assignments were too difficult
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.
Rohit K –
Superb course with really good content 🙂
Hidetake T –
this course is necessary to step up.
Robert C –
I learned a LOT.
Abhigyan A –
The videos are very well explained, this is one of the best courses for learning basic algorithms on graphs.
uddeshya p –
its awesome
HM 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.
John S –
Great course introduction to Graphs!
Ankit k –
Nice
Elvis C –
Superb course!
Navid –
First 2 weeks was good. But after week2, OMG. don’t waste your time and money. Its like the instructor is reading from a book. it was such waste of time and money.
Zuhaib U Z –
This was an awesome course on graphs and was perfectly taught by the instructors. I thank instructors for such lucid and clear explanations.
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!
Gurmukh S –
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.
Priyanshu S –
Great Course.!
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.
Manish S –
its awesome
PRABAL B D –
Perfect Course to develop you understanding and coding skills in graph
Tushar J –
Week 5 Instructor’s accent is quite difficult to get, otherwise overall course is good. It’s worth!!!
Dhruv N S –
Awesome course !!
Nikhil C –
my course is still locked .I want to submit solutions for practice and want to get the certificate as soon as possible,but I don’t know why the instructor is not unlocking the course
Yuriy –
Programing assignment were failed without explanation what was wrong.
Yura K –
Not clear what is wrong on programming assignment
Greg G –
An incredibly strong course with a lot of potential if you’re willing to look deeper. It’s well put together as a baseline you will understand basic graph search and pathfinding concepts. (The homeworks are moderately challenging.) Moreover, you can watch some optional videos for additional proofs, and there’s a whole module dedicated to advanced pathfinding algorithms. Take time to make notes, and watch videos again if needed. Sometimes you’ll need to stop and think about what Michael just explained, but fortunately the slides are really good and the proofs are detailed. The extra material really is advanced, it contains pathfinding algorithms that have been developed only in the last few years! Fortunately for that, the assignments are optional because solutions are rather complex and there’s little guidance. But if you’re interested, it may be worth a shot!
Shahnawaz N A –
This course focussed a lot on the crucial graph algorithms in Computer Science and sets a good base to build up on later.
Milos M –
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!