Sensitivity of Graph-theoretic Metrics to Edge Directions for Structured and Unstructured Programs�
Abstract
Program complexity can be measured based on graph-theoretic metrics such as cyclomatic number, track number, normal number, etc. This thesis explores the question of changing the directions of the edges on a flow graph and its impact on the graph-theoretic complexity metrics. Both structured and unstructured flow graphs are considered in this study.
Collections
- OSU Theses [15752]