Screenshots, download links, and more project listings coming soon!
Summer 2022
I developed a program to explore the execution of various graph search algorithms and their respective properties, specifically regarding time- and space-complexity.
I created a customizable grid that allows each algorithm to be executed on user-defined graphs.
I implemented the following graph search algorithms:
A* (Heuristics: Manhattan distance, diagonal distance, Euclidian distance, constant distance)
Dijkstra's algorithm
Breadth-first search (BFS)
Depth-first search (DFS), iterative implementation
Depth-first search (DFS), recursive implementation
Spring 2022 — Based on coursework completed at Rice University
I modeled the spread of an infectious disease outbreak using genetic and epidemiological data from a 2011 study.
I identified the most likely transmission route by computing a rooted directed minimum spanning tree (RDMST).