Create README.md

aman-raza · Oct 27, 2020 · c35791b · c35791b
1 parent f999b6d
commit c35791b
Showing 1 changed file with 3 additions and 0 deletions.
diff --git a/CPP/Minimum Spanning Tree Algorithm/README.md b/CPP/Minimum Spanning Tree Algorithm/README.md
@@ -0,0 +1,3 @@
+## (In this folder, I have added Krushal's Minimum Spanning Tree Algo)
+# What is Minimum Spanning Tree? 
+Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees. A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected and undirected graph is a spanning tree with weight less than or equal to the weight of every other spanning tree. The weight of a spanning tree is the sum of weights given to each edge of the spanning tree.