The document discusses implementing McCabe's metrics to measure the complexity of a software program. It describes testing the program using path testing. The test plan involves measuring cyclomatic complexity using the formula V(G)=e-n+2, where e is the number of edges and n is the number of nodes in the flow graph. The document provides an example of drawing the flowchart and flow graph of a program to find the greatest of 3 numbers, then calculates cyclomatic complexity as 4 based on 9 edges and 7 nodes. It describes using WinRunner to automate testing and record test results.