The Dominance Tree in Visualizing Software Dependencies
- 1 January 2005
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph as a dominance tree, and, hence, adds information not immediately visible in large and complex graphs. Moreover, the subordination (or locality) can be leveraged for drawing dependency graphs. This paper envisions ways to leverage the dominance relation for structuring and presenting large dependency graphs. To explore the feasibility of these hinds of visualization, we measure dominance trees for large software systems written in different programming languages. These measurements give us the necessary information to design a usable visualizationKeywords
This publication has 4 references indexed in Scilit:
- Software visualization in software maintenance, reverse engineering, and re‐engineering: a research surveyJournal of Software Maintenance and Evolution: Research and Practice, 2003
- Graph visualization and navigation in information visualization: A surveyIEEE Transactions on Visualization and Computer Graphics, 1999
- Finding components in a hierarchy of modules: a step towards architectural understandingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Software salvaging and the call dominance treeJournal of Systems and Software, 1995