GraphEd: A Graphical Platform for the Implementation of Graph Algorithms (Extended Abstract and Demo)

Himsolt, Michael (1995) GraphEd: A Graphical Platform for the Implementation of Graph Algorithms (Extended Abstract and Demo). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 182-193 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_370).

Full text not available from this repository.

Abstract

GraphEd is an extensible graph editor. Its powerful object oriented user interface supports all operations that are necessary for the convenient construction and manipulation of graphs. Graphs grammars can be used as a macro system to create structured graphs. GraphEd's modular structure and the application interface support the easy integration of algorithm modules which are written in C, or can run external programs. The user may construct graphs interactively, select algorithms from a menu, and view the results of an algorithm directly on screen. Several graph layout algorithms assist the user to tidy graph drawings, and help the programmer to visualize results or debug complex algorithms. Actual applications range from standard graph algorithms over graph drawing algorithms, algorithm animation and combinatorial algorithms to front ends for circuit design systems.

Item Type:Conference Paper
Additional Information:10.1007/3-540-58950-3_370
Classifications:S Software and Systems > S.001 General
ID Code:147

Repository Staff Only: item control page

References

Bordier, J.: Cabri 3.0 Referebce Guide. Laboratoire de Structures Discretes et de Didactique, Universite Joseph Fourier & C.N.R.S., Grenoble (1990)

Brandenburg, F.J.: Nice drawings of graphs are computationally hard. Technical report, Universität Passau (1988)

Brandenburg, F.J., Himsolt, M., Röeder, Skodinis, KL.: Designing dataflow graphs by graph grammars. In Colloquium on Graph Transformatiopn and its Aplication in Computer Scince, Universitat de les Illes Baleares, Departament de Ciences Matamatiques i Informatica (1994)

di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: An annotated bibliography. Technical report, Dept. of Computer Science, Brown Univ. (1993)

Eades, P., Fogg, P. and Kelly, D.: Spremb: a system for developing graph algorithms. Congressus Numerantium, 66 (1988) 123-140

Ehrig, H., Nagl, M. Rosenfeld, A. Rozenberg, G. (editors): Graph-Grammars and Their Application to Computer Science, LNCS 291 (1987)

Fröhlich, M., Werner, M.: The interactive graph visualization system davinci v1.2. Technical report, Universität Bremen (1993)

GraphEd and related documents are available by anonymous ftp from the site ftp.uni-passau.de,/pub/local/graphed.

Himsolt, M.: GraphEd: An interactive tool for developing graph grammars. Graph Grammars and Their Application To Computer Science, LNCS 532 (1980) 61-65

Himsolt, M.: Konzeption und Implementierung von Grapheneditoren. Dissertation, Universität Passau 1993.

Himsolt, M.: A view to graph drawing algorithms through GraphEd. Proceedings of the ALCOM International Workshop on Graph Drawing and Topological Graph Algorithms (1993)

Himsolt, M.: Comparing and evaluation layout algorithms with GraphEd. Manuscript, available via ftp fro, ftp. uni-passau.de (1994)

Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Algorithms. Stanford University (1993)

Design Users Guide Meta Software Corporation, Cambridge, MA (1978)

Näher, S.: LEDA Manual. Max-Planck-Institut für Informatik, Saarbrücken (1993)

Newberry Paulisch, F.: The Design of an Extendible Graph Editor, LNCS 704 (1993)

Rowe, L.A., Davis, M., Messinger, E., Meyer, C., Spirakis, C., and Tuan, A.: A browser for directed graphs. Software Practice and Experience, 17(1) (1987) 61-76

Schürr, A.: Progres: A vhl-language based on graph grammars. Graph Grammars and Their Application to Computer Science, LNCS 532 (1990) 641-659

Tamassia, R., di Battista, G., Batini, C.: Automatic graph drawing and readability of diagranms. IEEE Transactions on Systems, Man and Cybernetics 18(1) (1988) 61-79