Course Information
Registration period
Year-round Recruitment
Course Level
Study Mode
Duration
2 Hour(s) 35 Minute(s)
Language
English
Taught by
Kasun Liyanage
Rating
1 views
Course Overview
Lets implement graph theory related algorithms with C++
Graph theory hold corner stone of modern computer science, extending its tentacles to social networks to neural networks to finding paths in maps. In this course we are looking at graph theory by computer science prospective. We are going to start our discussion by looking at the basic terms of graph theory and them jump on to discuss graph theory related algorithms and then implement those with c++. Following are the types of algorithms we are going to discuss in this course.
1. Graph traversing.
2. Topological sorting and strongly connected component associated algorithms
3. Shortest paths.
4. Finding minimum spanning trees.
5. Maximum flow.
6. NP complete algorithms such as graph coloring, traveling salesman problem etc.
Course Content
- 6 section(s)
- 31 lecture(s)
- Section 1 Introduction to graph theory
- Section 2 Graph representation
- Section 3 Graph traversing algorithms
- Section 4 Shortest path in a graph
- Section 5 Minimum spanning tree problem
- Section 6 Flow networks
What You’ll Learn
- Thorough understanding about graph algorithms and how to use them in practice
Reviews
-
KKiran Shettigar
Application of algorithms by solving other problems should have been covered. Flow networks section is missing videos.
-
EEric Burns
Great course so far, but sometimes the instructors accent is difficult to understand so it takes going back and listening 2-3 times to fully understand.
-
EEnliven Media
Sound quality was a bit off, but could understand everything just fine. Plus reading along with the audio was also easy and useful.
-
RRakesh R
Incomplete course. Very surface level course.
