Table of Contents
The author of this tutorial holds programming courses many a time. He starts each of these courses with the sentence “I don't like long prefaces, therefore we start right now”. In this tutorial, he would like to proceed the same way, however, some fore-words seem advisable to him that should indeed be written down before the description of ordered sequences, priority queues, graphs and all the other nifty data structures of LEDA.
We therefore start relaxedly with some forewords. The insignificant rest will follow close.