Adding wikipedia url for Algorithm

ptzecher · ptzecher · commit 329d47074afb · 2025-08-13T14:24:07.000+03:00
diff --git a/src/main/java/com/thealgorithms/graph/HopcroftKarp.java b/src/main/java/com/thealgorithms/graph/HopcroftKarp.java
@@ -4,6 +4,7 @@
 
 /**
  * @author Panteleimon Tzecheridis
+ *
  * Implementation of the Hopcroft–Karp algorithm for finding the maximum matching in a bipartite graph.
  *
  * The bipartite graph is assumed to have:
@@ -15,6 +16,8 @@
  *   adj[0] = [0, 1]  // left vertex 0 connects to right vertices 0 and 1
  *
  * Time complexity: O(E * sqrt(V))
+ *
+ * @see <a href="https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm">Wikipedia: Hopcroft–Karp algorithm</a>
  */
 public class HopcroftKarp {
 

Original file line number	Diff line number	Diff line change
`@@ -4,6 +4,7 @@`
`4`	`4`
`5`	`5`	`/**`
`6`	`6`	`* @author Panteleimon Tzecheridis`
	`7`	`+ *`
`7`	`8`	`* Implementation of the Hopcroft–Karp algorithm for finding the maximum matching in a bipartite graph.`
`8`	`9`	`*`
`9`	`10`	`* The bipartite graph is assumed to have:`
`@@ -15,6 +16,8 @@`
`15`	`16`	`* adj[0] = [0, 1] // left vertex 0 connects to right vertices 0 and 1`
`16`	`17`	`*`
`17`	`18`	`* Time complexity: O(E * sqrt(V))`
	`19`	`+ *`
	`20`	`+ * @see <a href="https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm">Wikipedia: Hopcroft–Karp algorithm</a>`
`18`	`21`	`*/`
`19`	`22`	`public class HopcroftKarp {`
`20`	`23`