Research Of The Shortest Path Generation Method To Components In Software Architecture

With the software being used more widely and the software systems being increasingly complicated and large, the software architecture, as an important means for improving the quality of the software system, controlling the complexity of software and supporting the development and reuse of software, is gaining attention from the researchers and software developers and begins to get application.It has been found in the study that the difficulty in the research is how to test thesoftware architecture automatically, effectively and sufficiently. These tests will provideus a confirmation on the conclusion of early design of software’s life cycle. Thus, wecan find and solve bugs in the software before its implementation and integration, whichdecreases the test cost. However, the lack of researches on software architecture and theproblems in testing software architecture make it the top priority in applying softwarearchitecture to software development successfully to find an effective technique fortesting software architecture.This paper mainly studied the C2style of software architecture, more than in thesearch for common path based on the analysis and research, A*algorithm of heuristicsearch algorithm was applied to search he shortest path in the C2style architecture. Inthe experiments, taking KLAX system as an example, insert the inspecting path nodeinto the OPEN table, according to the valuation of the A*algorithm function f (n)=g (n)+h (n), g (n) is the actual distance from the start node to the current node, h (n) isthe estimate distance from the current node to the target node, calculate the searchingpath node’s value of the next step. Comparing the value, choose the path of least valuenode, as the node of the next to go, insert into the CLOSE table, at the same time, in thesearch process, constantly updated OPEN table and the CLOSE table, finally generatethe test path. This paper also improve the evaluation function as f (n)=g (n)+h (n)+h*(n), h*(n) estimate value of the distance from the current path of the parent node tothe target node, thus optimizing the A*algorithm, and the optimization A*algorithm isapplied to search the KLAX system test path one more time. Finally, the statistical standard A*algorithm and the improved A*algorithm applied in the experiment ofcounting the node number search to the path in the CLOSE table, by comparing the twoexperimental results, it showed that, compared with the standard A*algorithm, theimproved A*algorithm of the search direction is more approaching to the target node,greatly reducing the node traversal algorithm used in number, and improved the searchspeed, verified the improved A*algorithm in the test path search is feasible andeffective.