This technology-agnostic course will teach you about many classical graph algorithms essential for a well-rounded software engineer. 

You will begin with an introduction to the running-time analysis of algorithms and the representation and structure of graphs. You’ll cover the depth-first search algorithm and its many applications, like detecting cycles, topological sorting, and identifying cut-vertices and strongly connected components. You will then cover algorithms for finding shortest paths and minimum spanning trees. You’ll also learn about the Ford-Fulkerson algorithm and its use in finding a maximum flow and minimum cut in networks. Moreover, you will adapt it to find maximum matchings and minimum vertex covers in bipartite graphs. Finally, you will learn about the Gale-Shapley algorithm for finding stable matchings.

The material in this course serves as a basis for other advanced algorithms, like parallel and distributed algorithms, and has many diverse applications in other computing disciplines.

Mastering Graph Algorithms

Edges in graphs are much simpler to classify than edges in digraphs. Primarily because, unlike an edge in a digraph, each edge $(u,v)$ of a graph can be explored in either direction, from $u$ to $v$, or from $v$ to $u$. 

Each edge of a graph is classified as a tree-edge or a back-edge, depending on how depth-first search traverses the graph. 



Learn how to classify edges in a graph using depth-first search. 

Edge Classification in Undirected Graphs

Learn how to classify edges in a graph using depth-first search.

Introduction

Review: Asymptotic Notation and Math Prerequisites

Working with Graphs

Depth-First Search and Applications

Prelude: Shortest Paths

Single-source Shortest Paths in Weighted Digraphs

All Pairs Shortest Paths

Minimum Spanning Tree

Flows

Matchings and Vertex Covers

Conclusion

Edge Classification in Undirected Graphs