scirs2_graph::measures

Function hits_algorithm

Source 
pub fn hits_algorithm<N, E, Ix>(
    graph: &DiGraph<N, E, Ix>,
    max_iter: usize,
    tolerance: f64,
) -> Result<HitsScores<N>>
where
    N: Node + Clone + Hash + Eq,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Compute HITS algorithm for a directed graph

The HITS algorithm computes two scores for each node:

  • Authority score: nodes that are pointed to by many hubs
  • Hub score: nodes that point to many authorities

§Arguments

  • graph - The directed graph
  • max_iter - Maximum number of iterations
  • tolerance - Convergence tolerance

§Returns

  • HitsScores containing authority and hub scores for each node