Marco Nissen

Learn More
EEciency, exibility, and ease of use are desirable goals in library development, but it seems next to impossible to achieve all three goals simultaneously. The Library of Ecient Algorithms and Data Structures (LEDA) focuses on eeciency and ease of use 4]. On the other hand, in 1, 2, 3], concepts were developed which focus on eeciency and exibility. In the(More)
EEciency, exibility, and ease of use are desirable goals in library design. However, these goals seem to contradict each other. The Library of Ecient Algorithms and Data Structures (LEDA) focuses on eeciency and ease of use. On the other hand, we have developed concepts for the implementation of algorithms which focus on eeciency and exibility. In this(More)
Data Accessor intends to enhance reusability and flexibility of algorithms 2 that need to access data. If an algorithm uses a standardized intermediate data structure it is possible to reuse it for other ways of accessing data only by adapting the Data Accessor. The algorithm remains the same. This pattern abstracts data access as the iterator pattern(More)
Provide data abstraction to enhance reusability. Data Accessor intends to enhance reusability and flexibility of algorithms 2 that need to access data. If an algorithm uses a standardized intermediate data structure it is possible to reuse it for other ways of accessing data only by adapting the Data Accessor. The algorithm remains the same. This pattern(More)
I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software is an important and difficult problem in general, and this is particularly true for graph algorithms. The scientific(More)
  • 1