gradle-plugin/dev.zacsweers.metro.gradle.analysis/GraphAnalyzer

GraphAnalyzer

class GraphAnalyzer(bindingGraph: BindingGraph)(source)

Performs various graph analysis algorithms on a BindingGraph using Guava graphs.

Constructors

GraphAnalyzer

constructor(bindingGraph: BindingGraph)

Functions

computeBetweennessCentrality

fun computeBetweennessCentrality(): CentralityResult

Computes betweenness centrality for each node. Nodes with high centrality lie on many shortest paths between other nodes, making them important connectors in the graph.

computeDominators

fun computeDominators(): DominatorResult

Computes dominator relationships in the graph. A node X dominates node Y if every path from a root to Y must pass through X. Nodes that dominate many others are critical bottlenecks.

computeFanAnalysis

fun computeFanAnalysis(topN: Int): FanAnalysisResult

Computes fan-in (number of dependents) and fan-out (number of dependencies) for each binding. High fan-in indicates widely used bindings; high fan-out indicates bindings with many dependencies.

computePathsToRoot

fun computePathsToRoot(): PathsToRootResult

Computes shortest paths from all nodes to the graph root using Dijkstra's algorithm.

computeStatistics

fun computeStatistics(): GraphStatistics

Compute basic statistics about the graph.

findLongestPaths

fun findLongestPaths(maxPaths: Int = 5): LongestPathResult