• Wrote original implementations of a minimum priority heap with an array, a chained hash with a
dictionary, a doubly linked list, and an array disjoint set.
• Implemented Kruskal’s Algorithm with array disjoint sets to find the minimum spanning trees of a
path between a start and finish in a maze of random paths and walls
• Incorporated all data structures with Kruskal’s to recreate Dijkstra’s Algorithm, finding the shortest
path between two nodes in any visually generated maze.