Struct Rank 

pub struct Rank { /* private fields */ }

What a run worked out, and how sure it is.

Implementations

impl Rank

pub fn of(&self, node: u32) -> f32

One node’s score.

Panics

If node is not a node of the snapshot this was computed over.

pub fn scores(&self) -> &[f32]

Every score, indexed by dense id.

pub fn rounds(&self) -> u32

How many rounds it took.

pub fn delta(&self) -> f64

How much the last round moved the vector, summed over every node.

pub fn converged(&self) -> bool

Whether it settled rather than running out of rounds.

Against the epsilon this run was asked for, not the default one, so a caller who asked for something stricter is told the truth about it.

pub fn top(&self, k: usize) -> Vec<(u32, f32)>

The k highest scoring nodes, best first.

Ties go to the lower dense id, so two runs over the same graph list them in the same order. Asking for more than there are gives all of them.

Trait Implementations

impl Clone for Rank

fn clone(&self) -> Rank

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Rank

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Rank

fn default() -> Rank

Returns the “default value” for a type.