CS6204 - Combinatorials and Graph Algorithms
School of Computing, National University of Singapore
(Semester 1 (Fall) 2000)

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

  • Some information about LEDA in SoC -- MUST READ!
  • My lecture file on LEDA Introduction
  • Some LEDA Examples
  • Please read note on Support for LEDA

    • LEDA Assignments

    1. LEDA Programming Assignment 1 (Due: 22 August 2000)

    2. The LEDA Implementation Challenge (Due: 10 October 2000)

    CS6204 Projects Page
    CS6204 Home Page