Graph Based CIA in Requirements Engineering

We developed a novel Vertical Breadth-First Search All-path graph algorithm that utilizes vertical data structures to find all-length paths (including shortest paths) for all pairs of vertices in a graph. In the current research we propose an approach to apply our All-path algorithm to perform Change Impact Analysis during Requirements Engineering. This article presents a roadmap of our future research plan to apply our All-path algorithm for software quality improvement.