justcoding121 · justcoding121 · Aug 8, 2018 · Aug 6, 2018 · Aug 6, 2018 · Aug 6, 2018
diff --git a/Advanced.Algorithms.Tests/Distributed/AsyncQueue_Tests.cs b/Advanced.Algorithms.Tests/Distributed/AsyncQueue_Tests.cs
@@ -31,7 +31,7 @@ public void AsyncQueue_Test()
             //multi-threaded async producer
             tasks.AddRange(Enumerable.Range(1, testDataCount).Select(async x =>
             {
-                await Task.Delay(random.Next(0, 2));
+                await Task.Delay(random.Next(0, 1));
 
                 await producerLock.WaitAsync();
 
@@ -46,7 +46,7 @@ public void AsyncQueue_Test()
             //multi-threaded async consumer
             tasks.AddRange(Enumerable.Range(1, testDataCount).Select(async x =>
             {
-                await Task.Delay(random.Next(0, 2));
+                await Task.Delay(random.Next(0, 1));
 
                 await consumerLock.WaitAsync();
 

diff --git a/Advanced.Algorithms/DataStructures/Graph/AdjacencyList/DiGraph.cs b/Advanced.Algorithms/DataStructures/Graph/AdjacencyList/DiGraph.cs
@@ -114,7 +114,7 @@ public void AddEdge(T source, T dest)
         }
 
         /// <summary>
-        /// Remove an existing edge between source & destination.
+        /// Remove an existing edge between source and destination.
         /// Time complexity: O(1).
         /// </summary>
         public void RemoveEdge(T source, T dest)
@@ -218,7 +218,7 @@ public IEnumerator<T> GetEnumerator()
     }
 
     /// <summary>
-    /// DiGraph vertex. 
+    /// DiGraph vertex for adjacency list Graph implementation. 
     /// IEnumerable enumerates all the outgoing edge destination vertices.
     /// </summary>
     public class DiGraphVertex<T> : IEnumerable<T>

diff --git a/Advanced.Algorithms/DataStructures/Graph/AdjacencyList/Graph.cs b/Advanced.Algorithms/DataStructures/Graph/AdjacencyList/Graph.cs
@@ -62,7 +62,6 @@ public GraphVertex<T> AddVertex(T value)
         /// Remove an existing vertex from this graph.
         /// Time complexity: O(V) where V is the number of vertices.
         /// </summary>
-        /// <param name="vertex"></param>
         public void RemoveVertex(T vertex)
         {
             if (vertex == null)
@@ -188,7 +187,7 @@ public IEnumerator<T> GetEnumerator()
     }
 
     /// <summary>
-    /// Graph vertex.
+    /// Graph vertex for adjacency list Graph implementation. 
     /// IEnumerable enumerates all the outgoing edge destination vertices.
     /// </summary>
     public class GraphVertex<T> : IEnumerable<T>

diff --git a/Advanced.Algorithms/DataStructures/Graph/AdjacencyList/WeightedDiGraph.cs b/Advanced.Algorithms/DataStructures/Graph/AdjacencyList/WeightedDiGraph.cs
@@ -224,7 +224,7 @@ public IEnumerator<T> GetEnumerator()
     }
 
     /// <summary>
-    /// A weighted graph vertex.
+    /// A weighted graph vertex for adjacency list Graph implementation. 
     /// IEnumerable enumerates all the outgoing edge destination vertices.
     /// </summary>
     public class WeightedDiGraphVertex<T, TW> : IEnumerable<T> where TW : IComparable

diff --git a/Advanced.Algorithms/DataStructures/Graph/AdjacencyList/WeightedGraph.cs b/Advanced.Algorithms/DataStructures/Graph/AdjacencyList/WeightedGraph.cs
@@ -181,9 +181,9 @@ public IEnumerator<T> GetEnumerator()
             return Vertices.Select(x => x.Key).GetEnumerator();
         }
     }
-  
+
     /// <summary>
-    /// A weighted graph vertex.
+    /// A weighted graph vertex for adjacency list Graph implementation. 
     /// IEnumerable enumerates all the outgoing edge destination vertices.
     /// </summary>
     public class WeightedGraphVertex<T, TW> : IEnumerable<T> where TW : IComparable

diff --git a/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/DiGraph.cs b/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/DiGraph.cs
@@ -74,7 +74,6 @@ public void AddVertex(T value)
         /// Remove an existing vertex from graph
         /// Time complexity: O(V) where V is the number of vertices.
         /// </summary>
-        /// <param name="value"></param>
         public void RemoveVertex(T value)
         {
             if (value == null)
@@ -112,8 +111,6 @@ public void RemoveVertex(T value)
         /// add an edge from source to destination vertex
         /// Time complexity: O(1).
         /// </summary>
-        /// <param name="source"></param>
-        /// <param name="dest"></param>
         public void AddEdge(T source, T dest)
         {
             if (source == null || dest == null)
@@ -137,7 +134,7 @@ public void AddEdge(T source, T dest)
         }
 
         /// <summary>
-        /// remove an existing edge between source & destination
+        /// remove an existing edge between source and destination
         /// Time complexity: O(1).
         /// </summary>
         public void RemoveEdge(T source, T dest)

diff --git a/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/Graph.cs b/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/Graph.cs
@@ -1,6 +1,7 @@
 using System;
 using System.Collections;
 using System.Collections.Generic;
+using System.Linq;
 
 namespace Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix
 {
@@ -9,7 +10,7 @@ namespace Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix
     /// A directed graph implementation using dynamically growinng/shrinking adjacency matrix array.
     /// IEnumerable enumerates all vertices.
     /// </summary>
-    public class Graph<T>
+    public class Graph<T> : IEnumerable<T>
     {
         public int VerticesCount => usedSize;
 
@@ -135,7 +136,7 @@ public void AddEdge(T source, T dest)
         }
 
         /// <summary>
-        /// Remove an existing edge between source & destination.
+        /// Remove an existing edge between source and destination.
         /// Time complexity: O(1).
         /// </summary>
         public void RemoveEdge(T source, T dest)
@@ -298,5 +299,15 @@ private void halfMatrixSize()
             reverseVertexIndices = newReverseIndices;
             maxSize /= 2;
         }
+
+        IEnumerator IEnumerable.GetEnumerator()
+        {
+            return GetEnumerator();
+        }
+
+        public IEnumerator<T> GetEnumerator()
+        {
+            return vertexIndices.Select(x => x.Key).GetEnumerator();
+        }
     }
 }
diff --git a/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/WeightedDiGraph.cs b/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/WeightedDiGraph.cs
@@ -1,13 +1,15 @@
 using System;
+using System.Collections;
 using System.Collections.Generic;
+using System.Linq;
 
 namespace Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix
 {
     /// <summary>
     /// A weighted graph implementation using dynamically growinng/shrinking adjacency matrix array.
     /// IEnumerable enumerates all vertices.
     /// </summary>
-    public class WeightedDiGraph<T, TW> where TW : IComparable
+    public class WeightedDiGraph<T, TW> : IEnumerable<T> where TW : IComparable
     {
         public int VerticesCount => usedSize;
 
@@ -301,5 +303,15 @@ private void halfMatrixSize()
             reverseVertexIndices = newReverseIndices;
             maxSize /= 2;
         }
+
+        IEnumerator IEnumerable.GetEnumerator()
+        {
+            return GetEnumerator();
+        }
+
+        public IEnumerator<T> GetEnumerator()
+        {
+            return vertexIndices.Select(x => x.Key).GetEnumerator();
+        }
     }
 }
diff --git a/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/WeightedGraph.cs b/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/WeightedGraph.cs
@@ -1,13 +1,15 @@
 using System;
+using System.Collections;
 using System.Collections.Generic;
+using System.Linq;
 
 namespace Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix
 {
     /// <summary>
     /// A weighted graph implementation using dynamically growinng/shrinking adjacency matrix array.
     /// IEnumerable enumerates all vertices.
     /// </summary>
-    public class WeightedGraph<T, TW> where TW : IComparable
+    public class WeightedGraph<T, TW> : IEnumerable<T> where TW : IComparable
     {
         public int VerticesCount => usedSize;
 
@@ -288,5 +290,15 @@ private void halfMatrixSize()
             reverseVertexIndices = newReverseIndices;
             maxSize /= 2;
         }
+
+        IEnumerator IEnumerable.GetEnumerator()
+        {
+            return GetEnumerator();
+        }
+
+        public IEnumerator<T> GetEnumerator()
+        {
+            return vertexIndices.Select(x => x.Key).GetEnumerator();
+        }
     }
 }
diff --git a/Advanced.Algorithms/DataStructures/Heap/Max/BinomialMaxHeap.cs b/Advanced.Algorithms/DataStructures/Heap/Max/BinomialMaxHeap.cs
@@ -135,7 +135,6 @@ public void Merge(BinomialMaxHeap<T> binomialHeap)
         /// <summary>
         /// Time complexity: O(log(n)).
         /// </summary>
-        /// <returns></returns>
         public T PeekMax()
         {
             if (heapForest.Head == null)
@@ -184,7 +183,7 @@ private void meld()
                     cur = next;
                     next = cur.Next;
                 }
-                //degress of cur & next are same
+                //degress of cur and next are same
                 else
                 {
                     //case 2 next degree equals next-next degree

diff --git a/Advanced.Algorithms/DataStructures/Heap/Max/FibornacciMaxHeap.cs b/Advanced.Algorithms/DataStructures/Heap/Max/FibornacciMaxHeap.cs
@@ -291,7 +291,6 @@ private void cut(FibornacciHeapNode<T> node)
         /// <summary>
         /// Merges the given fibornacci node list to current Forest 
         /// </summary>
-        /// <param name="headPointer"></param>
         private void mergeForests(FibornacciHeapNode<T> headPointer)
         {
             var current = headPointer;

diff --git a/Advanced.Algorithms/DataStructures/Heap/Min/BinomialMinHeap.cs b/Advanced.Algorithms/DataStructures/Heap/Min/BinomialMinHeap.cs
@@ -135,7 +135,6 @@ public void Merge(BinomialMinHeap<T> binomialHeap)
         /// <summary>
         /// Time complexity: O(log(n)).
         /// </summary>
-        /// <returns></returns>
         public T PeekMin()
         {
             if (heapForest.Head == null)
@@ -184,7 +183,7 @@ private void meld()
                     cur = next;
                     next = cur.Next;
                 }
-                //degress of cur & next are same
+                //degress of cur and next are same
                 else
                 {
                     //case 2 next degree equals next-next degree
@@ -228,7 +227,7 @@ private void meld()
 
         /// <summary>
         /// Merges the given sorted forest to current sorted Forest 
-        /// & returns the last inserted node (pointer required for decrement-key)
+        /// and returns the last inserted node (pointer required for decrement-key)
         /// </summary>
         private void mergeSortedForests(DoublyLinkedList<BinomialHeapNode<T>> newHeapForest)
         {

diff --git a/Advanced.Algorithms/DataStructures/Heap/Min/FibornacciMinHeap.cs b/Advanced.Algorithms/DataStructures/Heap/Min/FibornacciMinHeap.cs
@@ -288,7 +288,6 @@ private void cut(FibornacciHeapNode<T> node)
         /// <summary>
         /// Merges the given fibornacci node list to current Forest 
         /// </summary>
-        /// <param name="headPointer"></param>
         private void mergeForests(FibornacciHeapNode<T> headPointer)
         {
             var current = headPointer;

diff --git a/Advanced.Algorithms/DataStructures/LinkedList/DoublyLinkedList.cs b/Advanced.Algorithms/DataStructures/LinkedList/DoublyLinkedList.cs
@@ -198,7 +198,7 @@ public T DeleteFirst()
         /// Delete tail node.
         /// Time complexity: O(1)
         /// </summary>
-        /// <returns></returns>
+        /// 
         public T DeleteLast()
         {
             if (Tail == null)
@@ -344,7 +344,7 @@ internal void Union(DoublyLinkedList<T> newList)
         /// <summary>
         /// Time complexity: O(1).
         /// </summary>
-        /// <returns></returns>
+        /// 
         public bool IsEmpty() => Head == null;
 
         /// <summary>

diff --git a/Advanced.Algorithms/DataStructures/LinkedList/SinglyLinkedList.cs b/Advanced.Algorithms/DataStructures/LinkedList/SinglyLinkedList.cs
@@ -51,7 +51,6 @@ public void InsertLast(T data)
         /// <summary>
         /// Time complexity: O(1).
         /// </summary>
-        /// <returns></returns>
         public T DeleteFirst()
         {
             if (Head == null)
@@ -69,7 +68,6 @@ public T DeleteFirst()
         /// <summary>
         /// Time complexity: O(n).
         /// </summary>
-        /// <returns></returns>
         public T DeleteLast()
         {
             if (Head == null)

diff --git a/Advanced.Algorithms/DataStructures/List/ArrayList.cs b/Advanced.Algorithms/DataStructures/List/ArrayList.cs
@@ -56,7 +56,6 @@ public ArrayList(IEnumerable<T> initial)
         /// Time complexity: O(1).
         /// </summary>
         /// <param name="index">The index to write or read.</param>
-        /// <returns></returns>
         public T this[int index]
         {
             get => itemAt(index);
@@ -75,7 +74,6 @@ private T itemAt(int i)
         /// Add a new item to this array list.
         /// Time complexity: O(1) amortized.
         /// </summary>
-        /// <param name="item"></param>
         public void Add(T item)
         {
             grow();

diff --git a/Advanced.Algorithms/DataStructures/List/SkipList.cs b/Advanced.Algorithms/DataStructures/List/SkipList.cs
@@ -41,8 +41,6 @@ public SkipList(int maxHeight = 32)
         /// If item is not found default value of T will be returned.
         /// Time complexity: O(log(n)).
         /// </summary>
-        /// <param name="value"></param>
-        /// <returns></returns>
         public T Find(T value)
         {
             var current = Head;

diff --git a/Advanced.Algorithms/DataStructures/Queues/PriorityQueue/MaxPriorityQueue.cs b/Advanced.Algorithms/DataStructures/Queues/PriorityQueue/MaxPriorityQueue.cs
@@ -23,7 +23,6 @@ public void Enqueue(T item)
         /// <summary>
         /// Time complexity:O(log(n)).
         /// </summary>
-        /// <returns></returns>
         public T Dequeue()
         {
             return maxHeap.ExtractMax();
@@ -32,7 +31,6 @@ public T Dequeue()
         /// <summary>
         /// Time complexity:O(1).
         /// </summary>
-        /// <returns></returns>
         public T Peek()
         {
             return maxHeap.PeekMax();

diff --git a/Advanced.Algorithms/DataStructures/Queues/PriorityQueue/MinPriorityQueue.cs b/Advanced.Algorithms/DataStructures/Queues/PriorityQueue/MinPriorityQueue.cs
@@ -31,7 +31,6 @@ public T Dequeue()
         /// <summary>
         /// Time complexity:O(1).
         /// </summary>
-        /// <returns></returns>
         public T Peek()
         {
             return minHeap.PeekMin();

diff --git a/Advanced.Algorithms/DataStructures/Queues/Queue.cs b/Advanced.Algorithms/DataStructures/Queues/Queue.cs
@@ -31,7 +31,6 @@ public Queue(QueueType type = QueueType.Array)
         /// <summary>
         /// Time complexity:O(1).
         /// </summary>
-        /// <param name="item"></param>
         public void Enqueue(T item)
         {
             queue.Enqueue(item);
@@ -40,7 +39,6 @@ public void Enqueue(T item)
         /// <summary>
         /// Time complexity:O(1).
         /// </summary>
-        /// <returns></returns>
         public T Dequeue()
         {
             return queue.Dequeue();