Struct RecentDegreeOptions 

pub struct RecentDegreeOptions<'a> {
    pub power: f64,
    pub window: usize,
    pub m: usize,
    pub outseq: Option<&'a [i64]>,
    pub outpref: bool,
    pub zero_appeal: f64,
    pub directed: bool,
}

Options of Graph::recent_degree_game.

The probability that a vertex is cited is proportional to k^power + zero_appeal, where k is the number of edges it gained in the last window time steps.

Fields

power: f64

Exponent of the recent degree (default 1).

window: usize

Size of the time window (default 1).

m: usize

Edges added per time step when outseq is None (default 1).

outseq: Option<&'a [i64]>

Edges added in each time step (overrides m). Default None.

outpref: bool

Whether edges originated by a vertex also count as recent edges (default false).

zero_appeal: f64

Attractiveness of the vertices without recent edges (default 1).

directed: bool

Whether to create a directed graph (default false).

Trait Implementations

impl<'a> Clone for RecentDegreeOptions<'a>

fn clone(&self) -> RecentDegreeOptions<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for RecentDegreeOptions<'a>

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

Formats the value using the given formatter.

impl Default for RecentDegreeOptions<'_>

fn default() -> Self

Returns the “default value” for a type.