rust-igraph 0.0.1-alpha.2

//! Edge-list percolation (ALGO-CC-030).
//!
//! Counterpart of `igraph_edgelist_percolation()` from
//! `references/igraph/src/connectivity/percolation.c:105`. Given a
//! sequence of vertex-pair edges, returns the evolution of the
//! largest connected component as each edge is added in order.
//!
//! Algorithm: standard union-find with path compression and
//! union-by-size. Each "add edge" call merges two trees; we track
//! the size of the largest tree seen so far and the running count of
//! vertices touched by any edge. Time complexity:
//! `O(|E| · α(|E|))` where `α` is the inverse Ackermann function —
//! amortised near-constant per operation.
//!
//! Both outputs are always populated (the C API makes them
//! independently optional; in Rust the marginal cost of always
//! returning both is one extra `Vec<u32>` alloc).

use crate::core::graph::{EdgeId, VertexId};
use crate::core::{Graph, IgraphError, IgraphResult};

/// Outputs of [`edgelist_percolation`]. Same length as the input
/// edge slice. `giant_size[i]` is the size of the largest component
/// after edge `i` is added; `vertex_count[i]` is the number of
/// distinct vertices touched by edges `0..=i`.
#[derive(Debug, Clone, PartialEq)]
pub struct EdgelistPercolation {
    /// Size of the largest connected component after edge `i` is added.
    pub giant_size: Vec<u32>,
    /// Cumulative count of distinct vertices touched by any edge in `0..=i`.
    pub vertex_count: Vec<u32>,
}

/// `links[v]` walks toward the root of `v`'s union-find tree (each
/// node's parent), with path compression along the way. Returns the
/// representative.
fn find_root(links: &mut [u32], mut v: usize) -> usize {
    while links[v] as usize != v {
        // Path compression: halve the path by linking each node to
        // its grandparent (matches the upstream `links[a] =
        // links[links[a]]` line).
        links[v] = links[links[v] as usize];
        v = links[v] as usize;
    }
    v
}

/// Percolation curve as a sequence of vertex-pair edges is added.
///
/// Returns an [`EdgelistPercolation`] with two vectors, both of
/// length `edges.len()`:
/// - `giant_size[i]`: size of the largest component after edge `i`
///   is added (1 if no edges or the first edge connects two new
///   vertices).
/// - `vertex_count[i]`: number of distinct vertices touched by any
///   edge in `0..=i`.
///
/// Vertex ids are inferred from the edge list — the implicit vertex
/// count is `max(max(u, v) for (u, v) in edges) + 1`. Endpoints may
/// be self-loops (a self-loop adds nothing to either output).
///
/// Returns [`IgraphError::InvalidArgument`] if any vertex id exceeds
/// `i32::MAX` (matches upstream's `IGRAPH_EINVVID` semantics).
///
/// Counterpart of `igraph_edgelist_percolation` from
/// `references/igraph/src/connectivity/percolation.c:105`.
///
/// # Examples
///
/// ```
/// use rust_igraph::edgelist_percolation;
///
/// // Adding edges (0-1), (2-3), (1-2): the giant grows 2, 2, 4.
/// let edges = [(0u32, 1u32), (2, 3), (1, 2)];
/// let p = edgelist_percolation(&edges).unwrap();
/// assert_eq!(p.giant_size, vec![2, 2, 4]);
/// assert_eq!(p.vertex_count, vec![2, 4, 4]);
/// ```
pub fn edgelist_percolation(edges: &[(VertexId, VertexId)]) -> IgraphResult<EdgelistPercolation> {
    let ecount = edges.len();
    let mut giant_size: Vec<u32> = Vec::with_capacity(ecount);
    let mut vertex_count: Vec<u32> = Vec::with_capacity(ecount);

    if ecount == 0 {
        return Ok(EdgelistPercolation {
            giant_size,
            vertex_count,
        });
    }

    // Implicit vertex count = max id seen + 1. `max_id` is u32; the
    // +1 is checked to catch the (extremely unlikely) u32::MAX case.
    let max_id = edges.iter().flat_map(|&(u, v)| [u, v]).max().unwrap_or(0);
    let vcount_u32 = max_id
        .checked_add(1)
        .ok_or(IgraphError::Internal("vertex count overflow"))?;
    let vcount = vcount_u32 as usize;

    // Union-find: `links[v]` is v's parent (self if root); `sizes[v]`
    // is the size of v's tree (only meaningful at roots), with -1
    // sentinel encoded as 0 here meaning "not yet touched".
    let mut links: Vec<u32> = (0..vcount_u32).collect();
    let mut sizes: Vec<u32> = vec![0; vcount];

    let mut biggest: u32 = 1;
    let mut vertices_added: u32 = 0;

    for &(from, to) in edges {
        let from_idx = from as usize;
        let to_idx = to as usize;
        if sizes[from_idx] == 0 {
            sizes[from_idx] = 1;
            vertices_added += 1;
        }
        if sizes[to_idx] == 0 {
            sizes[to_idx] = 1;
            // Only count `to` if distinct from `from` (self-loop case).
            if from_idx != to_idx {
                vertices_added += 1;
            }
        }
        // Union if they're not already connected. Self-loop is a no-op.
        if from_idx != to_idx {
            let root_a = find_root(&mut links, from_idx);
            let root_b = find_root(&mut links, to_idx);
            if root_a != root_b {
                // Union-by-size: attach smaller under larger.
                let (parent, child) = if sizes[root_a] < sizes[root_b] {
                    (root_b, root_a)
                } else {
                    (root_a, root_b)
                };
                let parent_u32 = u32::try_from(parent)
                    .map_err(|_| IgraphError::Internal("vertex index exceeds u32::MAX"))?;
                links[child] = parent_u32;
                sizes[parent] = sizes[parent]
                    .checked_add(sizes[child])
                    .ok_or(IgraphError::Internal("union-find size overflow"))?;
                if sizes[parent] > biggest {
                    biggest = sizes[parent];
                }
            }
        }
        giant_size.push(biggest);
        vertex_count.push(vertices_added);
    }

    Ok(EdgelistPercolation {
        giant_size,
        vertex_count,
    })
}

/// Bond percolation: the size of the largest component as edges of
/// `graph` are added in the order specified by `edge_order`.
///
/// Returns an [`EdgelistPercolation`] with two vectors, both of
/// length `edge_order.len()` — same shape as
/// [`edgelist_percolation`], just resolved from edge ids instead of
/// raw vertex pairs.
///
/// `edge_order[i]` must be a valid edge id (`< graph.ecount()`) and
/// must not repeat — duplicates return
/// [`IgraphError::InvalidArgument`]; out-of-range ids return
/// [`IgraphError::EdgeOutOfRange`].
///
/// Edge direction is ignored (matches upstream — percolation reads
/// edges as undirected connection events).
///
/// To shuffle into a random order, generate the permutation with
/// your own RNG and pass it as `edge_order`. We don't take an RNG
/// here to keep the API deterministic and to avoid pulling in a
/// `rand` dependency for callers who already have one.
///
/// Counterpart of `igraph_bond_percolation` from
/// `references/igraph/src/connectivity/percolation.c:214`.
///
/// # Examples
///
/// ```
/// use rust_igraph::{Graph, bond_percolation};
///
/// // Path 0-1-2-3 with edges added in natural id order.
/// let mut g = Graph::with_vertices(4);
/// g.add_edges(vec![(0u32, 1u32), (1, 2), (2, 3)]).unwrap();
/// let p = bond_percolation(&g, &[0, 1, 2]).unwrap();
/// assert_eq!(p.giant_size, vec![2, 3, 4]);
/// assert_eq!(p.vertex_count, vec![2, 3, 4]);
/// ```
pub fn bond_percolation(graph: &Graph, edge_order: &[EdgeId]) -> IgraphResult<EdgelistPercolation> {
    let m = graph.ecount();
    let m_u32 = u32::try_from(m).unwrap_or(u32::MAX);

    // Validate up front (matches upstream's two-pass approach): no
    // duplicates and every id in range. We use a bool bitset over
    // the graph's edge ids — `edge_order.len()` may exceed `m`
    // worst-case but a duplicate or oob id will trip the check.
    let mut seen = vec![false; m];
    for &eid in edge_order {
        if (eid as usize) >= m {
            return Err(IgraphError::EdgeOutOfRange { id: eid, m: m_u32 });
        }
        if seen[eid as usize] {
            return Err(IgraphError::InvalidArgument(format!(
                "duplicate edge id {eid} in edge_order"
            )));
        }
        seen[eid as usize] = true;
    }

    // Resolve each edge id → (u, v) endpoint pair, then delegate.
    let mut edges: Vec<(VertexId, VertexId)> = Vec::with_capacity(edge_order.len());
    for &eid in edge_order {
        edges.push(graph.edge(eid)?);
    }
    edgelist_percolation(&edges)
}

// ---------------------------------------------------------------
// ALGO-CC-032: site percolation.
// ---------------------------------------------------------------

/// Outputs of [`site_percolation`]. Same length as `vertex_order`.
/// `giant_size[i]` is the size of the largest connected component
/// after vertex `vertex_order[i]` is activated; `edge_count[i]` is
/// the cumulative number of edges added through step `i` (an edge
/// is "added" the moment both its endpoints become active).
#[derive(Debug, Clone, PartialEq)]
pub struct SitePercolation {
    /// Size of the largest connected component after the i-th vertex
    /// is activated.
    pub giant_size: Vec<u32>,
    /// Cumulative count of edges activated through step i. An edge
    /// `(u, v)` activates the moment its second endpoint joins the
    /// active set. Self-loops on the just-activated vertex and
    /// parallel edges each count separately (matches upstream's
    /// `IGRAPH_LOOPS | IGRAPH_MULTIPLE` neighbor enumeration).
    pub edge_count: Vec<u32>,
}

/// Per-vertex "all-neighbor" lookup. Mirrors upstream's
/// `igraph_neighbors(graph, vertex, IGRAPH_ALL, IGRAPH_LOOPS,
/// IGRAPH_MULTIPLE)`: parallel edges produce duplicates, self-loops
/// appear twice.
fn all_neighbors(graph: &Graph, v: VertexId) -> IgraphResult<Vec<VertexId>> {
    if graph.is_directed() {
        let out_eids = graph.incident(v)?;
        let in_eids = graph.incident_in(v)?;
        let mut nb = Vec::with_capacity(out_eids.len() + in_eids.len());
        for eid in out_eids {
            nb.push(graph.edge_other(eid, v)?);
        }
        for eid in in_eids {
            nb.push(graph.edge_other(eid, v)?);
        }
        Ok(nb)
    } else {
        graph.neighbors(v)
    }
}

/// Site percolation: the size of the largest component as vertices
/// (sites) of `graph` are activated in the order specified by
/// `vertex_order`.
///
/// Each activation step:
/// 1. Mark the vertex active.
/// 2. For every neighbor that is already active, add the connecting
///    edge and union the two trees.
/// 3. Record `giant_size` and `edge_count` after the step.
///
/// `vertex_order` must contain valid ids (`< graph.vcount()`) and
/// must not repeat — duplicates return
/// [`IgraphError::InvalidArgument`]; out-of-range ids return
/// [`IgraphError::VertexOutOfRange`]. The order may be a strict
/// subset of all vertices (skip = "never activated").
///
/// Edge direction is ignored (matches upstream — percolation is
/// purely a connectivity model). Parallel edges count separately;
/// self-loops on the just-activated vertex contribute two to
/// `edge_count` (the loop appears twice in the all-neighbor walk
/// for `IGRAPH_LOOPS` semantics).
///
/// To shuffle into a random order, generate the permutation with
/// your own RNG. We don't take an RNG to keep the API deterministic
/// and dependency-free.
///
/// Counterpart of `igraph_site_percolation` from
/// `references/igraph/src/connectivity/percolation.c:328`.
///
/// # Examples
///
/// ```
/// use rust_igraph::{Graph, site_percolation};
///
/// // Path 0-1-2-3, activate vertices in id order.
/// let mut g = Graph::with_vertices(4);
/// g.add_edges(vec![(0u32, 1u32), (1, 2), (2, 3)]).unwrap();
/// let p = site_percolation(&g, &[0, 1, 2, 3]).unwrap();
/// // Activating 0: no edges added (no active neighbors), giant = 1.
/// // Activating 1: edge (0,1) activates, giant = 2.
/// // Activating 2: edge (1,2) activates, giant = 3.
/// // Activating 3: edge (2,3) activates, giant = 4.
/// assert_eq!(p.giant_size, vec![1, 2, 3, 4]);
/// assert_eq!(p.edge_count, vec![0, 1, 2, 3]);
/// ```
pub fn site_percolation(graph: &Graph, vertex_order: &[VertexId]) -> IgraphResult<SitePercolation> {
    let n = graph.vcount();
    let n_us = n as usize;

    // Validate up front: every id in range, no duplicates.
    let mut seen = vec![false; n_us];
    for &vid in vertex_order {
        if vid >= n {
            return Err(IgraphError::VertexOutOfRange { id: vid, n });
        }
        if seen[vid as usize] {
            return Err(IgraphError::InvalidArgument(format!(
                "duplicate vertex id {vid} in vertex_order"
            )));
        }
        seen[vid as usize] = true;
    }

    let mut giant_size: Vec<u32> = Vec::with_capacity(vertex_order.len());
    let mut edge_count: Vec<u32> = Vec::with_capacity(vertex_order.len());

    if vertex_order.is_empty() {
        return Ok(SitePercolation {
            giant_size,
            edge_count,
        });
    }

    // Union-find: links[v] = parent (self if root); sizes[v] is the
    // tree size at roots, with 0 meaning "not yet activated".
    let mut links: Vec<u32> = (0..n).collect();
    let mut sizes: Vec<u32> = vec![0; n_us];

    let mut biggest: u32 = 1;
    let mut edges_added: u32 = 0;

    for &vid in vertex_order {
        let vid_idx = vid as usize;
        // Activate.
        sizes[vid_idx] = 1;

        // Walk neighbors; union with every already-activated one.
        let neighbors = all_neighbors(graph, vid)?;
        for nb in neighbors {
            let nb_idx = nb as usize;
            if sizes[nb_idx] == 0 {
                continue;
            }
            edges_added = edges_added
                .checked_add(1)
                .ok_or(IgraphError::Internal("edge count overflow"))?;
            // Same union-find core as edgelist_percolation.
            let root_a = find_root(&mut links, vid_idx);
            let root_b = find_root(&mut links, nb_idx);
            if root_a != root_b {
                let (parent, child) = if sizes[root_a] < sizes[root_b] {
                    (root_b, root_a)
                } else {
                    (root_a, root_b)
                };
                let parent_u32 = u32::try_from(parent)
                    .map_err(|_| IgraphError::Internal("vertex index exceeds u32::MAX"))?;
                links[child] = parent_u32;
                sizes[parent] = sizes[parent]
                    .checked_add(sizes[child])
                    .ok_or(IgraphError::Internal("union-find size overflow"))?;
                if sizes[parent] > biggest {
                    biggest = sizes[parent];
                }
            }
        }

        giant_size.push(biggest);
        edge_count.push(edges_added);
    }

    Ok(SitePercolation {
        giant_size,
        edge_count,
    })
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn empty_input_returns_empty() {
        let p = edgelist_percolation(&[]).unwrap();
        assert!(p.giant_size.is_empty());
        assert!(p.vertex_count.is_empty());
    }

    #[test]
    fn single_edge_two_vertices() {
        let p = edgelist_percolation(&[(0, 1)]).unwrap();
        assert_eq!(p.giant_size, vec![2]);
        assert_eq!(p.vertex_count, vec![2]);
    }

    #[test]
    fn two_disjoint_edges_then_join() {
        // (0-1), (2-3), (1-2): two separate pairs of size 2, then a
        // chain of 4.
        let p = edgelist_percolation(&[(0, 1), (2, 3), (1, 2)]).unwrap();
        assert_eq!(p.giant_size, vec![2, 2, 4]);
        assert_eq!(p.vertex_count, vec![2, 4, 4]);
    }

    #[test]
    fn parallel_edge_does_not_change_giant() {
        // Same edge added twice — second one is a no-op for both metrics.
        let p = edgelist_percolation(&[(0, 1), (0, 1)]).unwrap();
        assert_eq!(p.giant_size, vec![2, 2]);
        assert_eq!(p.vertex_count, vec![2, 2]);
    }

    #[test]
    fn self_loop_only_adds_one_vertex() {
        // Self-loop on vertex 0: 1 new vertex, biggest stays 1.
        let p = edgelist_percolation(&[(0, 0)]).unwrap();
        assert_eq!(p.giant_size, vec![1]);
        assert_eq!(p.vertex_count, vec![1]);
    }

    #[test]
    fn chain_grows_linearly() {
        // 0-1, 1-2, 2-3, 3-4 → giants 2, 3, 4, 5.
        let p = edgelist_percolation(&[(0, 1), (1, 2), (2, 3), (3, 4)]).unwrap();
        assert_eq!(p.giant_size, vec![2, 3, 4, 5]);
        assert_eq!(p.vertex_count, vec![2, 3, 4, 5]);
    }

    #[test]
    fn star_around_center() {
        // 0-1, 0-2, 0-3 → star, giant grows 2, 3, 4.
        let p = edgelist_percolation(&[(0, 1), (0, 2), (0, 3)]).unwrap();
        assert_eq!(p.giant_size, vec![2, 3, 4]);
        assert_eq!(p.vertex_count, vec![2, 3, 4]);
    }

    #[test]
    fn merging_unequal_clusters_picks_max() {
        // Build a triangle (0-1, 1-2, 0-2) → size 3, then join to a
        // pair (3-4) by adding (2-3). Final giant = 5.
        let p = edgelist_percolation(&[(0, 1), (1, 2), (0, 2), (3, 4), (2, 3)]).unwrap();
        // After (0,1): {0,1} giant=2
        // After (1,2): {0,1,2} giant=3
        // After (0,2): same tree (no-op), giant=3
        // After (3,4): {3,4} new component, giant stays 3
        // After (2,3): merge → giant=5
        assert_eq!(p.giant_size, vec![2, 3, 3, 3, 5]);
        assert_eq!(p.vertex_count, vec![2, 3, 3, 5, 5]);
    }

    #[test]
    fn classic_random_order_matches_hand_trace() {
        // A small example chosen to exercise union-by-size: build a
        // tree of size 3 first (0-1, 1-2), then a single edge (3-4),
        // then bridge 2-3. Without union-by-size the leftmost tree
        // would dominate; with it, the (parent, child) choice is
        // size-driven. Either way the GIANT (max size) should be 5.
        let p = edgelist_percolation(&[(0, 1), (1, 2), (3, 4), (2, 3)]).unwrap();
        assert_eq!(p.giant_size, vec![2, 3, 3, 5]);
        assert_eq!(p.vertex_count, vec![2, 3, 5, 5]);
    }

    #[test]
    fn high_vertex_ids_are_supported() {
        // Sparse ids: only vertices 100 and 200 touched. Implicit
        // vcount = 201 (huge sizes vector but cheap).
        let p = edgelist_percolation(&[(100, 200)]).unwrap();
        assert_eq!(p.giant_size, vec![2]);
        assert_eq!(p.vertex_count, vec![2]);
    }

    // -------- ALGO-CC-031: bond_percolation (graph + edge order) --------

    #[test]
    fn bond_percolation_natural_order_matches_edgelist() {
        // Chain 0-1-2-3 added in id order: bond_percolation must
        // produce the same curve as the equivalent edgelist call.
        let mut g = Graph::with_vertices(4);
        g.add_edges(vec![(0u32, 1u32), (1, 2), (2, 3)]).unwrap();
        let bond = bond_percolation(&g, &[0, 1, 2]).unwrap();
        let direct = edgelist_percolation(&[(0u32, 1u32), (1, 2), (2, 3)]).unwrap();
        assert_eq!(bond, direct);
    }

    #[test]
    fn bond_percolation_reordered_changes_curve() {
        // Same graph, but adding the bridge first: middle vertex
        // counts grow differently.
        let mut g = Graph::with_vertices(4);
        g.add_edges(vec![(0u32, 1u32), (2, 3), (1, 2)]).unwrap();
        // Order [2, 0, 1]: first add (1,2) → {1,2}; then (0,1) → {0,1,2}; then (2,3) → {0,1,2,3}.
        let p = bond_percolation(&g, &[2, 0, 1]).unwrap();
        assert_eq!(p.giant_size, vec![2, 3, 4]);
        assert_eq!(p.vertex_count, vec![2, 3, 4]);
    }

    #[test]
    fn bond_percolation_partial_order_only_processes_listed_edges() {
        // Graph has 3 edges; order lists only 2 → result reflects
        // only those two additions.
        let mut g = Graph::with_vertices(4);
        g.add_edges(vec![(0u32, 1u32), (2, 3), (1, 2)]).unwrap();
        let p = bond_percolation(&g, &[0, 2]).unwrap();
        // (0,1) then (1,2) → giants 2, 3; touched 2, 3.
        assert_eq!(p.giant_size, vec![2, 3]);
        assert_eq!(p.vertex_count, vec![2, 3]);
    }

    #[test]
    fn bond_percolation_empty_order_returns_empty() {
        let mut g = Graph::with_vertices(3);
        g.add_edge(0, 1).unwrap();
        let p = bond_percolation(&g, &[]).unwrap();
        assert!(p.giant_size.is_empty());
        assert!(p.vertex_count.is_empty());
    }

    #[test]
    fn bond_percolation_duplicate_edge_id_errors() {
        let mut g = Graph::with_vertices(3);
        g.add_edges(vec![(0u32, 1u32), (1, 2)]).unwrap();
        let err = bond_percolation(&g, &[0, 0]).unwrap_err();
        assert!(matches!(err, IgraphError::InvalidArgument(_)));
    }

    #[test]
    fn bond_percolation_out_of_range_edge_id_errors() {
        let mut g = Graph::with_vertices(3);
        g.add_edge(0, 1).unwrap();
        let err = bond_percolation(&g, &[5]).unwrap_err();
        assert!(matches!(err, IgraphError::EdgeOutOfRange { id: 5, m: 1 }));
    }

    #[test]
    fn bond_percolation_directed_graph_ignores_direction() {
        // Edge direction must not affect percolation — same curve as
        // the equivalent undirected version.
        let mut g = Graph::new(3, true).unwrap();
        g.add_edges(vec![(0u32, 1u32), (1, 2)]).unwrap();
        let p = bond_percolation(&g, &[0, 1]).unwrap();
        assert_eq!(p.giant_size, vec![2, 3]);
        assert_eq!(p.vertex_count, vec![2, 3]);
    }

    #[test]
    fn bond_percolation_isolated_vertex_never_counted() {
        // Graph has 4 vertices but only 2 are touched by edges in the
        // given order. Vertex 3 stays isolated, never contributes to
        // vertex_count.
        let mut g = Graph::with_vertices(4);
        g.add_edges(vec![(0u32, 1u32), (0, 2)]).unwrap();
        let p = bond_percolation(&g, &[0, 1]).unwrap();
        assert_eq!(p.vertex_count, vec![2, 3]);
    }

    // -------- ALGO-CC-032: site_percolation (vertex activation) --------

    #[test]
    fn site_percolation_chain_natural_order() {
        // Path 0-1-2-3, activate in id order.
        let mut g = Graph::with_vertices(4);
        g.add_edges(vec![(0u32, 1u32), (1, 2), (2, 3)]).unwrap();
        let p = site_percolation(&g, &[0, 1, 2, 3]).unwrap();
        assert_eq!(p.giant_size, vec![1, 2, 3, 4]);
        assert_eq!(p.edge_count, vec![0, 1, 2, 3]);
    }

    #[test]
    fn site_percolation_reverse_order_same_curve_shape() {
        // Path 0-1-2-3, activate in reverse: 3, 2, 1, 0.
        // Activate 3: no active neighbor, edges=0, giant=1.
        // Activate 2: active nb {3}, edges=1, giant=2.
        // Activate 1: active nb {2}, edges=2, giant=3.
        // Activate 0: active nb {1}, edges=3, giant=4.
        let mut g = Graph::with_vertices(4);
        g.add_edges(vec![(0u32, 1u32), (1, 2), (2, 3)]).unwrap();
        let p = site_percolation(&g, &[3, 2, 1, 0]).unwrap();
        assert_eq!(p.giant_size, vec![1, 2, 3, 4]);
        assert_eq!(p.edge_count, vec![0, 1, 2, 3]);
    }

    #[test]
    fn site_percolation_isolated_vertex_doesnt_grow_giant() {
        // 4-vertex graph: only one edge (0,1); activating 2 or 3
        // doesn't connect anything.
        let mut g = Graph::with_vertices(4);
        g.add_edge(0, 1).unwrap();
        let p = site_percolation(&g, &[0, 1, 2, 3]).unwrap();
        // After 0: giant=1, edges=0
        // After 1: giant=2, edges=1 (edge (0,1) activates)
        // After 2: giant=2, edges=1 (vertex 2 isolated)
        // After 3: giant=2, edges=1 (vertex 3 isolated)
        assert_eq!(p.giant_size, vec![1, 2, 2, 2]);
        assert_eq!(p.edge_count, vec![0, 1, 1, 1]);
    }

    #[test]
    fn site_percolation_triangle_jumps_giant_at_third_vertex() {
        // Triangle: activate 0, 1, 2.
        // 0: giant=1, edges=0
        // 1: 1 connects to 0; giant=2, edges=1
        // 2: 2 connects to 0 and 1 (both active); edges=3, giant=3.
        let mut g = Graph::with_vertices(3);
        g.add_edges(vec![(0u32, 1u32), (0, 2), (1, 2)]).unwrap();
        let p = site_percolation(&g, &[0, 1, 2]).unwrap();
        assert_eq!(p.giant_size, vec![1, 2, 3]);
        assert_eq!(p.edge_count, vec![0, 1, 3]);
    }

    #[test]
    fn site_percolation_partial_order_stops_early() {
        // Only activate first 2 vertices of a 4-vertex graph.
        let mut g = Graph::with_vertices(4);
        g.add_edges(vec![(0u32, 1u32), (1, 2), (2, 3)]).unwrap();
        let p = site_percolation(&g, &[0, 1]).unwrap();
        assert_eq!(p.giant_size, vec![1, 2]);
        assert_eq!(p.edge_count, vec![0, 1]);
    }

    #[test]
    fn site_percolation_empty_order_returns_empty() {
        let mut g = Graph::with_vertices(3);
        g.add_edge(0, 1).unwrap();
        let p = site_percolation(&g, &[]).unwrap();
        assert!(p.giant_size.is_empty());
        assert!(p.edge_count.is_empty());
    }

    #[test]
    fn site_percolation_parallel_edges_count_separately() {
        // Two parallel edges between 0 and 1: activating both yields
        // edge_count = 2 (each parallel edge counted).
        let mut g = Graph::with_vertices(2);
        g.add_edge(0, 1).unwrap();
        g.add_edge(0, 1).unwrap();
        let p = site_percolation(&g, &[0, 1]).unwrap();
        assert_eq!(p.giant_size, vec![1, 2]);
        assert_eq!(p.edge_count, vec![0, 2]);
    }

    #[test]
    fn site_percolation_self_loop_counts_twice_on_activation() {
        // Self-loop on 0 + edge (0,1). Activate 0 first: self-loop
        // appears twice in undirected all-neighbors → edges += 2;
        // the unions are no-ops (same root).
        let mut g = Graph::with_vertices(2);
        g.add_edge(0, 0).unwrap();
        g.add_edge(0, 1).unwrap();
        let p = site_percolation(&g, &[0, 1]).unwrap();
        // After 0: no active neighbors yet — but undirected loop?
        // Sequence: activate 0, walk neighbors of 0 = [0, 0] (loop
        // twice). For each, sizes[0]==1 (just set) → edges += 2.
        // Unions are no-ops. giant=1, edges=2.
        // After 1: neighbor 0 active → edges += 1 = 3; union {0}, {1}
        // → giant=2.
        assert_eq!(p.giant_size, vec![1, 2]);
        assert_eq!(p.edge_count, vec![2, 3]);
    }

    #[test]
    fn site_percolation_directed_graph_treats_both_directions() {
        // Directed 0→1, 1→2: activating 0,1,2 in order treats them
        // as undirected for percolation (in-edges count too).
        let mut g = Graph::new(3, true).unwrap();
        g.add_edges(vec![(0u32, 1u32), (1, 2)]).unwrap();
        let p = site_percolation(&g, &[0, 1, 2]).unwrap();
        assert_eq!(p.giant_size, vec![1, 2, 3]);
        assert_eq!(p.edge_count, vec![0, 1, 2]);
    }

    #[test]
    fn site_percolation_duplicate_vertex_id_errors() {
        let g = Graph::with_vertices(3);
        let err = site_percolation(&g, &[0, 0]).unwrap_err();
        assert!(matches!(err, IgraphError::InvalidArgument(_)));
    }

    #[test]
    fn site_percolation_out_of_range_vertex_errors() {
        let g = Graph::with_vertices(3);
        let err = site_percolation(&g, &[99]).unwrap_err();
        assert!(matches!(
            err,
            IgraphError::VertexOutOfRange { id: 99, n: 3 }
        ));
    }
}