[HOME]

Coded at the start of the Covid-19 Pandemic. A simulated epidemic with a basic reproductive number (R

Graph exploration algorithm. Each branch is given information of the nodes within a certain distance to it. With this limited information, it will attempt to make the straightest path possible without crossing any other branches.

For each frame of the animation, a target angle is given. Pairs of nodes are algorithmically selected such that the line that bisects them is as close as possible to said angle.

Hand coded search algorithm - a "counter clockwise" search of a complete graph. The graph is traversed in a purely counter clockwise fashion, such that each loop is optimally "wide" given a maximum search depth.