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

Venue: | Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science |

Citations: | 25 - 4 self |

### BibTeX

@INPROCEEDINGS{Himsolt_graphed:a,

author = {Michael Himsolt},

title = {GraphEd: A Graphical Platform for the Implementation of Graph Algorithms (Extended Abstract and Demo)},

booktitle = {Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science},

year = {},

pages = {182--193},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

and Demo) Michael Himsolt Universitat Passau, 94032 Passau, GERMANY himsolt@fmi.uni-passau.de 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. Graph 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. 1 Introduction...

### Citations

158 |
The Stanford GraphBase: A Platform for Combinatorial Computing
- Knuth
- 1993
(Show Context)
Citation Context ...aph algorithms is a challenge to every programmer. There is a growing number of systems to support this process, which can be roughly divided into two categories. Systems like LEDA [15] and graphbase =-=[13]-=- concentrate on the implementation of a library of graph algorithms. Systems like EDGE [16], DaVinci [7] or GRAB [17] concentrate on graph visualization and editing, and offer only limited support for... |

97 | C.Batini, Automatic graph drawing and readability of diagrams
- Tamassia, Battista
- 1988
(Show Context)
Citation Context ...lem is that most of the criteria upon which the current algorithms are based are NP complete [2], so heuristics are needed. Another problem is that the exact relevance of the criteria is yet unknown. =-=[19]-=- and [12] survey that topic and show some results on ranking layout criteria. GraphEd comes with a set of parametrized layout algorithms which cover a wide range of the algorithms that are described i... |

44 |
PROGRES: A VHL-Language Based on Graph Grammars
- Schürr
- 1991
(Show Context)
Citation Context ...pports 1-eNCE graph grammars. Derivation rules are specified in a graphical form [9], and can be applied interactively. 1-eNCE graph grammars are not as powerful as those used in systems like PROGRES =-=[18]-=-, but they are easier to use and can be implemented more efficiently. For example, [3] shows how to specify data flow graphs by graph grammars, and draw them with a simple layout algorithm. 3 Graphica... |

43 | Demonstration of the Interactive Graph Visualization System da Vinci
- Fröhlich, Werner
- 1995
(Show Context)
Citation Context ...rocess, which can be roughly divided into two categories. Systems like LEDA [15] and graphbase [13] concentrate on the implementation of a library of graph algorithms. Systems like EDGE [16], DaVinci =-=[7]-=- or GRAB [17] concentrate on graph visualization and editing, and offer only limited support for implementing algorithms. There is a gap between these two categories. To program and work with graph al... |

38 |
A Browser for Directed Graphs
- Rowe, Davis, et al.
- 1987
(Show Context)
Citation Context ...h can be roughly divided into two categories. Systems like LEDA [15] and graphbase [13] concentrate on the implementation of a library of graph algorithms. Systems like EDGE [16], DaVinci [7] or GRAB =-=[17]-=- concentrate on graph visualization and editing, and offer only limited support for implementing algorithms. There is a gap between these two categories. To program and work with graph algorithms, it ... |

20 |
Konzeption und Implementierung von Grapheneditoren
- Himsolt
- 1991
(Show Context)
Citation Context ...makes changes in the graph, its drawing will become harder to read, so the graph needs to be rearranged. Since this is always a tedious process, any assistance by the computer is appreciated. GraphEd =-=[10]-=- is a system which supports all these requirements. GraphEd consists of an editor, an interface for implementing graph algorithms and a set of graph layout algorithms. GraphEd is written in C and runs... |

16 | Comparing and evaluating layout algorithms within graphed
- Himsolt
- 1995
(Show Context)
Citation Context ...at most of the criteria upon which the current algorithms are based are NP complete [2], so heuristics are needed. Another problem is that the exact relevance of the criteria is yet unknown. [19] and =-=[12]-=- survey that topic and show some results on ranking layout criteria. GraphEd comes with a set of parametrized layout algorithms which cover a wide range of the algorithms that are described in the lit... |

13 |
I.G.: Algorithms for drawing graphs: An annotated bibliography
- Battista, Eades, et al.
- 1994
(Show Context)
Citation Context ...needs to be visualized for debugging. Also, layout algorithms are an important tool to support users while editing graphs. An overview of the current state of graph drawing algorithms is presented in =-=[4]-=-. One major problem is that most of the criteria upon which the current algorithms are based are NP complete [2], so heuristics are needed. Another problem is that the exact relevance of the criteria ... |

12 |
Nice Drawings of Graphs are Computationally Hard
- Brandenburg
- 1988
(Show Context)
Citation Context ...ng graphs. An overview of the current state of graph drawing algorithms is presented in [4]. One major problem is that most of the criteria upon which the current algorithms are based are NP complete =-=[2]-=-, so heuristics are needed. Another problem is that the exact relevance of the criteria is yet unknown. [19] and [12] survey that topic and show some results on ranking layout criteria. GraphEd comes ... |

6 |
GraphEd: An interactive tool for developing graph grammars
- Himsolt
- 1990
(Show Context)
Citation Context ...ates new edges that connect the inserted subgraph with the rest. Graph grammars [6] provide such mechanisms. GraphEd supports 1-eNCE graph grammars. Derivation rules are specified in a graphical form =-=[9]-=-, and can be applied interactively. 1-eNCE graph grammars are not as powerful as those used in systems like PROGRES [18], but they are easier to use and can be implemented more efficiently. For exampl... |

4 | A View to Graph Drawing Algorithms through GraphEd
- Himsolt
- 1993
(Show Context)
Citation Context ...e actual applications include (see [10] for an overview): -- Graph editor. -- Development of graph algorithms, including algorithm animations. -- Development and evaluation of graph layout algorithms =-=[11]-=-. -- Combinatorial algorithms. -- Graph grammar algorithms, including a parser and a layout system. -- Application of graph grammars. -- Data base design. -- Graphical front-ends. Planned work include... |

3 | Designing dataflow graphs by graph grammars
- Brandenburg, Himsolt, et al.
- 1994
(Show Context)
Citation Context ...nd can be applied interactively. 1-eNCE graph grammars are not as powerful as those used in systems like PROGRES [18], but they are easier to use and can be implemented more efficiently. For example, =-=[3]-=- shows how to specify data flow graphs by graph grammars, and draw them with a simple layout algorithm. 3 Graphical Representation of Nodes and Edges GraphEd offers various options to customize the ap... |

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

2 |
Cabri 3.0 Reference Guide. Laboratoire de Structures Discretes et de Didactique, Universite Joseph Fourier
- Bordier
- 1990
(Show Context)
Citation Context ...n a convenient way, and would like to see the results of an algorithm. A programmer will need help with debugging, and this cannot be done with adjacency lists in a reasonable way. Systems like CABRI =-=[1]-=- or Design [14] are a combination of an editor and a library of algorithms. The construction of graphs is still a complex process, even with the support of an interactive system. But, many graphs have... |

1 |
Spremb: a system for developing graph algorithms
- Eades, Fogg, et al.
- 1988
(Show Context)
Citation Context ...ructure An application module is a set of C modules which are compiled and linked with the core system of GraphEd. We choose this approach over a set of separate communicating programs like in SPREMB =-=[5]-=- since that needs extensive interprocess communication. This can degrade performance significantly, especially in an interactive system which depends on fast response time to the user's actions. The a... |

1 |
F.: The Design of an Extendible
- Paulisch
- 1993
(Show Context)
Citation Context ...support this process, which can be roughly divided into two categories. Systems like LEDA [15] and graphbase [13] concentrate on the implementation of a library of graph algorithms. Systems like EDGE =-=[16]-=-, DaVinci [7] or GRAB [17] concentrate on graph visualization and editing, and offer only limited support for implementing algorithms. There is a gap between these two categories. To program and work ... |