Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms

Kühl, Dietmar; Weihe, Karsten

Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms

Dateien

preprint_001.pdfGröße: 287.4 KBDownloads: 172

Datum

1996

Autor:innen

Kühl, Dietmar

Weihe, Karsten

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Preprint

Publikationsstatus

Published

Zusammenfassung

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.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

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

BibTex

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

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5954">
    <dc:format>application/pdf</dc:format>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>1996</dcterms:issued>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Kühl, Dietmar</dc:contributor>
    <dc:contributor>Weihe, Karsten</dc:contributor>
    <dc:creator>Kühl, Dietmar</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5954"/>
    <dcterms:title>Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms</dcterms:title>
    <dcterms:abstract xml:lang="eng">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.&lt;br /&gt;&lt;br /&gt;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.&lt;br /&gt;&lt;br /&gt;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.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5954/1/preprint_001.pdf"/>
    <dc:creator>Weihe, Karsten</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:20Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5954/1/preprint_001.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:20Z</dc:date>
    <dc:language>eng</dc:language>
  </rdf:Description>
</rdf:RDF>