Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms.pdf

Universit at Konstanz Using Design Patterns for Reusable Ecient Implementations of Graph Algorithms Working Pap er Dietmar Kuhl Karsten Weihe Konstanzer Schriften in Mathematik und Informatik Nr Januar ISSN c Fakultat f ur Mathematik und Informatik Universit at Konstanz Postfach D Konstanz Germany Email preprintsinformatikunikonstanzde WWW httpwwwinformatikunikonstanzdeSchriften Using Design Patterns for Reusable Ecient Implementations of Graph Algorithms Working Pap er Dietmar Kuhl 1 Karsten Weihe 1 Lehrstuhl f ur praktische Informatik I Algorithmen und Datenstrukturen Universitat Konstanz Fakultat f ur Mathematik und Informatik Abstract software which contradict each other to some ex tent Software reusability is an imp ortant and dicult On the one hand runtime eciency is cru problem in general and this is in particular true cial in many situations This means the time for graph algorithms The usual way to address needed for execution and typically less imp or reusability of graph algorithms is to provide a tant