William Fiset
This course provides a complete introduction to Graph Theory algorithms in computer science.
Topics covered in these videos include: how to store and represent graphs on a computer; common graph theory problems seen in the wild; famous graph traversal algorithms (DFS & BFS); Dijkstra’s shortest path algorithm (both the lazy and eager version); what a topological sort is, how to find one, and places it’s used; learning about detecting negative cycles and finding shortest paths with the Bellman–Ford and Floyd–Warshall algorithms; discovering bridges and articulation points in graphs; understanding and detecting strongly connected components with Tarjan’s algorithm, and finally solving the travelling salesman problem with dynamic programming.
Instructor Details
Courses : 2
Specification: Graph Theory Algorithms
|
4 reviews for Graph Theory Algorithms
Add a review
| Price | $11.99 |
|---|---|
| Provider | |
| Duration | 6.5 hours |
| Year | 2019 |
| Level | All |
| Language | English |
| Certificate | Yes |
| Quizzes | No |
Md Irshad –
I took this course to learn about Graph theory. But i have a feeling now that i can master this. Everything explained here in so intuitive way that those who hate it will fall in love with Graph theory.
Nirmal Mehra –
Really good content and in depth explanation of topics. Teaching style is really cool.
Lawrance –
Wow… The Way the instructor teaches is pretty Cool
Dumitru Lucian Boboc –
The course is very well explained and structured