Skip to contents

Constructor modifier to drop multiple edges

Usage

without_multiples()

See also

Examples

sample_(pa(10, m = 3, algorithm = "bag"))
#> ── <igraph> Barabasi graph ────────────────────────────────────────── 3254909 ──
#>  directed
#>  10 vertices · 27 edges
#> 
#> ── Attributes ──────────────────────────────────────────────────────────────────
#> → graph:  name <chr>, power <dbl>, m <dbl>, zero.appeal <dbl>, algorithm <chr>
#> 
#> ── Edges ───────────────────────────────────────────────────────────────────────
#>  [1] 2 → 1   2 → 1   2 → 1   3 → 2   3 → 2   3 → 1   4 → 1   4 → 3   4 → 1  
#> [10] 5 → 3   5 → 1   5 → 3   6 → 1   6 → 3   6 → 1   7 → 1   7 → 3   7 → 3  
#> [19] 8 → 1   8 → 1   8 → 3   9 → 1   9 → 3   9 → 1   10 → 1  10 → 1  10 → 2 
sample_(pa(10, m = 3, algorithm = "bag"), without_multiples())
#> ── <igraph> Barabasi graph ────────────────────────────────────────── 2cedee0 ──
#>  directed
#>  10 vertices · 16 edges
#> 
#> ── Attributes ──────────────────────────────────────────────────────────────────
#> → graph:  name <chr>, power <dbl>, m <dbl>, zero.appeal <dbl>, algorithm <chr>
#> 
#> ── Edges ───────────────────────────────────────────────────────────────────────
#>  [1] 2 → 1   3 → 1   4 → 1   4 → 2   4 → 3   5 → 1   5 → 2   6 → 3   7 → 1  
#> [10] 7 → 3   8 → 1   8 → 6   9 → 1   9 → 2   9 → 8   10 → 1