The set of linearly independent paths in a program is not necessarily unique.

In order to find a measure for the difficulty to test a program John McCabe defined program complexity as the number of edges in a control flow graph.

In a self-contained program unit (e.g., a Java method), the number of linearly independent paths equals the number of decisions minus 1.

The number of independent paths in a program is not the same as the McCabe complexity.