Struct HITS 

pub struct HITS<'a> {
    pub graph: &'a str,
    pub max_iterations: u32,
    pub tolerance: f64,
}

HITS centrality (hub / authority mutual reinforcement).

Authority of v is the sum of hub scores of in-neighbors; hub is the sum of authority scores of out-neighbors. Each round normalizes by L2 norm. Final hub and authority scores are min-max normalized to [0, 1]. The payload’s score is the authority; the per-entry fields carry both hub_score and authority_score.

Fields

graph: &'a str

max_iterations: u32

tolerance: f64

Implementations

impl<'a> HITS<'a>

pub fn new(graph: &'a str) -> Self

pub fn max_iterations(self, k: u32) -> Self

pub fn tolerance(self, t: f64) -> Self

pub fn execute<G: GraphStore>( &self, store: &G, ) -> GraphStoreResult<GraphPostingList>