Skip to content
#

min-heap

Here are 137 public repositories matching this topic...

Zero-dependency data structures: linked lists (doubly/singly linked, circular), deques, ring buffers, unrolled lists, caches (LRU, LFU, SLRU, Clock, FIFO), heaps (binary, indexed, pairing), timer wheels, object pools, queues, stacks, splay trees, skip lists.

  • Updated Jul 28, 2026
  • JavaScript

An efficient C++ representation of an edge-based (un)directed graph {V,E} with search and other graph theory algorithms, plus a basic implementation of Teresco's METAL highway pathfinding project.

  • Updated Dec 20, 2017
  • C++

Insertion Sort, Quick Sort, Merge Sort, Min Heap, Priority Queue, Red Black Tree, Order Statistic Tree, Graph Creation, Breadth-First and Depth-First Search and Homework Assignments

  • Updated Sep 30, 2020
  • C++

A Java simulation of a tactical radio network using custom data structures and Dijkstra's algorithm. Models signal-aware routing with path-loss edge weights and route recomputation under Electronic Warfare (EW) jamming.

  • Updated Jul 25, 2026
  • Java

Improve this page

Add a description, image, and links to the min-heap topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the min-heap topic, visit your repo's landing page and select "manage topics."

Learn more