pub struct PageRank<'a> {
pub graph: &'a str,
pub damping: f64,
pub max_iterations: u32,
pub tolerance: f64,
}Expand description
PageRank centrality (power iteration with damping).
Iterates new_rank[v] = (1 - d)/N + d * sum(rank[u] / out_deg(u))
over in-neighbors u, until the L1 delta drops below
tolerance or max_iterations is reached. Final scores are
min-max normalized to [0, 1].
Fields§
§graph: &'a str§damping: f64§max_iterations: u32§tolerance: f64Implementations§
Auto Trait Implementations§
impl<'a> Freeze for PageRank<'a>
impl<'a> RefUnwindSafe for PageRank<'a>
impl<'a> Send for PageRank<'a>
impl<'a> Sync for PageRank<'a>
impl<'a> Unpin for PageRank<'a>
impl<'a> UnsafeUnpin for PageRank<'a>
impl<'a> UnwindSafe for PageRank<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more