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

Feedback Form OCW Website TU Delft

Help us improve the OCW website of TU Delft by answering a few short questions.
Filling out this survey will take approximately 5 minutes.

 

To the survey