Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms

Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms (1996)

by Dietmar Kühl , Karsten Weihe

Citations:

1 - 1 self

User correction supplied by mph

Datum	Value	Source
TITLE	Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms	user correction - Legacy Corrections
AUTHOR NAME	Dietmar Kühl	user correction
AUTHOR AFFIL	Universität Konstanz	user correction
AUTHOR ADDR	Postfach 5560/D 188, 78434 Konstanz, Germany	user correction
AUTHOR NAME	Karsten Weihe	user correction
AUTHOR AFFIL	Universität Konstanz	user correction
AUTHOR ADDR	Postfach 5560/D 188, 78434 Konstanz, Germany	user correction
ABSTRACT	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. 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. 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. We are currently implementing a case study (maximum flow problem) in C++ to evaluate our ideas empirically.	user correction
YEAR	1996	INFERENCE
CITATIONS	14 found	ParsCit 1.0