Graph generation and search
Built a maze generator and solver around a 64 × 64 perfect-maze setting. Explored BFS, DFS, Kruskal’s algorithm, and Dijkstra’s algorithm in generation and solving workflows.
Distributed execution
Used MPI for parallel processing, working with graph computation across communicating processes.