networkit_rs::distance

Trait SSSP

Source 
pub trait SSSP: Algorithm {
    // Required methods
    fn distance(&self, t: u64) -> f64;
    fn get_distances(&mut self) -> ValueIter ⓘ;
    fn number_of_paths(&self, t: u64) -> f64;
    fn get_predecessors(&self, t: u64) -> NodeIter ⓘ;
    fn get_path(&self, t: u64, forward: bool) -> NodeIter ⓘ;
    fn get_paths(&self, t: u64, forward: bool) -> Vec<Vec<u64>>;
    fn get_node_sorted_by_distances(&self) -> NodeIter ⓘ;
    fn get_num_reachable_nodes(&self) -> u64;
    fn set_source(&mut self, u: u64);
    fn set_target(&mut self, v: u64);
    fn get_sum_of_distances(&self) -> f64;
}

Required Methods§

Source

fn distance(&self, t: u64) -> f64

Source

fn get_distances(&mut self) -> ValueIter ⓘ

Source

fn number_of_paths(&self, t: u64) -> f64

Source

fn get_predecessors(&self, t: u64) -> NodeIter ⓘ

Source

fn get_path(&self, t: u64, forward: bool) -> NodeIter ⓘ

Source

fn get_paths(&self, t: u64, forward: bool) -> Vec<Vec<u64>>

Source

fn get_node_sorted_by_distances(&self) -> NodeIter ⓘ

Source

fn get_num_reachable_nodes(&self) -> u64

Source

fn set_source(&mut self, u: u64)

Source

fn set_target(&mut self, v: u64)

Source

fn get_sum_of_distances(&self) -> f64

Implementors§