From c35791b93da7ac9585d7c253e338c68c3ed14678 Mon Sep 17 00:00:00 2001 From: Samarth Paliwal Date: Tue, 27 Oct 2020 12:50:50 +0530 Subject: [PATCH] Create README.md --- CPP/Minimum Spanning Tree Algorithm/README.md | 3 +++ 1 file changed, 3 insertions(+) create mode 100644 CPP/Minimum Spanning Tree Algorithm/README.md diff --git a/CPP/Minimum Spanning Tree Algorithm/README.md b/CPP/Minimum Spanning Tree Algorithm/README.md new file mode 100644 index 0000000..191ccd1 --- /dev/null +++ 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.