Struct simple_pagerank::Pagerank

pub struct Pagerank<T> where
    T: Eq + Hash + Clone,  { /* fields omitted */ }

PageRank structure.

Implementations

impl<T> Pagerank<T> where
    T: Eq + Hash + Clone, 

pub fn new() -> Pagerank<T>

Creates a new instance

pub fn set_damping_factor(&mut self, factor: u8) -> Result<(), String>

Sets the dumping factor. A value between 0 and 100 is expected.

pub fn add_edge(&mut self, source: T, target: T)

Adds an node between two nodes

pub fn get_score(&self, node: T) -> Option<f64>

Returns the current score of a gien node

pub fn get_in_edges(&self, node: T) -> Option<usize>

Returns the number of in edges for the given node

pub fn get_out_edges(&self, node: T) -> Option<usize>

Returns the number of out edges for the given node

pub fn get_or_create_node(&mut self, node: T) -> usize

Returns the node_id for a given node name

pub fn calculate_with_convergence(&mut self, convergence: f64) -> i32

Calculates PageRank with custom convergence

pub fn calculate(&mut self) -> i32

Calculates pagerank with custom convergence

pub fn nodes(&self) -> Vec<(&T, f64)>

Return all nodes, sorted by their pagerank

pub fn calculate_step(&mut self) -> f64

Calculates a single iteration of the PageRank

pub fn len_nodes_with_in_edges(&mut self) -> usize

Len of all edges

pub fn len(&self) -> usize

Return the number of vertices/nodes in the current graph

pub fn len_node(&self) -> usize

Returns the number of edges in the current graph

pub fn is_empty(&self) -> bool

If the graph is empty

Trait Implementations

impl<T> Default for Pagerank<T> where
    T: Eq + Hash + Clone, 

fn default() -> Self

Returns the “default value” for a type.