Struct IndependentCascade 

pub struct IndependentCascade {
    pub adjacency: AdjList,
    pub num_nodes: usize,
}

Independent Cascade (IC) diffusion model configuration.

Each active node u attempts to activate every inactive neighbour v with probability p(u, v) stored as the edge weight. Each edge is tried at most once.

Fields

adjacency: AdjList

Adjacency list: node → [(neighbour, propagation_probability)].

num_nodes: usize

Total number of nodes in the graph.

Implementations

impl IndependentCascade

pub fn new(adjacency: AdjList, num_nodes: usize) -> Self

Create a new IC model.

Arguments

• adjacency — directed adjacency list with propagation probabilities as weights.
• num_nodes — number of nodes (needed for result reporting).

pub fn from_edges(edges: &[(usize, usize, f64)], num_nodes: usize) -> Self

Build an IC model from a vec of (source, target, probability) triples.

pub fn simulate(&self, seeds: &[usize]) -> Result<SimulationResult>

Run a single IC simulation from the given seed set.

pub fn expected_spread( &self, seeds: &[usize], num_simulations: usize, ) -> Result<f64>

Estimate expected spread over num_simulations Monte-Carlo runs.

Trait Implementations

impl Clone for IndependentCascade

fn clone(&self) -> IndependentCascade

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IndependentCascade

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

Formats the value using the given formatter.