Algorithms

C++ implementations of some of the algorithms I like

Currently working on Dynamic Programming

---

Compilation

Compilation Notes

• Note that the code utilizes C++11 features, please ensure that your compiler supports such functionality
• Graph Theory source uses a templated class structure. In your project, place the graph.cpp in the same directory as graph.hpp and do NOT include the CPP file in your project

Algorithms

Data Structures

AVL Trees

• fundamental mutators

Red-Black Trees

• fundamental mutators
• successor
• predecessor
• get_rank

Graphs

• fundamental mutators

Graph Traversal

• Breadth-First Search
• Depth-First Search

Single Source Weighted Shortest Path

• Belmlman-Ford Algorithm
• Dijsktra's Algorithm

Minimum Spanning Trees

• Kruskal's MST
• Prim's MST

All Pair Shortest Path

• Floyd-Warshall Algorithm

Graph Theory

• Topological Sort

Sorting & Selecting

• Bubble Sort
• Count Sort
• Insertion Sort
• Quickselect (randomized)
• Quickselect (median of medians)
• Quicksort
• Mergesort