Graph Theory Algorithms
A complete overview of graph theory algorithms in computer science and mathematics.
4.58 (1964 reviews)
41,792
students
9 hours
content
Jul 2020
last update
$99.99
regular price
What you will learn
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
Screenshots
Related Topics
1759194
udemy ID
6/21/2018
course created date
7/1/2019
course indexed date
Bot
course submited by