This course provides a complete introduction to Graph theory algorithms in computer science.

What will you learn in this course?

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