DESCRIPTION

Package: ig.degree.betweenness
Type: Package
Title: "Smith-Pittman Community Detection Algorithm for 'igraph' Objects (2024)"
Version: 0.1.0
Authors@R: c(
    person(
    "Benjamin", 
    "Smith",
    email="benyamin.smith@mail.utoronto.ca" , 
    role = c("aut","cre"),
    comment = c(ORCID = "0009-0007-2206-0177")
    ),
    person(
    "Tyler",
    "Pittman",
     email = "Tyler.Pittman@uhn.ca", 
     role = c("aut"),
     comment = c(ORCID = "0000-0002-5013-6980")
     ),
     person(
     "Wei",
     "Xu",
     email = "Wei.Xu@uhn.ca",
     role = c("aut"),
     comment = c(ORCID = "0000-0002-0257-8856")
     )
  )
Description: Implements the "Smith-Pittman" 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 community detection, visualization, and analysis of 
    the resulting community structure. Methods are based on results from Smith, 
    Pittman and Xu (2024) <doi:10.48550/arXiv.2411.01394>.
License: MIT + file LICENSE
URL: https://github.com/benyamindsmith/ig.degree.betweenness
BugReports: https://github.com/benyamindsmith/ig.degree.betweenness/issues
Encoding: UTF-8
LazyData: true
Imports:
  igraph,
  igraphdata,
  rlist,
  BBmisc,
  qgraph
RoxygenNote: 7.3.2
Suggests: 
    knitr,
    rmarkdown