Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:5b9aaa18863dba08b8474b88d7987f57

KÜHL, Dietmar, Karsten WEIHE, 1996. Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms

@unpublished{Kuhl1996Using-5954, title={Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms}, year={1996}, author={Kühl, Dietmar and Weihe, Karsten} }

eng Weihe, Karsten 2011-03-24T16:08:20Z 2011-03-24T16:08:20Z deposit-license Kühl, Dietmar Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms 1996 application/pdf Kühl, Dietmar Weihe, Karsten Software reusability is an important and difficult problem in general, and this is in particular true for graph algorithms. The usual way to address reusability of graph algorithms is to provide a standard-setting library of data structures (incl. various kinds of graphs), on which graph algorithms may be implemented.<br /><br />In this working paper, we discuss the disadvantages to this approach, and we propose a couple of domain design patterns to overcome these disadvantages. To apply design patterns, we shift the focus from data structures as the primary units of reuse to algorithms themselves.<br /><br />So far, our concept is highly immature, and so is this paper. In fact, this paper merely reflects the state of our discussion and is intended to serve as a base for further dicussions.

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

preprint_001.pdf 60

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto