Breadth first search(BFS) is a very powerful and useful algorithm for
exploring graph like structures. A BFS searches it’s nearest neighbors first
before moving on. It’s main use is to find a path using
the fewest hops. Here we use it to explore a grid that can be modified
by a user. In this grid, we have verticies (the grid boxes), and edges
(the box north, south, east and west).
I previously posted a lottery data visualization in which I
attempted to correlate how often a certain number came up in the PA
lottery given that some other number came up. I built the visualization
using Python, SQLite, and Chart.JS on the front end. Since, I like sql
I’ll about the queries and methods used. These methods could probably
be massively improved, but I did it in a couple of hours, because I was
In this post, I provide access to a data visualizer for the Pennsylvania
lottery using data I pull regularly from their RSS feed. This tool uses
SQLite and some scripts to automatically pull data to this post which is
then visualized using Chart.js. I created histograms of the most
common drawn numbers for the drawings in which a particular number
appears, and you can see that visualized below in the charts.
I’ve had a credit card now for about 2 years, so I thought I would make
a cool visualization that shows my relative spend through out the year
on a daily basis. I think this plot came out to be relatively cool.