Graph Iterators: Decoupling Graph Structures from Algorithms

Nissen, Marco

Lokale TagsFreigabegeschichteDetailsÜbersicht

Graph Iterators: Decoupling Graph Structures from Algorithms

Nissen, M. (1998). Graph Iterators: Decoupling Graph Structures from Algorithms. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Freigegeben

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:

Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-37A1-5 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-A75D-3

Genre: Hochschulschrift

ausblenden:

Urheber:
Nissen, Marco¹, Autor

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Inhalt

einblenden:

ausblenden:

Schlagwörter: -

Zusammenfassung: I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software is an important and difficult problem in general, and this is particularly true for graph algorithms. The scientific literature demonstrates plenty of applications of graph algorithms as subroutines for other algorithms. Moreover, many practical problems from various domains may be modeled as graph problems and hence solved by means of graph algorithms. Chapter 2 introduces some data structures that will be used in 5 basic graph algorithms in chapter 3. Chapter 4 discusses an implementation of a maximum cardinality matching algorithm for general graphs. Chapter 5 explains some techniques in C++, which are useful to implement the data structures and algorithms in an efficient way. Finally chapter 6 contains some concluding remarks.