We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 08ce5d2 commit 386f436Copy full SHA for 386f436
src/main/java/com/thealgorithms/greedyalgorithms/KruskalAlgorithm.java
@@ -3,6 +3,8 @@
3
/**
4
* An encapsulated, self-contained implementation of Kruskal's algorithm
5
* for computing the Minimum Spanning Tree (MST) of a weighted, undirected graph.
6
+ * You can find more about this algorithm in the following link:
7
+ * <a href="https://www.geeksforgeeks.org/dsa/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/">Kruskal algorithm - Geeks for Geeks</a>
8
* <p>
9
* To avoid namespace conflicts and maintain isolation within larger projects,
10
* all collaborators (Edge, Graph, DisjointSet) are implemented as private
0 commit comments