Summary

This branch migrates graph dependencies to igraph away from network to reduce package dependence risk, load time, and maintenance complexity.

The dstr package was used to help determine which dependencies would have greater 'impact' as the result of being removed.

Changes

The changes made in this PR are:

1. Migrated network_g2g() and network_p2p() to an igraph implementation.
2. Removed following package dependencies on:

• network
• GGally
• widyr

3. Created a custom data.table implementation of pairwise_count() that replaces the previous widyr::pairwise_count() used in tm_cooc().

Check

• All R CMD checks pass
• Breaking changes to arguments are properly documented.

Changes in argument

For network_p2p() - old implementation:

network_p2p(
  data,
  hrvar,
  return = "pdf",
  path = "network_p2p",
  bg_fill = "#000000",
  font_col = "#FFFFFF",
  legend_pos = "bottom",
  palette = "rainbow",
  ...
)

New implementation:

network_p2p(
  data,
  hrvar,
  return = "pdf",
  path = "network_p2p",
  bg_fill = "#000000",
  font_col = "#FFFFFF",
  legend_pos = "bottom",
  palette = "rainbow",
  node_alpha = 0.7,
  algorithm = "fr"
)

There are some changes to the range of node placement algorithms, which is now more dependent on igraph rather than sna. See https://rdrr.io/cran/ggraph/man/layout_tbl_graph_igraph.html for algorithm options.

Only the ... argument is removed for network_g2g(). For both functions, an igraph graph object is now returned instead of a network object.

Visual contrast

Using network::network() and GGally::ggnet2():

Using new igraph implementation:

Note

This addresses the load time issue referenced in #16.