Optimizing product orders using graph algorithms for improving incremental product-line analysis

摘要: The individual analysis of each product a software line (SPL) leads to redundant steps due the inherent commonality. Therefore, incremental SPL analyses exploit commonalities and focus on differences between products reduce effort. However, existing techniques are influenced by order in which analyzed. more similar subsequently analyzed are, greater is potential reduction overall effort as imply less be Hence, an products, where total number minimized, facilitates analyses. In this paper, we apply graph algorithms determine optimized orders. We capture nodes graph, solution-space information defines edge weights nodes. adopt heuristics for finding optimal solution traveling salesperson problem path with minimal costs. A represents w.r.t. minimized all products. realize prototype our approach evaluate its applicability performance showing significant optimization compared standard random