doi: 10.4304/jsw.9.6.1471-1478
Shortest Component Path Generation of C2-Style Architecture Using Improved A* Algorithm
2Heilongjiang University of Chinese Medicine Library, Harbin, China
Abstract—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.
Index Terms—software architecture; C2-style; component interaction graph; shortest component path; improved A* algorithm
Cite: Lijun Lun, Lin Zhang, Xin Chi, Hui Xu, "Shortest Component Path Generation of C2-Style Architecture Using Improved A* Algorithm," Journal of Software vol. 9, no. 6, pp. 1471-1478, 2014.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Mar 01, 2024 News!
Vol 19, No 1 has been published with online version [Click]