Lecture 29 DFS, longest path, topological sort, and strongly connected component

Today, we talked about DFS and its applications on solving topological sort, longest path in a graph, and deciding whether a directed graph is strongly connected.