A graph theory based algorithm for the computation of cyclomatic complexity of software requirements

Cyclomatic complexity (CC) is used to find out the number of independent paths in a program or software. In literature, different algorithms have been proposed to compute the CC of a program or software. In this paper, we proposed an algorithm for the computation of CC based on graph theory. We apply the proposed method to compute the CC of login module of an Institute Examination System (IES).