Update README.md

Author: aalhour

README.md

@@ -10,129 +10,145 @@ This project originally started out as an interview preparation project. However
 
 This is a C#.NET solution-project, and it contains three subprojects:
 
-  1. [Algorithms](Algorithms): A class library project. Contains the Algorithms implementations.
-  2. [Data Structures](DataStructures): A class library project. Contains the Data Structures implementations.
-  3. [UnitTest](UnitTest): Unit-testing project for the Algorithms and Data Structures.
+  1. [Algorithms](Algorithms): A class library project. Contains the Algorithms implementations
+  2. [Data Structures](DataStructures): A class library project. Contains the Data Structures implementations
+  3. [UnitTest](UnitTest): Unit-testing project for the Algorithms and Data Structures
 
 #### Requirements:
+
   1. .NET Core >= 2.0
   2. XUnit
 
 #### A Note to Contributors:
+
 If you wish to contribute to C# ALGORITHMS, then please make sure you check out the [Contribution Guidelines](CONTRIBUTING.md) first.
 
-Note: The projects where tested with Visual Studio Community using .NET Core 2.0.3 on OSX 10.
+Note: The projects where tested with Visual Studio Community using .NET Core 2.0.3 on mac OS.
 
 
 ## DATA STRUCTURES
 
 #### Lists:
-  * [Skip List](DataStructures/Lists/SkipList.cs).
-  * [Array List](DataStructures/Lists/ArrayList.cs).
-  * [Stack](DataStructures/Lists/Stack.cs).
-  * [Queue](DataStructures/Lists/Queue.cs).
-  * [Single-Linked List](DataStructures/Lists/SLinkedList.cs).
-  * [Double-Linked List](DataStructures/Lists/DLinkedList.cs).
+
+  * [Skip List](DataStructures/Lists/SkipList.cs)
+  * [Array List](DataStructures/Lists/ArrayList.cs)
+  * [Stack](DataStructures/Lists/Stack.cs)
+  * [Queue](DataStructures/Lists/Queue.cs)
+  * [Single-Linked List](DataStructures/Lists/SLinkedList.cs)
+  * [Double-Linked List](DataStructures/Lists/DLinkedList.cs)
 
 #### Heaps:
-  * [Binary-Min Heap](DataStructures/Heaps/BinaryMinHeap.cs).
-  * [Binary-Max Heap](DataStructures/Heaps/BinaryMaxHeap.cs).
-  * [Binomial-Min Heap](DataStructures/Heaps/BinomialMinHeap.cs).
+
+  * [Binary-Min Heap](DataStructures/Heaps/BinaryMinHeap.cs)
+  * [Binary-Max Heap](DataStructures/Heaps/BinaryMaxHeap.cs)
+  * [Binomial-Min Heap](DataStructures/Heaps/BinomialMinHeap.cs)
 
 #### Priority Queues:
-  * [Min-Priority Queue](DataStructures/Heaps/MinPriorityQueue.cs).
-  * [Keyed Priority Queue](DataStructures/Heaps/KeyedPriorityQueue.cs).
+
+  * [Min-Priority Queue](DataStructures/Heaps/MinPriorityQueue.cs)
+  * [Keyed Priority Queue](DataStructures/Heaps/KeyedPriorityQueue.cs)
 
 #### Hashing Functions:
-  * [Prime Hashing Family](DataStructures/Hashing/PrimeHashingFamily.cs).
-  * [Universal Hashing Family](DataStructures/Hashing/UniversalHashingFamily.cs).
+
+  * [Prime Hashing Family](DataStructures/Hashing/PrimeHashingFamily.cs)
+  * [Universal Hashing Family](DataStructures/Hashing/UniversalHashingFamily.cs)
 
 #### Hash Tables:
-  * [Chained Hash Table](DataStructures/Dictionaries/ChainedHashTable.cs).
-  * [Cuckoo Hash Table](DataStructures/Dictionaries/CuckooHashTable.cs).
-  * [Open-Addressing Hash Table](DataStructures/Dictionaries/OpenAddressingHashTable.cs).
+
+  * [Chained Hash Table](DataStructures/Dictionaries/ChainedHashTable.cs)
+  * [Cuckoo Hash Table](DataStructures/Dictionaries/CuckooHashTable.cs)
+  * [Open-Addressing Hash Table](DataStructures/Dictionaries/OpenAddressingHashTable.cs)
 
 #### Sorted Collections (Tree-based):
-  * [Sorted List](DataStructures/SortedCollections/SortedList.cs).
-  * [Sorted Dictionary](DataStructures/SortedCollections/SortedDictionary.cs).
+
+  * [Sorted List](DataStructures/SortedCollections/SortedList.cs)
+  * [Sorted Dictionary](DataStructures/SortedCollections/SortedDictionary.cs)
 
 #### Trees:
-  * [Trie](DataStructures/Trees/Trie.cs).
-  * [Trie Map](DataStructures/Trees/TrieMap.cs).
-  * [AVL Tree](DataStructures/Trees/AVLTree.cs).
-  * [Red-Black Tree](DataStructures/Trees/RedBlackTree.cs).
-    * [Map version](DataStructures/Trees/RedBlackTreeMap.cs). Supports key-value pairs nodes; indexes nodes by keys.
-  * [Binary Search Tree](DataStructures/Trees/BinarySearchTree.cs).
-    * [Map version](DataStructures/Trees/BinarySearchTreeMap.cs). Supports key-value pairs nodes; indexes nodes by keys.
-  * [Augmented Binary Search Tree](DataStructures/Trees/AugmentedBinarySearchTree.cs).
+
+  * [Trie](DataStructures/Trees/Trie.cs)
+  * [Trie Map](DataStructures/Trees/TrieMap.cs)
+  * [AVL Tree](DataStructures/Trees/AVLTree.cs)
+  * [Red-Black Tree](DataStructures/Trees/RedBlackTree.cs)
+    * [Map version](DataStructures/Trees/RedBlackTreeMap.cs) _(supports key-value pairs nodes; indexes nodes by keys)_
+  * [Binary Search Tree](DataStructures/Trees/BinarySearchTree.cs)
+    * [Map version](DataStructures/Trees/BinarySearchTreeMap.cs) _(supports key-value pairs nodes; indexes nodes by keys)_
+  * [Augmented Binary Search Tree](DataStructures/Trees/AugmentedBinarySearchTree.cs)
 
 #### Graphs:
+
   * Undirected Graphs:
-    + [Clique Graphs](DataStructures/Graphs/CliqueGraph.cs).
-    + [Undirected Sparse Graph](DataStructures/Graphs/UndirectedSparseGraph.cs).
-    + [Undirected Dense Graph](DataStructures/Graphs/UndirectedDenseGraph.cs).
+    + [Clique Graphs](DataStructures/Graphs/CliqueGraph.cs)
+    + [Undirected Sparse Graph](DataStructures/Graphs/UndirectedSparseGraph.cs)
+    + [Undirected Dense Graph](DataStructures/Graphs/UndirectedDenseGraph.cs)
   * Undirected Weighted Graphs:
-    + [Undirected Weighted Sparse Graph](DataStructures/Graphs/UndirectedWeightedSparseGraph.cs).
-    + [Undirected Weighted Dense Graph](DataStructures/Graphs/UndirectedWeightedDenseGraph.cs).
+    + [Undirected Weighted Sparse Graph](DataStructures/Graphs/UndirectedWeightedSparseGraph.cs)
+    + [Undirected Weighted Dense Graph](DataStructures/Graphs/UndirectedWeightedDenseGraph.cs)
   * Directed Graphs:
-    + [Directed Sparse Graph](DataStructures/Graphs/DirectedSparseGraph.cs).
-    + [Directed Dense Graph](DataStructures/Graphs/DirectedDenseGraph.cs).
+    + [Directed Sparse Graph](DataStructures/Graphs/DirectedSparseGraph.cs)
+    + [Directed Dense Graph](DataStructures/Graphs/DirectedDenseGraph.cs)
   * Directed Weighted Graphs:
-    + [Directed Weighted Sparse Graph](DataStructures/Graphs/DirectedWeightedSparseGraph.cs).
-    + [Directed Weighted Dense Graph](DataStructures/Graphs/DirectedWeightedDenseGraph.cs).
+    + [Directed Weighted Sparse Graph](DataStructures/Graphs/DirectedWeightedSparseGraph.cs)
+    + [Directed Weighted Dense Graph](DataStructures/Graphs/DirectedWeightedDenseGraph.cs)
 
 
 ## ALGORITHMS
 
 #### Sorting:
-  * [Bubble Sort](Algorithms/Sorting/BubbleSorter.cs).
-  * [Bucket Sort](Algorithms/Sorting/BucketSorter.cs).
-  * [BST Sort](Algorithms/Sorting/BinarySearchTreeSorter.cs).
-  * [Comb Sort](Algorithms/Sorting/CombSorter.cs).
-  * [Counting Sort](Algorithms/Sorting/CountingSorter.cs).
-  * [Cycle Sort](Algorithms/Sorting/CycleSorter.cs).
-  * [Gnome Sort](Algorithms/Sorting/GnomeSorter.cs).
-  * [Heap Sort](Algorithms/Sorting/HeapSorter.cs).
-  * [Insertion Sort](Algorithms/Sorting/InsertionSorter.cs).
-  * [LSD Radix Sort](Algorithms/Sorting/LSDRadixSorter.cs).
-  * [Merge Sort](Algorithms/Sorting/MergeSorter.cs).
-  * [Selection Sort](Algorithms/Sorting/SelectionSorter.cs).
-  * [Shell Sort](Algorithms/Sorting/ShellSorter.cs).
-  * [OddEven Sort](Algorithms/Sorting/OddEvenSorter.cs).
-  * [PigeonHole Sort](Algorithms/Sorting/PigeonHoleSorter.cs).
-  * [Quick Sort](Algorithms/Sorting/QuickSorter.cs).
+
+  * [Bubble Sort](Algorithms/Sorting/BubbleSorter.cs)
+  * [Bucket Sort](Algorithms/Sorting/BucketSorter.cs)
+  * [BST Sort](Algorithms/Sorting/BinarySearchTreeSorter.cs)
+  * [Comb Sort](Algorithms/Sorting/CombSorter.cs)
+  * [Counting Sort](Algorithms/Sorting/CountingSorter.cs)
+  * [Cycle Sort](Algorithms/Sorting/CycleSorter.cs)
+  * [Gnome Sort](Algorithms/Sorting/GnomeSorter.cs)
+  * [Heap Sort](Algorithms/Sorting/HeapSorter.cs)
+  * [Insertion Sort](Algorithms/Sorting/InsertionSorter.cs)
+  * [LSD Radix Sort](Algorithms/Sorting/LSDRadixSorter.cs)
+  * [Merge Sort](Algorithms/Sorting/MergeSorter.cs)
+  * [Selection Sort](Algorithms/Sorting/SelectionSorter.cs)
+  * [Shell Sort](Algorithms/Sorting/ShellSorter.cs)
+  * [OddEven Sort](Algorithms/Sorting/OddEvenSorter.cs)
+  * [PigeonHole Sort](Algorithms/Sorting/PigeonHoleSorter.cs)
+  * [Quick Sort](Algorithms/Sorting/QuickSorter.cs)
 
 #### Graphs:
+
   * Graph Search:
-    + [Depth-First Searcher](Algorithms/Graphs/DepthFirstSearcher.cs).
-    + [Breadth-First Searcher](Algorithms/Graphs/BreadthFirstSearcher.cs).
+    + [Depth-First Searcher](Algorithms/Graphs/DepthFirstSearcher.cs)
+    + [Breadth-First Searcher](Algorithms/Graphs/BreadthFirstSearcher.cs)
   * Shortest Paths:
-    + [Breadth-First SPs](Algorithms/Graphs/BreadthFirstShortestPaths.cs).
-    + [Bellman-Ford SPs](Algorithms/Graphs/BellmanFordShortestPaths.cs).
-    + [Dijkstra SPs](Algorithms/Graphs/DijkstraShortestPaths.cs).
-    + [Dijkstra All-Pairs SPs](Algorithms/Graphs/DijkstraAllPairsShortestPaths.cs).
+    + [Breadth-First SPs](Algorithms/Graphs/BreadthFirstShortestPaths.cs)
+    + [Bellman-Ford SPs](Algorithms/Graphs/BellmanFordShortestPaths.cs)
+    + [Dijkstra SPs](Algorithms/Graphs/DijkstraShortestPaths.cs)
+    + [Dijkstra All-Pairs SPs](Algorithms/Graphs/DijkstraAllPairsShortestPaths.cs)
   * DFS Applications:
-    + [Cycles Detector](Algorithms/Graphs/CyclesDetector.cs).
-    + [Topological Sorter](Algorithms/Graphs/TopologicalSorter.cs).
+    + [Cycles Detector](Algorithms/Graphs/CyclesDetector.cs)
+    + [Topological Sorter](Algorithms/Graphs/TopologicalSorter.cs)
   * BFS Applications:
-    + [Connected Components](Algorithms/Graphs/ConnectedComponents.cs).
-    + [Bipartite Graphs Coloring](Algorithms/Graphs/BipartiteColoring.cs).
+    + [Connected Components](Algorithms/Graphs/ConnectedComponents.cs)
+    + [Bipartite Graphs Coloring](Algorithms/Graphs/BipartiteColoring.cs)
 
 #### Trees:
-  * [Recursive Binary Tree Walker](Algorithms/Trees/BinaryTreeRecursiveWalker.cs).
-    + Methods: PrintAll, ForEach, Contains and BinarySearch. Traversal Modes: Preorder, Inorder & Postorder.
+
+  * [Recursive Binary Tree Walker](Algorithms/Trees/BinaryTreeRecursiveWalker.cs)
+    + Methods: PrintAll, ForEach, Contains and BinarySearch. Traversal Modes: Preorder, Inorder & Postorder
 
 #### Strings:
-  * [Permutations and Anagrams](Algorithms/Strings/Permutations.cs).
-  * [Edit Distance](Algorithms/Strings/EditDistance.cs).
-    + Uses a generic custom class for passing costs: [EditDistanceCostsMap\<T\>](Algorithms/Strings/EditDistanceCostsMap.cs).
+
+  * [Permutations and Anagrams](Algorithms/Strings/Permutations.cs)
+  * [Edit Distance](Algorithms/Strings/EditDistance.cs)
+    + Uses a generic custom class for passing costs: [EditDistanceCostsMap\<T\>](Algorithms/Strings/EditDistanceCostsMap.cs)
 
 #### Numeric:
-  * [Catalan Numbers](Algorithms/Numeric/CatalanNumbers.cs).
+
+  * [Catalan Numbers](Algorithms/Numeric/CatalanNumbers.cs)
   * [Greatest Common Divisor](Algorithms/Numeric/GreatestCommonDivisor.cs)
 
 #### Visualization:
-  * [Tree Drawer](DataStructures/Trees/TreeDrawer.cs).
+
+  * [Tree Drawer](DataStructures/Trees/TreeDrawer.cs)
 
 
 ## CONTRIBUTORS
@@ -145,4 +161,5 @@ Note: The projects where tested with Visual Studio Community using .NET Core 2.0
 <!-- Made with [contributors-img](https://contributors-img.firebaseapp.com). -->
 
 ## LICENSE
+
 This project is licensed under the [MIT License](LICENSE).