#d3js

Find the project on my Github

unreleased work (2013), showing frequency of commuter routes from some originating location (where the colors are brightest, somewhere in walnut creek or concord) to all other travel destinations. for reference, san francisco is on the middle-left.

Click here to see the maps for other cities

Tower of Hanoi is a classic puzzle.  The goal is to move all blocks from one column to another column while preserving the order of the blocks.  The trick is that at no point can a larger block be on top of a smaller block.

Mapping Three Centuries of World Population

How can we check if a linked list has a cycle in it?  There’s a pretty clever way to do it - keep two pointers, one that moves forward by one node (blue), and one the moves forward by two nodes (black).  If there’s a cycle, then the black node wrap around and “catch” the blue node.  If the nodes never overlap, then there can’t be a cycle.