diff --git a/news/index.html b/news/index.html index 5e14d10..ab5e2cd 100644 --- a/news/index.html +++ b/news/index.html @@ -95,6 +95,7 @@

to_components() morpher
  • Added random_walk_rank() to perform random walks on the graph
  • Added centrality_harmonic() + deprecated centrality_closeness_harmonic(). The latter is an interface to netrankr while the former is a more efficient and flexible igraph implementation.
    • +
  • Added group_color() as an interface to greedy_vertex_coloring() in igraph

    • tidygraph 1.2.32023-02-01

    diff --git a/pkgdown.yml b/pkgdown.yml index d267bee..8e58d18 100644 --- a/pkgdown.yml +++ b/pkgdown.yml @@ -2,7 +2,7 @@ pandoc: 2.19.2 pkgdown: 2.0.7 pkgdown_sha: ~ articles: {} -last_built: 2023-11-29T08:16Z +last_built: 2023-11-29T08:25Z urls: reference: https://tidygraph.data-imaginist.com/reference article: https://tidygraph.data-imaginist.com/articles diff --git a/reference/centrality.html b/reference/centrality.html index 36e348f..bfcb428 100644 --- a/reference/centrality.html +++ b/reference/centrality.html @@ -156,7 +156,12 @@

    Calculate node and edge centrality

    centrality_edge_betweenness(weights = NULL, directed = TRUE, cutoff = NULL) -centrality_harmonic(weights, mode = "out", normalized = FALSE, cutoff = NULL) +centrality_harmonic( + weights = NULL, + mode = "out", + normalized = FALSE, + cutoff = NULL +) centrality_manual(relation = "dist_sp", aggregation = "sum", ...) diff --git a/reference/component_games-1.png b/reference/component_games-1.png index 0f0fd49..7e73c59 100644 Binary files a/reference/component_games-1.png and b/reference/component_games-1.png differ diff --git a/reference/edge_types.html b/reference/edge_types.html index e9361c7..f8f703b 100644 --- a/reference/edge_types.html +++ b/reference/edge_types.html @@ -143,19 +143,19 @@

    Examples

    #> # Edge Data: 13 × 3 (active) #> from to single_edge #> <int> <int> <lgl> -#> 1 1 2 TRUE -#> 2 1 3 FALSE -#> 3 3 1 FALSE +#> 1 1 2 FALSE +#> 2 2 1 FALSE +#> 3 3 1 TRUE #> 4 1 4 TRUE #> 5 1 5 FALSE #> 6 5 1 FALSE -#> 7 1 6 TRUE -#> 8 7 1 TRUE -#> 9 1 8 TRUE -#> 10 1 9 FALSE -#> 11 9 1 FALSE -#> 12 1 10 FALSE -#> 13 10 1 FALSE +#> 7 6 1 TRUE +#> 8 1 7 TRUE +#> 9 1 8 FALSE +#> 10 8 1 FALSE +#> 11 1 9 FALSE +#> 12 9 1 FALSE +#> 13 1 10 TRUE #> # #> # Node Data: 10 × 0
    diff --git a/reference/evolution_games-1.png b/reference/evolution_games-1.png index 2c445af..f092d87 100644 Binary files a/reference/evolution_games-1.png and b/reference/evolution_games-1.png differ diff --git a/reference/group_graph.html b/reference/group_graph.html index 68c077f..4fcb755 100644 --- a/reference/group_graph.html +++ b/reference/group_graph.html @@ -115,7 +115,9 @@

    Group nodes and edges based on community structure

    group_walktrap(weights = NULL, steps = 4, n_groups = NULL) -group_biconnected_component() +group_biconnected_component() + +group_color()
    @@ -196,6 +198,7 @@

    Functions

  • group_spinglass(): Group nodes using simulated annealing with igraph::cluster_spinglass()

  • group_walktrap(): Group nodes via short random walks using igraph::cluster_walktrap()

  • group_biconnected_component(): Group edges by their membership of the maximal binconnected components using igraph::biconnected_components()

    • +

  • group_color(): Groups nodes by their color using igraph::greedy_vertex_coloring(). Be aware that this is not a clustering algorithm as coloring specifically provide a color to each node so that no neighbors have the same color

    • diff --git a/reference/index.html b/reference/index.html index c831320..786985d 100644 --- a/reference/index.html +++ b/reference/index.html @@ -179,7 +179,7 @@

    Community detection

    Social network analysis is especially interested in detecting groups or communities within a graph, but such algorithms are also useful in other areas of network research. No single algorithm can provide the correct grouping of nodes so several exists that weigh certain features differently.

    -

    group_components() group_edge_betweenness() group_fast_greedy() group_infomap() group_label_prop() group_leading_eigen() group_louvain() group_optimal() group_spinglass() group_walktrap() group_biconnected_component()

    +

    group_components() group_edge_betweenness() group_fast_greedy() group_infomap() group_label_prop() group_leading_eigen() group_louvain() group_optimal() group_spinglass() group_walktrap() group_biconnected_component() group_color()

    Group nodes and edges based on community structure

    diff --git a/reference/iterate.html b/reference/iterate.html index 2ea5534..2075aea 100644 --- a/reference/iterate.html +++ b/reference/iterate.html @@ -170,19 +170,19 @@

    Examples

    activate(edges) |> slice(-sample(graph_size(), 1)) }) -#> # A tbl_graph: 34 nodes and 71 edges +#> # A tbl_graph: 34 nodes and 70 edges #> # #> # An undirected simple graph with 2 components #> # #> # Node Data: 34 × 0 (active) #> # -#> # Edge Data: 71 × 2 +#> # Edge Data: 70 × 2 #> from to #> <int> <int> #> 1 1 2 #> 2 1 3 #> 3 1 4 -#> # ℹ 68 more rows +#> # ℹ 67 more rows
    diff --git a/reference/map_bfs.html b/reference/map_bfs.html index c0ec6b8..d46285d 100644 --- a/reference/map_bfs.html +++ b/reference/map_bfs.html @@ -178,15 +178,15 @@

    Examples

    #> value value_acc #> <dbl> <dbl> #> 1 61 61 -#> 2 43 104 -#> 3 69 130 -#> 4 12 73 -#> 5 36 140 -#> 6 12 116 -#> 7 76 180 -#> 8 40 170 -#> 9 36 166 -#> 10 88 218 +#> 2 88 149 +#> 3 46 107 +#> 4 78 139 +#> 5 44 193 +#> 6 74 223 +#> 7 75 224 +#> 8 66 173 +#> 9 84 191 +#> 10 67 174 #> # ℹ 30 more rows #> # #> # Edge Data: 39 × 2 diff --git a/reference/map_bfs_back.html b/reference/map_bfs_back.html index df469e3..897965d 100644 --- a/reference/map_bfs_back.html +++ b/reference/map_bfs_back.html @@ -180,16 +180,16 @@

    Examples

    #> # Node Data: 40 × 2 (active) #> value child_acc #> <dbl> <dbl> -#> 1 94 1355 -#> 2 70 530 -#> 3 80 377 -#> 4 14 448 -#> 5 74 265 -#> 6 60 171 -#> 7 12 94 -#> 8 86 135 -#> 9 19 153 -#> 10 28 89 +#> 1 42 1285 +#> 2 51 355 +#> 3 87 453 +#> 4 73 477 +#> 5 55 140 +#> 6 93 51 +#> 7 0 164 +#> 8 58 191 +#> 9 27 99 +#> 10 47 163 #> # ℹ 30 more rows #> # #> # Edge Data: 39 × 2 diff --git a/reference/map_dfs.html b/reference/map_dfs.html index eb439a7..ef17448 100644 --- a/reference/map_dfs.html +++ b/reference/map_dfs.html @@ -174,16 +174,16 @@

    Examples

    #> # Node Data: 40 × 1 (active) #> child_acc #> <int> -#> 1 8 -#> 2 17 -#> 3 13 -#> 4 18 -#> 5 26 -#> 6 27 -#> 7 23 -#> 8 17 -#> 9 19 -#> 10 21 +#> 1 3 +#> 2 12 +#> 3 10 +#> 4 12 +#> 5 20 +#> 6 20 +#> 7 21 +#> 8 18 +#> 9 20 +#> 10 14 #> # ℹ 30 more rows #> # #> # Edge Data: 39 × 2 diff --git a/reference/map_dfs_back.html b/reference/map_dfs_back.html index fe540f5..1fdec36 100644 --- a/reference/map_dfs_back.html +++ b/reference/map_dfs_back.html @@ -177,16 +177,16 @@

    Examples

    #> # Node Data: 40 × 2 (active) #> value child_acc #> <dbl> <list> -#> 1 20 <dbl [27]> -#> 2 79 <dbl [9]> -#> 3 83 <dbl [9]> -#> 4 86 <dbl [9]> -#> 5 40 <dbl [3]> -#> 6 85 <dbl [3]> -#> 7 69 <dbl [3]> -#> 8 67 <dbl [3]> -#> 9 94 <dbl [3]> -#> 10 90 <dbl [3]> +#> 1 30 <dbl [27]> +#> 2 47 <dbl [9]> +#> 3 7 <dbl [9]> +#> 4 27 <dbl [9]> +#> 5 24 <dbl [3]> +#> 6 35 <dbl [3]> +#> 7 72 <dbl [3]> +#> 8 27 <dbl [3]> +#> 9 59 <dbl [3]> +#> 10 92 <dbl [3]> #> # ℹ 30 more rows #> # #> # Edge Data: 39 × 2 diff --git a/reference/map_local.html b/reference/map_local.html index 344fd9c..c3cfdd4 100644 --- a/reference/map_local.html +++ b/reference/map_local.html @@ -161,16 +161,16 @@

    Examples

    #> # Node Data: 70 × 2 (active) #> value value_smooth #> <int> <dbl> -#> 1 2 4.09 -#> 2 7 4.82 -#> 3 3 4.73 -#> 4 6 4.64 -#> 5 4 4.36 -#> 6 7 4.36 -#> 7 5 4.36 -#> 8 8 5.09 -#> 9 6 5.45 -#> 10 4 5.55 +#> 1 8 5 +#> 2 7 5.18 +#> 3 9 5.27 +#> 4 4 5.45 +#> 5 4 5.27 +#> 6 8 5.27 +#> 7 0 5.27 +#> 8 4 4.73 +#> 9 6 4.91 +#> 10 5 4.64 #> # ℹ 60 more rows #> # #> # Edge Data: 140 × 2 diff --git a/reference/node_topology.html b/reference/node_topology.html index 1181919..5a5a775 100644 --- a/reference/node_topology.html +++ b/reference/node_topology.html @@ -122,15 +122,15 @@

    Examples

    #> old_ind #> <int> #> 1 10 -#> 2 3 -#> 3 5 -#> 4 6 -#> 5 9 -#> 6 2 -#> 7 4 -#> 8 8 -#> 9 1 -#> 10 7 +#> 2 8 +#> 3 9 +#> 4 1 +#> 5 5 +#> 6 6 +#> 7 7 +#> 8 4 +#> 9 2 +#> 10 3 #> # #> # Edge Data: 9 × 2 #> from to diff --git a/reference/random_walk_rank.html b/reference/random_walk_rank.html index ee25ca4..8a74dbb 100644 --- a/reference/random_walk_rank.html +++ b/reference/random_walk_rank.html @@ -137,16 +137,16 @@

    Examples

    #> # Node Data: 34 × 1 (active) #> walk_rank #> <list> -#> 1 <int [34]> -#> 2 <int [14]> -#> 3 <int [10]> -#> 4 <int [15]> -#> 5 <int [13]> -#> 6 <int [6]> -#> 7 <int [13]> -#> 8 <int [7]> -#> 9 <int [5]> -#> 10 <int [0]> +#> 1 <int [22]> +#> 2 <int [18]> +#> 3 <int [15]> +#> 4 <int [13]> +#> 5 <int [2]> +#> 6 <int [2]> +#> 7 <int [2]> +#> 8 <int [6]> +#> 9 <int [8]> +#> 10 <int [3]> #> # ℹ 24 more rows #> # #> # Edge Data: 78 × 2 @@ -168,16 +168,16 @@

    Examples

    #> # Edge Data: 78 × 3 (active) #> from to walk_rank #> <int> <int> <list> -#> 1 1 2 <int [2]> +#> 1 1 2 <int [6]> #> 2 1 3 <int [2]> -#> 3 1 4 <int [7]> -#> 4 1 5 <int [2]> -#> 5 1 6 <int [0]> +#> 3 1 4 <int [5]> +#> 4 1 5 <int [3]> +#> 5 1 6 <int [2]> #> 6 1 7 <int [0]> #> 7 1 8 <int [4]> -#> 8 1 9 <int [4]> -#> 9 1 11 <int [4]> -#> 10 1 12 <int [0]> +#> 8 1 9 <int [2]> +#> 9 1 11 <int [3]> +#> 10 1 12 <int [6]> #> # ℹ 68 more rows #> # #> # Node Data: 34 × 0 diff --git a/reference/sampling_games-1.png b/reference/sampling_games-1.png index 229cab4..a631552 100644 Binary files a/reference/sampling_games-1.png and b/reference/sampling_games-1.png differ diff --git a/reference/type_games-1.png b/reference/type_games-1.png index 5051ba1..f6af3d0 100644 Binary files a/reference/type_games-1.png and b/reference/type_games-1.png differ diff --git a/reference/with_graph.html b/reference/with_graph.html index b52d2fc..f8545a1 100644 --- a/reference/with_graph.html +++ b/reference/with_graph.html @@ -114,7 +114,7 @@

    Examples

    gr <- play_gnp(10, 0.3)
 
 with_graph(gr, centrality_degree())
-#>  [1] 4 2 4 2 6 5 1 1 3 1
+#>  [1] 6 5 3 3 4 2 3 4 3 5