We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph drawing. AGD represents algorithms as classes that provide one or more methods for calling the algorithm. There is a common base class, also called the type of an algorithm, for algorithms providing basically the same functionality. This enables us to exchange components and experiment with various algorithms and implementations of the same type. We give examples for algorithm engineering with AGD for drawing general non-hierarchical graphs and hierarchical graphs.
CITATION STYLE
Gutwenger, C., Jünger, M., Klau, G. W., Leipert, S., & Mutzel, P. (2002). Graph drawing algorithm engineering with AGD. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2269, pp. 307–323). Springer Verlag. https://doi.org/10.1007/3-540-45875-1_24
Mendeley helps you to discover research relevant for your work.