Close
Metadata

%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi/2013/01.24.14.25
%2 sid.inpe.br/sibgrapi/2013/01.24.14.25.45
%@isbn 978-85-7669-272-0
%T Visualização de grafos de programa: uma abordagem sem reposicionamento
%D 1994
%A Vilela, Plínio Roberto Souza,
%A Maldonado, José Carlos,
%A Jino, Mario,
%A Chaim, Marcos L.,
%@affiliation Departamento de Engenharia de Computação e Automação Industrial (DCA) da Faculdade de Engenharia Elétrica e de Computação (FEEC), Universidade Estadual de Campinas (UNICAMP)
%@affiliation Instituto de Ciências Matemáticas de São Carlos da Universidade de São Paulo (USP)
%@affiliation Departamento de Engenharia de Computação e Automação Industrial (DCA) da Faculdade de Engenharia Elétrica e de Computação (FEEC), Universidade Estadual de Campinas (UNICAMP)
%@affiliation Embrapa Informática Agropecuária (CNPTIA)
%E Freitas, Carla dal Sasso,
%E Geus, Klaus de,
%E Scheer, Sérgio,
%B Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, 7 (SIBGRAPI)
%C Curitiba
%8 9 - 11 nov. 1994
%I Sociedade Brasileira de Computação
%J Porto Alegre
%V 1
%P 189-196
%S Anais
%K grafos de programa, visualização, reposicionamento, engenharia de software.
%X Program graph visualization has important applications from design to maintenance in software production. Specially in testing several software characteristics are observed through visualization; this is a motivation for the development of algorithms for automatic generation of program graphs. Several authors have presented works in associated areas such as trees, directed planar graphs, general graphs, and specially program graphs display. Most of these works make use of trial-and-of its ancestors is required in order to avoid overlapping. An algorithm which deals with the program graph drawing problem is shown. The algorithm is composed of two steps: node position computation and branch routing. For node position computation a modified tree level calculation function is used to find Y coordinates. In determining X coordinates a new concept, named scope, was defined. The main characteristic of this approach is to allow X positions to be found without relocation. The branch routing uses positions left free by node position computations to find routing options; the best ones are chosen for each branch.
%9 Linguagens e Visualização
%@language pt
%3 25 Visualizacao de grafos de programa.pdf


Close