Originally started out as an interview-preparation project, May 2015.

Project Hierarchy:

This is a C#.NET solution-project, and it contains three subprojects:

1. Algorithms: A class library project. Contains the Algorithms implementations.
2. Data Structures: A class library project. Contains the Data Structures implementations.
3. Main Program: Contains tests for the data structures and algorithms projects.

• C# 5.
• .NET 4.5.

Note: The projects where tested on Xamarin Studio (MonoDevelop) on OSX 10, and Visual Studio on Windows 7. All of the project compile successfully. All tests in the MainProgram project pass.

• Single-Linked List.
• Double-Linked List.
• Array List.
• Stack.
• Queue.
• Skip List.

• Binary-Min Heap.
• Binary-Max Heap.
• Binomial-Min Heap.

• Min-Priority Queue.
• Keyed Priority Queue.

• Prime Hashing Family.
• Universal Hashing Family.

• Chained Hash Table.
• Cuckoo Hash Table.

• Trie, and Trie Map.
• AVL Tree.
• Binary Search Tree.
• Augmented Binary Search Tree.

Undirected Graphs:

• Clique Graphs.
• Undirected Sparse Graph.
• Undirected Dense Graph.

Directed Graphs:

• Directed Sparse Graph.
• Directed Dense Graph.

Directed Weighted Graphs:

• Directed Weighted Sparse Graph.
• Directed Weighted Dense Graph.

=================================================================

• Insertion Sort.
• Quick Sort.
• Merge Sort.
• Heap Sort.
• BST Sort.
• Counting Sort.
• LSD Radix Sort.

Graph Search:

• Depth-First Searcher.
• Breadth-First Searcher.

Shortest Paths:

• Breadth-First SPs.
• Bellman-Ford SPs.
• Dijkstra SPs.
• Dijkstra All-Pairs SPs.

DFS Applications:

• Cycles Detector.
• Topological Sorter.

BFS Applications:

• Connected Components.

• Permutations and Anagrams.
• Edit Distance.
• Uses a generic custom class for passing costs: EditDistanceCostsMap<T>.

• Catalan Numbers.

• Tree Drawer.

=================================================================

• Edgar Carballo Domínguez.

This project is licensed under the MIT License.