Efficiency, flexibility, and ease of use are desirable goals in library design. However, these goals seem to contradict each other. The Library of Efficient Algorithms and Data Structures (LEDA) focuses on efficiency and ease of use. On the other hand, we have developed concepts for the implementation of algorithms which focus on efficiency and flexibility. In this paper, we present a possible combination of these concepts with LEDA, and we report computational results which estimate the resulting run-time overhead. 1. Introduction This paper systematically summarizes the technical project reports [8, 9, 17] and is in addition based on [10, 20]. All implementations in this project were done in C++ (see http://www.informatik. uni-konstanz.de/Research/projects algo.html#projekt5). Many libraries offer efficient data structures and algorithms for various algorithmic problem domains. However, an implementation of an algorithm in a library need not fit seamlessly into every application. H...