Struct simple_pagerank::Pagerank

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

Implementations

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

pub fn new() -> Pagerank<T>

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

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

Adds an edge between two nodes

pub fn get_node(&mut self, name: T) -> Node<T>

Returns a copy of a node

pub fn get_node_id(&mut self, name: 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<Node<T>>

Return all nodes, sorted by their pagerank

pub fn calculate_step(&mut self) -> f64

Calculates a single iteration of the PageRank

pub fn len_with_incoming_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_edge(&self) -> usize

Returns the number of edges in the current graph

pub fn is_empty(&self) -> bool

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.