Graph Algorithms = Iteration + Data Structures? : The Structure of Graph Algorithms and a Corresponding Style of Programming

Erwig, Martin GND

We encourage a specific view of graph algorithms, which can be paraphrased by "iterate over the graph elements in specific order and perform computations in each step". Data structures will be used to define the processing order, and we will introduce recursive mapping / array definitions as a vehicle for specifying the desired computations. Being concerned with the problem of implementing graph algorithms, we outline the extension of a functional programming language by graph types and operations. In particular, we explicate an exploration operator that essentially embodies the proposed view of algorithms. Fortunately, the resulting specifications of algorithms, in addition to being compact and declarative, are expected to have an almost as efficient implementation as their imperative counterparts.

Vorschau

Zitieren

Zitierform:

Erwig, Martin: Graph Algorithms = Iteration + Data Structures?. The Structure of Graph Algorithms and a Corresponding Style of Programming. Hagen 1992. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe