In the lectures on graphs, the definition of a graph is given and some elementary graph algorithms (breadth-first search, depth-first search, testing bipartitness, (strong) connectivity, cycle detection, topological ordering) are discussed and analyzed.

Back to top