my implementation of "data structures" using C++

A Steiner graph solver using: binary heap, adjacency list, Dijkstra’s algorithm, OpenMP parallelisation, Takahashi and Matsuyama's heuristics, with tools for solution verification and validation

Data Structures in C++

Fat heap as a data structure

Project for the "Advanced Data Structures and Algorithms" Curricular Unit (FEUP) - VRP Solver

Implementing the Dijkstra algorithm with a d-ary heap

C++ is a cross-platform language that can be used to create high-performance applications. C++ was developed by Bjarne Stroustrup, as an extension to the C language. C++ gives programmers a high level of control over system resources and memory. The language was updated 4 major times in 2011, 2014, 2017, and 2020 to C++11, C++14, C++17, C++20.

Well known algorithms, my own algorithms and data structures implemented from scratch

This Repository contains the core concepts and implementation of Data Structures & Algorithms which include arrays, linked list, queues , stacks ,binary trees, BST, AVL Trees, sorting techniques and general operations

Several commonly used data structures are implemented with C++11.

My implementation for some popular data structures.

Implementation of Common Data Structures in C++

Comparison of Dijkstra's running time using a binary min heap and a Fibonacci heap.

Comparison of Dijkstra's running time using a Fibonacci heap, a binary heap, an array and a priority queue.

Dijkstra's algorithm for an undirected graph using a binary heap

Data Structures & Algorithms

C++ implementation of various data structures.

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.

This library has several different data structure implementations. This was made for my CS201 class (Data Structures and Algorithms).

Реализация двоичной кучи на базе массива