C++ application that allows visualization of the Minimum Spanning Trees construction algorithms Prim’s and Kruskal’s in steps. Allows interaction with the graph and control over the visualization process, which allows observing the process of decision-making of the algorithm and building the tree step by step rather than just presenting the result. Used SFML library for rendering and Dear ImGui library for interactive interface implementation; separated the graph itself, algorithms, rendering process, and user interface into different modules. The most difficult part was developing the algorithms to run step-by-step in order to keep the application responsive.

The undergraduate project dealt with learning about Singular Value Decomposition (SVD) and its application in image compression. SVD was performed on the image matrix. Only the first k largest singular values were considered, thereby forming the reduced rank matrix of the original image. In case of grayscale images, SVD was directly performed on the image matrix. However, in the case of colored images, SVD was performed on each of the RGB components separately.