Some solutions for Data Structures and Algorithms Specialization at Coursera.

最小二叉堆(binary heap)实现优先队列，原文地址：http://www.srcmini.com/1588.html

K Largest Elements in an array

12 Common Data Structures in C, TypeScript, and Python

Generic min heap in (ANSI) C

Finding shortest path from source node to all nodes using dijkstra's in linearithmic time

I have worked on developing the implementation of Huffman Compression Algorithm on Strings along with run time encoding. Written in C, the program works on Min Heaps and Huffman Tree data structures. It uses Huffman algorithm—create a Huffman Tree using the frequencies of each character using heap data structure—and Run-time-encoding to compression

Implementing a minHeapScheduler replacing the default round-robin

Standard generic data structures for C99.

A basic C-based Dijkstra's algorithm application for finding shortest paths in city networks. Features user-specified input and min-heap for efficiency.

Program for searching cheapest path in graph

This program written in C compresses a given .txt file, which can be decompressed later using the same program

Maze solver and generator with Dijkstra's Shortest Path Algorithm and Min Heap

This repository contains all the data structure programs in C programming language

This repository contains a project implementing a Red-Black Tree and Dijkstra's algorithm to efficiently find the shortest paths in directed, weighted graphs. Developed as part of a course at POLIMI, the project features optimized data structures and algorithms for graph operations, achieving a grade of 30 cum laude / 30.