Premium
Program graph visualization
Author(s) -
Vilela Plínio R. S.,
Maldonado José C.,
Jino Mario
Publication year - 1997
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(199711)27:11<1245::aid-spe128>3.0.co;2-2
Subject(s) - scope (computer science) , visualization , computer science , theoretical computer science , graph layout , graph , node (physics) , graph drawing , set (abstract data type) , tree (set theory) , algorithm , data mining , mathematics , programming language , combinatorics , engineering , structural engineering
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 John Wiley & Sons, Ltd.