Function compute_centrality 

pub fn compute_centrality(
    graph: &ArborGraph,
    iterations: usize,
    damping: f64,
) -> CentralityScores

Computes centrality scores for all nodes in the graph.

This is a simplified PageRank that:

1. Initializes all nodes with equal score
2. Iteratively distributes scores along edges
3. Applies damping to prevent score concentration

Arguments

• graph - The graph to analyze
• iterations - Number of iterations (10-20 is usually enough)
• damping - Damping factor (0.85 is standard)