100% OFF/DEAL, IT & SOFTWARE, PAID NOW FREE/UDEMY PROMO CODE

Graph Theory Algorithms

29 Jun , 2018  

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 is the target audience?
  • Anybody ready for a deep dive into graph theory!
 
 

Best Related Posts

,


 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Best In Android Development