# Graph Theory Introduction

A free video tutorial from William Fiset
4.6 instructor rating â€¢ 2 courses â€¢ 106,755 students

Graph Theory Algorithms

A complete overview of graph theory algorithms in computer science and mathematics.

09:02:45 of on-demand video â€¢ Updated July 2020

• Storage and representation of graphs (networks) on a computer
• Common graph theory problems
• 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