Highest Rated

Graph Theory Algorithms

FREE
Udemy

Note: Udemy FREE coupon codes are valid for maximum 1000 redemption only and might get redeemed in few hours. Look for "GET THIS DEAL" green button at the end of Description.
This post may have affiliate link & we may get small commission if you make a purchase.

Graph Theory Algorithms

Requirements
  • Exposure to computer science fundamentals (e.g: data structures, recursion, data types, classes, OOP)
  • Some prior programming knowledge.
Description

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.

Who this course is for:
  • Anybody ready for a deep dive into graph theory!


  • Register New Account
    Reset Password