This lecture examines directed graphs, or digraphs, and their walks, cycles, and connectivity. Next, we look at Directed Acyclic Graphs (DAGs), digraphs with no cycles.

Source: Erik Demaine, Mathematics for Computer Science (MIT: OpenCourseWare). Licensed under CC BY-NC-SA 4.0.