There are always more than one shortest paths between two components in software architecture, and in the application of path selection with additional constraints, several optimal or near optimal paths are desired. Traditional A* algorithm has been successfully used in software testing activities such as finding the shortest path, selecting test suites and test suites prioritization. Little work has been specifically targeted towards the shortest component path of software architecture applications. In this paper, we propose an improved A* algorithm, and combine with an example to explain the algorithm solving process. Finally, we implement the A* algorithm and the improved A* algorithm, and the results are compared. It is shown that the shortest component path using improved A* algorithm is completely feasible and effective.
展开▼
