At the start of this course the student should have acquired the following competences:
an active knowledge of
a passive knowledge of
specific prerequisites for this course
This course discusses some fundamental graph algorithms and their corresponding data structures. A lot of emphasis is put on the correctness and the time/memory complexity of the various algorithms and data structures discussed throughout the course. Some basic knowledge of a number of classical data structures is required (e.g., linked list, queue, stack, binary trees) . Additionally, some prior knowledge on the complexity theory of algorithms is a plus (e.g., big-O notation).