Cyclomatic complexity is a software metric (measurement),
used to indicate the complexity of a program. It is a quantitative
measure of the number of linearly independent paths through a program's
source code. It was developed by Thomas J. McCabe, Sr. in 1976.

Cyclomatic Complexity of R Code

package-ubuntu-20.04-r-4.0.5#cran#cyclocomp-1.1.0

<p>Automatically builds the package and installs it to a temporary
directory.
</p>

<table summary="R argblock"><tr valign="top">
<td><code>path</code></td>
<td>
<p>Path to the root directory of the R package.</p>
</td>
</tr></table>

<p>Data frame with two columns: <code>name</code> and <code>cyclocomp</code>.
</p>

<p>Other cyclomatic complexity: <code><a href="cyclocomp_package.html">cyclocomp_package</a></code>,
<code><a href="cyclocomp.html">cyclocomp</a></code>
</p>

package-ubuntu-20.04-r-4.0.5#cran#cyclocomp-1.1.0#docs#cyclocomp_package_dir

cyclocomp_package_dir

Description

Usage

Arguments

Value

See Also

cyclocomp

We don't support your browser anymore