Iterators and Handles for Nodes and Edges in Graphs

Cite This

Files in this item

Checksum: MD5:3539131b4d378dc347c20a32251e8ee6

KÜHL, Dietmar, Karsten WEIHE, 1996. Iterators and Handles for Nodes and Edges in Graphs

@unpublished{Kuhl1996Itera-6347, title={Iterators and Handles for Nodes and Edges in Graphs}, year={1996}, author={Kühl, Dietmar and Weihe, Karsten} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Kühl, Dietmar</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:rights>terms-of-use</dc:rights> <dcterms:title>Iterators and Handles for Nodes and Edges in Graphs</dcterms:title> <dc:contributor>Weihe, Karsten</dc:contributor> <dcterms:rights rdf:resource=""/> <dc:contributor>Kühl, Dietmar</dc:contributor> <dspace:hasBitstream rdf:resource=""/> <bibo:uri rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Weihe, Karsten</dc:creator> <dc:date rdf:datatype="">2011-03-24T16:11:38Z</dc:date> <dc:language>eng</dc:language> <dcterms:hasPart rdf:resource=""/> <dc:format>application/pdf</dc:format> <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> <dcterms:issued>1996</dcterms:issued> <dcterms:available rdf:datatype="">2011-03-24T16:11:38Z</dcterms:available> <dcterms:isPartOf rdf:resource=""/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

preprint_015.pdf 268

This item appears in the following Collection(s)

Search KOPS


My Account