A Secure and Memory-Efficient Heap Allocator
-
Updated
Jun 21, 2024 - C++
A Secure and Memory-Efficient Heap Allocator
Algorithms and Data Structures course at ITMO University
Visualization for "A*" pathfinding algorithm in a grid-based map developed with SFML, C++
Data compression C++ library
Implementations of some algorithms and data structures using C++.
Implemented MST (Minimum Spanning Tree) for a weighted, undirected graph using Prim’s algorithm. The program uses an 'adjacency list' and 'edge matrix' to support various commands and manipulations. These include: calculating MST value, finding the degree of a vertex, inserting/deleting edges, etc.
Add a description, image, and links to the heap-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the heap-algorithm topic, visit your repo's landing page and select "manage topics."