Tidy Tuesday: Tornadoes

Mapping the paths of tornados in Kentucky from 1952 - 2022 with the sf packing in R and data from NOAA’s National Weather Service Storm Prediction Center Severe Weather Maps, Graphics, and Data Page

Tidy Tuesday: Childcare Costs

The National Database of Childcare Prices (NDCP) is the most comprehensive federal source of childcare prices at the county level. The database offers childcare price data by childcare provider type, age of children, and county characteristics. Data are available from 2008 to 2018.

Generating Examples of Maximal Room Squares in R

A partial Room square is maximal if no further pair of elements can be placed into any unoccupied cell without violating the conditions that define a partial Room square. This blog posts describes two approaches to creating maximal partial Room squares in R.

Extracting Text from Images with Google Vision API and R

Using Vision API and R to extract text from images of handwriting.

Tidy Tuesday: Internet Access

This week’s Tidy Tuesday data comes from two sources, Microsoft and the FCC by way of The Verge.

Tidy Tuesday: Water Sources

This week’s Tidy Tuesday data comes from Water Point Data Exchange (WPDx), a global platform for sharing water point data.

Tidy Tuesday: Adoptable Dogs

Tidy Tuesday for week fifty-one of 2019 was all about dogs available for adoption in the United States through PetFinder. The data was collected by Amber Thomas for her piece Finding Forever Homes which appeared in The Pudding in October 2019.

Tidy Tuesday: Replicating Plots in R

Tidy Tuesday in week fifty of 2019 was all about this blog post by Rafael Irizarry on replicating plots in R.

Functional Geometry in R

This post introduces funcgeo, an R package for functional geometry, by recreating Square Limit by M. Escher following the approach of Henderson (1982).

Euler Paths

An implementation of multigraphs in Maxima and an approach to deciding whether a path in a multigraph is an Euler path or not.

Greedy Edge Colouring of Small Graphs

A NetworkX-based implementation of greedy edge-colouring for graphs in graph6 format. Using this implementation we investigate the average case performance on all non-isomorphic, connected simple graphs of at most nine vertices.

More on Moore Graphs

An implementation of a filter for Moore graphs in graph6 format in Python using the NetworkX and igraph packages

Chromatic Indices of Small Graphs

Calculating the chromatic index of all graphs on at most nine vertices with ten edges or fewer.

Small Moore Graphs

Finding Moore graphs on at most ten vertices.

Colouring Small Regular Graphs