An edge crossing minimization algorithm based on adjacency matrix transformation

In software testing and maintenance, how to obtain useful information and relationships from large amounts of information quickly becomes an urgent problem which is required to be solved. Visualization technology is one of the effective tools. The tree structure of hierarchical graph can effectively display hierarchical structure of software testing and maintenance information, and which can help software maintainers to understand the software. Minimizing edge crossing is directly involved with the readability of the graph in drawing hierarchical graph. An optimization is given for minimizing edge crossing problem based on characteristics of adjacency matrix. The representation and transformation methods of hierarchical graph´s adjacency matrix are given. Using the algorithm we can achieve the aims of optimization for edge crossing minimization during experimental results.