Add comments

justcoding121 · justcoding121 · commit 43fbaeb3f448 · 2021-04-21T02:58:58.000-06:00
diff --git a/src/Advanced.Algorithms/Graph/Matching/HopcroftKarp.cs b/src/Advanced.Algorithms/Graph/Matching/HopcroftKarp.cs
@@ -127,7 +127,8 @@ private List<T> bfs(IGraph<T> graph,
 
         /// <summary>
         /// Find an augmenting path that start from a given free vertex on right and ending
-        /// at a free vertex on left. Return the matching edges along that path.
+        /// at a free vertex on left, via Matched (right -> left) and UnMatched (left -> right) edges alternatively.  
+        /// Return the matching edges along that path.
         /// </summary>
         private HashSet<MatchEdge<T>> dfs(IGraph<T> graph,
             Dictionary<T, T> leftToRightMatchEdges,
