A priority queue for Rust with efficient change function.
-
Updated
Apr 19, 2026 - Rust
A priority queue for Rust with efficient change function.
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++
Computing matrix determinant using permutations (exploring with Heap's Algorithm)
A graph and tree based algorithms animator used for educational purposes.
interactive tree visualizer (BST, max heap)
This is a choice based card game revolving around a typical college student. This game was inspired by the 20 questions & Reigns card game. (WCC)
Repositório dos roteiros da disciplina de Laboratório de Estrutura de Dados
My own implementation of malloc and free
Collection of Assignments and Programs For CS 146: Data Structures and Algorithms
Smart ambulance dispatch and hospital optimization tool using Java, Spring Boot, React, Dijkstra's Algorithm, Graphs, and Heap-based Priority Queues with real-time dynamic ambulance reassignment.
C# implementation of Heaps algorithm to help get all the posible permutation of an array of objects
Implementation and comparison of d-ary heaps
Data compression C++ library
Implementations of some algorithms and data structures using C++.
Journey Through the Kingdom of Aspire C++ simulation of a fantasy inventory system using Fibonacci max/min heaps to manage gems. Implements player commands (D[x], M[x], R[k], etc.) for trading, theft, and scripted gameplay, fulfilling the Algorithms and Data Structures 2 coursework on Using Heaps in a Computer Game
Implementations of some common data structures and algorithms. These are based on the assignments that are offered in CSE204 course by BUET.
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.
To associate your repository with the heap-algorithm topic, visit your repo's landing page and select "manage topics."