Graph Theory Algorithms

Graph Theory Algorithms

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 traveling salesman problem with dynamic programming.

A complete overview of graph theory algorithms in computer science and mathematics.

Url: View Details

What you will learn

• Storage and representation of graphs (networks) on a computer
• Common graph theory problems
• Breadth first search algorithm

Rating: 4.61458

Level: All Levels

Duration: 9 hours

Instructor: William Fiset