Struct ConstrainedPageRankGraph 

pub struct ConstrainedPageRankGraph<T> { /* private fields */ }

Precomputed heterogeneous graph for repeated constrained personalised PageRank runs, i.e. the diffusion profiles of Ruiz et al.

Implementations

impl<T> ConstrainedPageRankGraph<T>

where T: BixverseFloat + Sum,

pub fn new( node_types: &[String], from: &[usize], to: &[usize], weights: Option<&[T]>, type_weights: Option<&FxHashMap<String, T>>, sink_types: &FxHashSet<String>, undirected: bool, ) -> Result<Self, MethodsErrors>

Build the graph from 0-based edge indices and node types.

Params

• node_types - Type per node. Type ids follow order of first appearance.
• from - 0-based source node per edge
• to - 0-based target node per edge
• weights - Optional non-negative weight per edge. Defaults to 1.
• type_weights - Optional weight per node type. Must cover every type in node_types. None gives the plain random walk.
• sink_types - Node types that act as sinks (no out-flow) unless the node is a seed of the run. Unknown names are ignored.
• undirected - Add every edge in both directions.

Returns

The initialised ConstrainedPageRankGraph, or an error for malformed input.

pub fn node_count(&self) -> usize

Number of nodes in the graph.

Returns

The node count.

Trait Implementations

impl<T: Clone> Clone for ConstrainedPageRankGraph<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ConstrainedPageRankGraph<T>

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

Formats the value using the given formatter.