Struct RankedNodes 

pub struct RankedNodes<'a, T: Eq + Hash + Clone> { /* private fields */ }

Holds the result of a ranking algorithm that was run on a Graph.

Implementations

impl<'a, T: Eq + Hash + Clone> RankedNodes<'a, T>

pub fn hash_map(&self) -> HashMap<T, f32>

Returns a hash map that maps node data to the resulting score

pub fn unsorted_iter(&'a self) -> UnsortedRankedNodesIter<'a, T>

Returns an unsorted iterator over all nodes and their scores (&data, score).

This is useful for building maps and filtering by data aspects before sorting.

pub fn sorted_iter(&'a self) -> SortedRankedNodesIter<'a, T>

Returns a sorted iterator over all nodes and their scores (&data, score).

The highest scores are sorted first.

This is useful for getting the top n results of the ranking.

pub fn get_score_for(&self, data: &T) -> Option<f32>

Convenience function to look the score of a single data point

This is useful if one only needs the scores for a few specific data points.

pub fn len(&self) -> usize

Returns the number of scores in this result set.

This is usually the number of nodes in the graph.

pub fn is_empty(&self) -> bool

Wheter the result set is empty.