CS4234/CS5234 - Combinatorial and Graph Algorithms
School of Computing, National University of Singapore
(Fall Semester 2001)
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 für 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 Programming Assignment 1 (Due: 19 September 2001)
-
The LEDA Implementation Challenge
(Out: 4th Oct; Due: 2nd Nov 2001)
- Best Solutions --
||
Current Class
||
Last Year's Class |
- TTP Challenge:
At the close of the TTP Challenge on Friday, 9-Nov,
the run-away champion was Zhu Wen-bin whose
Simulated Annealing algorithm scored an
impressive 45 out of 46 best results!!! The second
and third best are Tan Jing-Song (16) and Liu Ming (15),
respectively. Congratulations to all for a good job done.
CS4234 Projects Page
CS4234 Home Page