Struct HypergraphPageRank 

pub struct HypergraphPageRank {
    pub elements: Vec<(ElementId, f64)>,
    pub relations: Vec<(RelationId, f64)>,
}

Personalized hypergraph PageRank output.

Unlike binary Reader::personalized_pagerank, a hypergraph ranks both participants and the hyperedges themselves: elements are the projection’s participant vertices and relations are its hyperedges, each paired with its rank and ordered highest first.

Performance

Cloning is O(elements + relations).

Fields

elements: Vec<(ElementId, f64)>

Participant elements paired with rank, highest first.

relations: Vec<(RelationId, f64)>

Hyperedges (relations) paired with rank, highest first.

Trait Implementations

impl Clone for HypergraphPageRank

fn clone(&self) -> HypergraphPageRank

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HypergraphPageRank

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

Formats the value using the given formatter.

impl Default for HypergraphPageRank

fn default() -> HypergraphPageRank

Returns the “default value” for a type.

impl PartialEq for HypergraphPageRank

fn eq(&self, other: &HypergraphPageRank) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for HypergraphPageRank