Graph Theory Algorithms by Udemy
A complete overview of graph theory algorithms in computer science and mathematics.
Course Highlights
- Storage and representation of graphs (networks) on a computer
- Common graph theory problems
- Breadth first search algorithm
- Depth first search algorithm
- Various tree algorithms including: the height or a tree, finding the center of a tree, rooting a tree, and etc...
- Dijkstra's algorithm
- Topological sort algorithm
- Shortest/longest path on a acyclic graph
- Bellman Ford's algorithm
- Floyd-Warshall all pairs shortest path algorithm
- Finding bridges/articulation points
- Finding strongly connected components (Tarjan's)
- Travelling salesman problem (TSP)
- How to find the maximum flow of a flow graph
- Finding bipartite graph matchings
- Various network flow algorithms including: Edmonds-Karp, Capacity Scaling, and Dinic's algorithm
- Kruskal's Minimum Spanning Tree algorithm
- The Lowest Common Ancestor (LCA) Problem
Skills you will learn!
Curriculum
7 Topics
Graph Theory Introduction
Graph Theory Introduction Quiz
Problems in Graph Theory
Depth First Search algorithm
Breadth First Search algorithm
Breadth First Search grid shortest path
DFS & BFS quiz
7 Topics
Introduction to Trees
Beginner tree algorithms
Rooting a tree
Finding tree center(s)
Identifying Isomorphic Trees
Identifying Isomorphic Trees Source Code
Tree quiz
19 Topics
Topological sort algorithm
Classic graph theory algorithms quiz #1
Shortest/longest path on a Directed Acyclic Graph (DAG)
Dijkstra's shortest path algorithm
Dijkstra's shortest path algorithm | source code
Bellman-Ford algorithm
Floyd-Warshall all pairs shortest path algorithm
Floyd-Warshall all pairs shortest path algorithm | source code
Classic graph theory algorithms quiz #2
Bridges & Articulation points
Bridges & Articulation points | source code
Tarjan's strongly connected components algorithm (UPDATED)
Tarjan's strongly connected components algorithm | source code
Travelling Salesman problem
Travelling Salesman problem | source code
Existence of Eulerian path and circuits
Eulerian path algorithm
Eulerian path source code
Classic graph theory algorithms quiz #3
12 Topics
Max Flow Ford Fulkerson | Network Flow
Max Flow Ford Fulkerson | source code
Unweighted bipartite matching | Network flow
Bipartite Matching | The mice and owls problem | Network Flow
Bipartite Matching | The elementary math problem | Network Flow
Network flow quiz #1
Edmonds Karp | Network Flow
Edmonds Karp | Network Flow | Source Code
Capacity Scaling | Network Flow
Capacity Scaling | Network Flow | Source Code
Dinic's Algorithm | Network Flow
Dinic's Algorithm | Network Flow | Source Code
9 Topics
Union Find data structure
Kruskal's Minimum Spanning Tree Algorithm
Prim's Minimum Spanning Tree (lazy version)
Prim's Minimum Spanning Tree (eager version)
Prim's Minimum Spanning Tree source code
The sparse table data structure
Sparse Table Source Code
Lowest Common Ancestor (LCA) problem
Bonus topics quiz #1
Graph Theory Algorithms
Related Algorithms Courses
Thank You!
Your review has been submitted successfully.