Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]

Exercise generator and helpful materials for the Introduction to Algorithms and Data Structures 📚

Multithreaded brute force Rubix Cube solver

Priority queue implementation in scheme language

🍂 Heap data structures for JavaScript

Some advanced data structures' implementations in C++

These are my test cases for my semester project (Data Structure Library) in my data structures and algorithms class. It includes test cases for circular dynamic arrays, red black trees, binary heaps, and binomial heaps.

Repo for Algorithm and DataStructures with visualization parameter

Receives file as list of cities and distance between these cities. Creates an Adjacency List, graph, then creates a Binomial Queue and uses Dijkstra's Algorithm to continually remove shortest distance between cities. SEE README

A sandbox for playing with binary heap, binomial heap and Fibonacci heap

Visualizing purely functional data structures in OCaml

Created a persistent binary search tree (PBST) and persistent stack. When adding a new element will create a new stack or PBST with the new element and connect the new PBST or stack to the previous PBST or stack. ***Please see README***

Detailed explanations and implementations of some of my favorite specialized data structures and algorithms.

Single Source Shortest Path (SSSP) problem via Dijcstras Dijkstra's algorithm with d-heap and binomial heap.

The Algortimo y Estructura de datos course taken at the Computer Science School.

A simple word search engine using Binomial Heap Algorithm with C Programming Language

Priority queues in finding shortest path.

Implemented Dijkstra’s algorithm and compared performance when implemented using fibonacci, binomial and binary heaps in CPP. Ran algorithm on New York’s road network dataset which consisted of around 0.2M nodes and 0.7M edges. Concluded that fibonacci Heap gives performance enhancement on such a large dataset compared to other two heaps.