JGraph - A Java Based System for Drawing Graphs and Running Graph Algorithms

Bagga, Jay and Heinz, Adrian (2002) JGraph - A Java Based System for Drawing Graphs and Running Graph Algorithms. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 459-460 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_45).

Full text not available from this repository.

Abstract

JGraph is a Java based system for drawing graphs and for running graph algorithms. A number of well-known algorithms are provided, including those for planarity testing and drawing planar graphs on a grid. The algorithms can be run with an animation feature where the user can see the intermediate steps as the algorithm executes. The system is extensible in that new algorithms can be easily added. The JGraph project was conceived and led by Jay Bagga. Several of his graduate students have made contributions. Aaron Nall designed the original version and the graphical user interface. The most recent version has been managed by Adrian Heinz who has added many new features and has also implemented algorithms for planarity testing and drawing of planar graphs on a grid. This system was initially created for students in computer science, mathematics, and other related disciplines who are learning graph theory and using graph algorithms. It can be used by anyone with an interest in graph drawing and graph algorithms. To draw a planar graph on a grid, we use the Shift Method of de Fraysseix et. al. [1,2]

Item Type:Conference Paper
Additional Information:10.1007/3-540-45848-4_45
Classifications:S Software and Systems > S.001 General
ID Code:419

Repository Staff Only: item control page

References

H. de Fraysseix, J. Pach, and R. Pollack. "How to draw a planar graph on a grid". Combinatorica, 10(41-51), 1990.

Shin-ichi Nakano, "Planar Drawings of Plane Graphs," IEICE Trans. Fundamentals E00-A (1-9), 2000.