Publikation: Iterators and Handles for Nodes and Edges in Graphs
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
In the CGAL startup meeting in Zürich, September 1996, it has turned out that iterators on highly structured container types is a key design issue. This document is intended to serve as an additional basis for further discussions about this topic. We focus on graph data structures, and we propose a taxonomy of iterators and related types in C++. Moreover, we introduce templates that make defining such classes for a given graph data structure easy. The concept presented here might offer high flexibility and efficiency. However, for a real library, a good compromise must be found between these desirable goals and ease of use (and ease of learning!). Therefore, our point of view is by no means puristic. For example, in another document, which is in preparation and soon available, we developed a proposal for an integration into the LEDA library, which tries to find a good compromise between LEDA's ease-of-use style and our own concept. Anyway, we think that our concept is a good point to start from, not only in graph algorithmics, but also in computational geometry.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
KÜHL, Dietmar, Karsten WEIHE, 1996. Iterators and Handles for Nodes and Edges in GraphsBibTex
@unpublished{Kuhl1996Itera-6347, year={1996}, title={Iterators and Handles for Nodes and Edges in Graphs}, 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/6347"> <dc:format>application/pdf</dc:format> <dc:rights>terms-of-use</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:creator>Weihe, Karsten</dc:creator> <dc:contributor>Kühl, Dietmar</dc:contributor> <dcterms:issued>1996</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6347/1/preprint_015.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6347"/> <dcterms:abstract xml:lang="eng">In the CGAL startup meeting in Zürich, September 1996, it has turned out that iterators on highly structured container types is a key design issue. This document is intended to serve as an additional basis for further discussions about this topic. We focus on graph data structures, and we propose a taxonomy of iterators and related types in C++. Moreover, we introduce templates that make defining such classes for a given graph data structure easy. The concept presented here might offer high flexibility and efficiency. However, for a real library, a good compromise must be found between these desirable goals and ease of use (and ease of learning!). Therefore, our point of view is by no means puristic. For example, in another document, which is in preparation and soon available, we developed a proposal for an integration into the LEDA library, which tries to find a good compromise between LEDA's ease-of-use style and our own concept. Anyway, we think that our concept is a good point to start from, not only in graph algorithmics, but also in computational geometry.</dcterms:abstract> <dc:creator>Kühl, Dietmar</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:38Z</dc:date> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6347/1/preprint_015.pdf"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:38Z</dcterms:available> <dcterms:title>Iterators and Handles for Nodes and Edges in Graphs</dcterms:title> <dc:contributor>Weihe, Karsten</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>