Struct TrustScores 

pub struct TrustScores { /* private fields */ }

Global trust scores, one per peer, plus how the computation went.

Scores are indexed by peer: scores()[i] belongs to peer i. They are non-negative and add up to 1 (up to floating point rounding).

Implementations

impl TrustScores

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

The score of every peer, indexed by peer.

pub fn get(&self, peer: usize) -> Option<f64>

The score of one peer, or None if the index is outside the network.

pub fn len(&self) -> usize

Number of peers.

pub fn is_empty(&self) -> bool

Always false: a computed network has at least one peer.

pub fn ranking(&self) -> Vec<(usize, f64)>

(peer, score) pairs, highest score first. Equal scores keep peer order.

Examples found in repository

examples/basic.rs (line 21)

fn main() -> Result<(), Box<dyn std::error::Error>> {
    let names = ["alice", "bob", "carol", "mallory"];

    // who trusts whom, and how much (weights are relative per truster)
    let local_trust = [
        TrustEdge::new(0, 1, 3.0), // alice -> bob
        TrustEdge::new(0, 2, 1.0), // alice -> carol
        TrustEdge::new(1, 2, 2.0), // bob -> carol
        TrustEdge::new(2, 0, 1.0), // carol -> alice
        TrustEdge::new(3, 3, 9.0), // mallory only vouches for herself
    ];
    // alice is trusted from the start
    let pre_trust = [PreTrust::new(0, 1.0)];

    let result = eigentrust(local_trust, pre_trust)?;

    for (peer, score) in result.ranking() {
        println!("{:<8} {:.4}", names[peer], score);
    }
    println!("converged after {} iterations", result.iterations());
    Ok(())
}

pub fn iterations(&self) -> usize

Power iterations performed.

Examples found in repository

examples/basic.rs (line 24)

fn main() -> Result<(), Box<dyn std::error::Error>> {
    let names = ["alice", "bob", "carol", "mallory"];

    // who trusts whom, and how much (weights are relative per truster)
    let local_trust = [
        TrustEdge::new(0, 1, 3.0), // alice -> bob
        TrustEdge::new(0, 2, 1.0), // alice -> carol
        TrustEdge::new(1, 2, 2.0), // bob -> carol
        TrustEdge::new(2, 0, 1.0), // carol -> alice
        TrustEdge::new(3, 3, 9.0), // mallory only vouches for herself
    ];
    // alice is trusted from the start
    let pre_trust = [PreTrust::new(0, 1.0)];

    let result = eigentrust(local_trust, pre_trust)?;

    for (peer, score) in result.ranking() {
        println!("{:<8} {:.4}", names[peer], score);
    }
    println!("converged after {} iterations", result.iterations());
    Ok(())
}

pub fn residual(&self) -> f64

Change between the last two iterations (L2 norm). At most the convergence threshold.

pub fn into_scores(self) -> Vec<f64>

The scores, indexed by peer.

Trait Implementations

impl Clone for TrustScores

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TrustScores

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

Formats the value using the given formatter.

impl PartialEq for TrustScores

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for TrustScores