comments

Author: justcoding121

Advanced.Algorithms/Graph/Bridge/TarjansBridgeFinder.cs

@@ -77,6 +77,9 @@ private List<Bridge<T>> dfs(GraphVertex<T> currentVertex,
         }
     }
 
+    /// <summary>
+    /// The bridge object.
+    /// </summary>
     public class Bridge<T>
     {
         public T vertexA { get; }

Advanced.Algorithms/Graph/Coloring/MColorer.cs

@@ -3,7 +3,9 @@
 
 namespace Advanced.Algorithms.Graph
 {
-
+    /// <summary>
+    /// An m-coloring algorithm implementation.
+    /// </summary>
     public class MColorer<T, C>
     {
         /// <summary>

Advanced.Algorithms/Graph/Cover/MinVertexCover.cs

@@ -3,6 +3,9 @@
 
 namespace Advanced.Algorithms.Graph
 {
+    /// <summary>
+    /// A minimum vertex conver algorithm implementation.
+    /// </summary>
     public class MinVertexCover<T>
     {
         public List<GraphVertex<T>> GetMinVertexCover(Graph<T> graph)

Advanced.Algorithms/Graph/Cut/MinimumCut.cs

@@ -87,6 +87,9 @@ private void dfs(WeightedDiGraphVertex<T, W> currentResidualGraphVertex,
         }
     }
 
+    /// <summary>
+    /// Minimum cut result object.
+    /// </summary>
     public class MinCutEdge<T>
     {
         public T Source { get; }

Advanced.Algorithms/Graph/Flow/EdmondsKarp.cs

@@ -6,7 +6,7 @@ namespace Advanced.Algorithms.Graph
 {
 
     /// <summary>
-    /// A Edmond Karp max flox implementation on weighted directed graph using 
+    /// An Edmond Karp max flow implementation on weighted directed graph using 
     /// adjacency list representation of graph & residual graph.
     /// </summary>
     public class EdmondKarpMaxFlow<T, W> where W : IComparable

Advanced.Algorithms/Graph/Matching/BiPartiteMatching.cs

@@ -109,6 +109,9 @@ private static WeightedDiGraph<T, int> createFlowGraph(Graph<T> graph,
         }
     }
 
+    /// <summary>
+    /// The match result object.
+    /// </summary>
     public class MatchEdge<T>
     {
         public T Source { get; }

Advanced.Algorithms/Graph/ShortestPath/Floyd-Warshall.cs

@@ -4,6 +4,9 @@
 
 namespace Advanced.Algorithms.Graph
 {
+    /// <summary>
+    /// A floyd-warshall shortest path algorithm implementation.
+    /// </summary>
     public class FloydWarshallShortestPath<T, W> where W : IComparable
     {
         readonly IShortestPathOperators<W> operators;

Advanced.Algorithms/Graph/ShortestPath/Johnsons.cs

@@ -6,6 +6,9 @@
 
 namespace Advanced.Algorithms.Graph
 { 
+    /// <summary>
+    /// A Johnson's shortest path algorithm implementation.
+    /// </summary>
     public class JohnsonsShortestPath<T, W> where W : IComparable
     {
         readonly IJohnsonsShortestPathOperators<T, W> operators;

Advanced.Algorithms/Numerical/Exponentiation.cs

@@ -1,5 +1,8 @@
 namespace Advanced.Algorithms.Numerical
 {
+    /// <summary>
+    /// A fast exponentiation algorithm implementation.
+    /// </summary>
     public class FastExponentiation
     {
         /// <summary>

Advanced.Algorithms/Numerical/PrimeGenerator.cs

@@ -3,11 +3,11 @@
 
 namespace Advanced.Algorithms.Numerical
 {
+    /// <summary>
+    /// A prime number generation algorithm using Sieve of Eratosthenes.
+    /// </summary>
     public class PrimeGenerator
     {
-        /// <summary>
-        /// Prime generation using Sieve of Eratosthenes.
-        /// </summary>
         public static List<int> GetAllPrimes(int max)
         {
             var primeTable = new bool[max + 1];