GD-Workbench: A system for prototyping and testing graph drawing algorithms
We present a tool for quick prototyping and testing graph drawing algorithms. The user interacts with the system through a diagrammatic interface. Algorithms are visually displayed as directed paths in a graph. The user can specify an algorithm by suitably combining the edges of a path. The implementation exploits the powerful functionalities of Diagram Server and has been experimented both as a research support tool and as a back-end of an industrial application.
- 2.G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of three graph drawing algorithms. In Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995.Google Scholar
- 3.G. Di Battista, G. Liotta, and F. Vargiu. Diagram Server. J. Visual Languages and Computing (special issue on Graph Visualization, I. F. Cruz and P. Eades, editors), 6(3), 1995.Google Scholar
- 5.P. Eades, I. Fogg, and D. Kelly. SPREMB: a system for developing graph algorithms. Congressus Numerantium, 66:123–140, 1988.Google Scholar
- 6.M. Himsolt. GraphEd: A graphical platform for the implementation of graph algorithms. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 182–193. Springer-Verlag, 1995.Google Scholar
- 7.F. N. Paulish and W. F. Tichy. EDGE: An extendible graph editor. Softw. — Pract. Exp., 20(S1):63–88, 1990.Google Scholar