compute_partitioning
Partition a project's call graph using Fiedler spectral analysis. Recursively apply the Fiedler vector to produce a partition tree with algebraic connectivity values.
Instructions
Compute Fiedler spectral partitioning of a project's call graph. Recursively bipartitions the graph using the Fiedler vector (2nd eigenvector of the graph Laplacian). Returns a partition tree with node assignments and algebraic connectivity (λ₂) values.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| max_depth | No | ||
| workingDirectory | Yes | ||
| min_partition_size | No |