Program graph visualization

✍ Scribed by Plínio R. S. Vilela; José C. Maldonado; Mario Jino

• Book ID: 101239671
• Publisher: John Wiley and Sons
• Year: 1997
• Tongue: English
• Weight: 183 KB
• Volume: 27
• Category: Article
• ISSN: 0038-0644
• DOI: 10.1002/(sici)1097-024x(199711)27:11<1245::aid-spe128>3.0.co;2-2

✦ Synopsis

Although there are many algorithms to draw hierarchical structures such as directed graphs and trees none specifically treat the problem of visualizing program graphs. This paper presents an algorithm and the underlying tool -ViewGraph -designed to visualize program graphs. The algorithm is divided in two parts: (1) determine node positions, and (2) assign routes to branches. The first part has three steps: level assignment, scope and position calculation. A modified algorithm used to assign levels to nodes in a tree is used to find Y coordinates; a concept called scope is used to define X coordinates. Scope is a prediction of the space required by a node and its descendants. A search on the available positions left by the placement of nodes is performed to route branches. A set of aesthetic aspects meant to help the development of program graph visualization algorithms is also proposed. The algorithm runs in an acceptable time making it useful even for interactive applications. ©1997 by John Wiley & Sons, Ltd.