Type: Package Package: ig.degree.betweenness Title: "Node+Edge Betweenness Community Detection Algorithm for 'igraph' Objects" Version: 0.2.0 Authors@R: c( person("Benjamin", "Smith", , "benyamin.smith@mail.utoronto.ca", role = c("aut", "cre"), comment = c(ORCID = "0009-0007-2206-0177")), person("Tyler", "Pittman", , "Tyler.Pittman@uhn.ca", role = "aut", comment = c(ORCID = "0000-0002-5013-6980")), person("Wei", "Xu", , "Wei.Xu@uhn.ca", role = "aut", comment = c(ORCID = "0000-0002-0257-8856")) ) Description: Implements the "Node + Edge Betweenness" community detection algorithm for network analysis using 'igraph' objects. This algorithm combines node degree and betweenness centrality measures to identify communities within networks, with a gradient evident in social partitioning. The package provides functions for implementation of the algorithm, visualization, and analysis of the resulting community structure along with the original dataset used in the publication. Methods are based on results from Smith, Pittman and Xu (2026) . License: MIT + file LICENSE URL: https://github.com/benyamindsmith/ig.degree.betweenness, https://benyamindsmith.github.io/ig.degree.betweenness/ BugReports: https://github.com/benyamindsmith/ig.degree.betweenness/issues Depends: R (>= 4.1.0) Imports: BBmisc, dplyr, ggplot2, igraph, igraphdata, lifecycle, qgraph, rlist, stats, tibble, tidyr Encoding: UTF-8 LazyData: true Roxygen: list(markdown = TRUE) RoxygenNote: 7.3.3 Config/pak/sysreqs: cmake libglpk-dev make libicu-dev libjpeg-dev libpng-dev libuv1-dev libxml2-dev Repository: https://benyamindsmith.r-universe.dev Date/Publication: 2026-06-17 16:26:32 UTC RemoteUrl: https://github.com/benyamindsmith/ig.degree.betweenness RemoteRef: HEAD RemoteSha: 96c8c868c9cfba1ac436b9aa1f327424096f7e4d NeedsCompilation: no Packaged: 2026-06-17 17:54:31 UTC; root Author: Benjamin Smith [aut, cre] (ORCID: ), Tyler Pittman [aut] (ORCID: ), Wei Xu [aut] (ORCID: ) Maintainer: Benjamin Smith