Graph Theory Algorithms

by courseunity
Graph Theory Algorithms

Publisher : William Fiset
Course Length : 6.5 hour
Course Price : $00
Course Language English


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.

You may also like

Leave a Comment

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More