Struct Graph 

pub struct Graph<T: Eq + Hash + Clone> { /* private fields */ }

Datastructure to run graph algorithms on.

Implementations

impl<T: Eq + Hash + Clone> Graph<T>

PageRank and TextRank related graph functionality

pub fn populate_for_textrank(&mut self, tokens: &[T], window_size: usize)

Add tokens to graph, use a window in which all tokens will be connected with each other using bidirectional connections. Use this if you want to use textrank for keyword extraction.

Since textrank is just pagerank you can use the run_pagerank() function to get the results.

pub fn run_pagerank(&self, config: &PageRankConfiguration) -> RankedNodes<'_, T>

Runs the textrank algorithm on the graph and returns a HashMap mapping node values to the resulting scores.

impl<T: Eq + Hash + Clone> Graph<T>

pub fn new() -> Self

Construct a new, empty graph

pub fn modify<F, R>(&mut self, callback: F) -> R

where for<'new_id> F: FnOnce(MutableGraph<'new_id, T>) -> R,

Constructs a modifiable versions of this graph and passes it to callback.

This construct is to ensure that node ids aren’t mixed up between graphs.

Trait Implementations

impl<T: Eq + Hash + Clone> Default for Graph<T>

fn default() -> Self

Returns the “default value” for a type.