In graph theory, a path is a sequence of edges and vertices that are all distinct. Directed paths have the added restriction that the edges must be in the same direction. Paths are fundamental concepts of graph theory and are studied in many texts.

This is an introductory course to computer science theory, exploring the design and analysis of various algorithms, number theory, and complexity. The prerequisites include familiarity with mathematical induction, big-O notation, basic data structures, and programming in a standard language.