Graph Theory Algorithms

A complete overview of graph theory algorithms in computer science and mathematics.
Instructed by: William Fiset | Subject: IT & Software, Other

Graph Theory Algorithms

About This Course


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.

Take This Course

Course Info

Graph Theory Algorithms Graph Theory Algorithms Reviewed by Acamig Courses on January 15, 2019 Rating: 5
Powered by Blogger.