Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Browse files
Browse the repository at this point in the history
Create README.md
- Loading branch information
Showing
1 changed file
with
34 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,34 @@ | ||
yasi | ||
==== | ||
|
||
Yet Another Skiena Implementation | ||
|
||
About | ||
===== | ||
This is an ongoing project where I implemented various data structures and algorithms in C++, loosely following the content of the Alogirhtms Manual book by Steven Skiena. | ||
|
||
The code is written using standard C++ in Microsoft Visual Studio 2013. Code is tested using Google C++ framework. | ||
|
||
Data Structures (So Far) | ||
======================== | ||
Singly/Doubly linked lists with iterators | ||
Binary tree | ||
Heap and Priority Queue, both regular and mutable (where you can change keys of existing elements) | ||
Binary search tree (BST) | ||
Dictionary based on BST | ||
Hash tables | ||
> Linear probing | ||
> Separate chaining | ||
> Hop Scotch | ||
Graph (adjacency list) | ||
Coming soon: Locality sensitive hashing (LSH) | ||
|
||
Algorithms | ||
========== | ||
Graph Algorithms: | ||
> BFS | ||
Coming soon: Approximate near neighbor search using LSH | ||
|
||
Authors and Contributors | ||
======================== | ||
Right now, there is only one author: Saad Quader (@saq10002) |