Add kruskal algorithm description

README.md

@@ -61,6 +61,7 @@ An alternative to [Boost Graph Library (BGL)](https://www.boost.org/doc/libs/1_7
       - [Cycle Detection](#cycle-detection)
       - [Bellman-Ford](#bellman-ford)
       - [Floyd Warshall](#floyd-warshall)
+      - [Kruskal Algorithm](#kruskal-algorithm)
   * [Partition Algorithm Explanation](#partition-algorithm-explanation)
     + [Vertex-Cut](#vertex-cut)
     + [Greedy Vertex-Cut](#greedy-vertex-cut)
@@ -319,6 +320,18 @@ We initialize the solution matrix same as the input graph matrix as a first step
 1) k is not an intermediate vertex in shortest path from i to j. We keep the value of dist[i][j] as it is.
 2) k is an intermediate vertex in shortest path from i to j. We update the value of dist[i][j] as dist[i][k] + dist[k][j] if dist[i][j] > dist[i][k] + dist[k][j]
 
+#### Kruskal Algorithm
+[Kruskal Algorithm](https://en.wikipedia.org/wiki/Kruskal%27s_algorithm) can be used to find the minimum spanning forest of an undirected edge-weighted graph.  Time Complexity O(E log E) = O(E log V) where V is number of vertices and E is number of edges in graph. The main speed limitation for this algorithm is sorting the edges.
+
+For a quick understanding of the algorithm procedure, check [this video](https://www.youtube.com/watch?v=71UQH7Pr9kU).
+Some of the real life applications are:
+- LAN/TV Network
+- Tour Operations
+- Water/gas pipe network
+- Electric grid
+
+Other algorithms to find the minimum spanning forest are Prim's algorithm or Borůvka's algorithm.
+
 ## Partition Algorithm Explanation
 
 ### Vertex-Cut