CS5234 - Combinatorial and Graph Algorithms
School of Computing, National University of Singapore
(Fall 2007)
LEDA Programming Assignments
About LEDA Assignments...
An important part of the study of advanced algorithms and data
structures is in applying them to real applications.
Therefore, one important component of this course will be
on the effective use of advanced data structures in real applications.
Programming assignments in this course will be done in LEDA,
a Library of Efficient Data Structures and Algorithms, developed
by Naher and Mehlhorn of the
Max-Planck-Institut fur Informatik, Germany.
LEDA is done in C++ and includes a vast library and
multiple implementations of most of the common basic and some
advanced data structures studied in this course. It also includes
library of many of the combinatorial and graph algorithms covered
in the course.
LEDA helps to make it more painless to incorporate advanced data
structures into C++ applications.
Information, Lecture notes, and Examples on LEDA
LEDA Assignments
-
LEDA Assignment 1 (Due: 18 September 2007)
-- Submission details added!
CS5234 Projects Page
CS5234 Home Page