I am having a software engineering course in which I learned about the Graph Matrix that it is used to calculate Cyclomatic Complexity and following things.
1) The probability that a link will be executed. 2) The processing time expanded during traversal of a link. 3) The memory required during traversal of a link.
I am searching information about the above three points but unable to get anything. Would you please help me in giving some information about the above points. Please help, because I have to give a presentation on this topic.
Previous Topic
