Provides a dataset containing several color naming conventions established by multiple sources, along with associated color metadata.
    The package also provides related helper functions for mapping among the different Lego color naming conventions and between Lego colors, hex colors, and 'R' color names, 
    making it easy to convert any color palette to one based on existing Lego colors while keeping as close to the original color palette as possible.
    The functions use nearest color matching based on Euclidean distance in RGB space. 
    Naming conventions for color mapping include those from 'BrickLink' (<https://www.bricklink.com>), 'The Lego Group' (<https://www.lego.com>), 'LDraw' (<https://www.ldraw.org/>), and 'Peeron' (<http://www.peeron.com/>).

Designed to query Longitudinal Employer-Household Dynamics (LEHD) 
    workplace/residential association and origin-destination flat files and 
    optionally aggregate Census block-level data to block group, tract, county, 
    or state. Data comes from the LODES FTP server <https://lehd.ces.census.gov/data/lodes/LODES8/>.

Miscellaneous R functions (for graphics, data import, 
    data transformation, and general utilities) and templates (for exploratory 
    analysis, Bayesian modeling, and crafting scientific manuscripts).

Implements the 'Python leidenalg' module to be called in R.
    Enables clustering using the leiden algorithm for partition a graph into communities.
    See the 'Python' repository for more details: <https://github.com/vtraag/leidenalg>
    Traag et al (2018) From Louvain to Leiden: guaranteeing well-connected communities. <arXiv:1810.08473>.

An R interface to the Leiden algorithm, an iterative community detection algorithm on networks. The algorithm is designed to converge to a partition in which all subsets of all communities are locally optimally assigned, yielding communities guaranteed to be connected. The implementation proves to be fast, scales well, and can be run on graphs of millions of nodes (as long as they can fit in memory). The original implementation was constructed as a python interface "leidenalg" found here: <https://github.com/vtraag/leidenalg>. The algorithm was originally described in Traag, V.A., Waltman, L. & van Eck, N.J. "From Louvain to Leiden: guaranteeing well-connected communities". Sci Rep 9, 5233 (2019) <doi:10.1038/s41598-019-41695-z>.