Udemy : Graph Theory Algorithms

• Storage and representation of graphs (networks) on a computer
• Breadth first search algorithm
• Dijkstra’s algorithm
• Floyd-Warshall all pairs shortest path algorithm
• Finding strongly connected components (Tarjan’s)
• Common graph theory problems
• Depth first search algorithm

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.

Click to Take Udemy Course : Graph Theory Algorithms