## Graph Drawing Algorithm Engineering with AGD (2000)

### Cached

### Download Links

- [www.ads.tuwien.ac.at]
- [ftp.zpr.uni-koeln.de]
- DBLP

### Other Repositories/Bibliography

Citations: | 3 - 2 self |

### BibTeX

@MISC{Gutwenger00graphdrawing,

author = {Carsten Gutwenger and Michael Jünger and Gunnar W. Klau and Sebastian Leipert and Petra Mutzel},

title = {Graph Drawing Algorithm Engineering with AGD},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

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.