Loading...
Please wait, while we are loading the content...
Similar Documents
Clock Logic Status ADT Chute ADT Well ADT Palette ADT Next Tile Placing Logic Tile Match
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lun, Lijun |
| Copyright Year | 2017 |
| Abstract | The vast majority of researches about the shortest component path algorithm in software architecture, nowadays, focus just on the case from the beginning component to the stopping component. When the shortest component path is constrained to the specified number of components, the current technologies will no longer be applied. Based on the research on the present the shortest path algorithm, we propose an algorithm to solve the nodes-constrained shortest component path (πNCSCP ) problem in software architecture. The proposed algorithm based on inverse adjacency list of the Component Interaction Graph (CIG) is developed for finding πNCSCP of C2-style architecture. The time complexity of the proposed algorithm is O((m-2)w) (m is the number of nodes-constrained, w is the total number of edges in CIG). Since the inverse adjacency list is used to the graphic storage structure, this algorithm is much simpler and easy to be fulfilled, and reduces the time complexity as well. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.engineeringletters.com/issues_v25/issue_1/EL_25_1_08.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
