Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
  Lokale TagsFreigabegeschichteDetailsÜbersicht

Freigegeben
Konferenzbeitrag

A Software Library of Dynamic Graph Algorithms

MPG-Autoren
/persons/resource/persons43990

Alberts,  David
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45787

Zaroliagis,  Christos
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PuRe verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Alberts, D., Cattaneo, G., Italiano, G., Nanni, U., & Zaroliagis, C. (1998). A Software Library of Dynamic Graph Algorithms. In R. Battiti, & A. Bertosi (Eds.), Proceedings of Workshop on Algorithms and Experiments (ALEX-98) (pp. 129-136). Trento, Italy: University of Trento.


Zitierlink: https://hdl.handle.net/11858/00-001M-0000-000F-3767-7
Zusammenfassung
We report on a software library of dynamic graph algorithms. It was written in \CC as an extension of LEDA, the library of efficient data types and algorithms. It contains implementations of simple data structures as well as of sophisticated data structures for dynamic connectivity, dynamic minimum spanning trees, dynamic single source shortest paths, and dynamic transitive closure. All data structures are implemented by classes derived from a common base class, thus they have a common interface. Additionally, the base class is in charge of keeping all dynamic data structures working on the same graph consistent. It is possible to change the structure of a graph by a procedure which is not aware of the dynamic data structures initialized for this graph. The library is easily extendible.